MCC'2025- Execution of r114-tall-174876422700453

About the Execution of ITS-Tools for JoinFreeModules-PT-0200

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
0.000	576574.00	0.00	0.00	201 201 201 202 203 200 200 201 201 202 202 201 203 200 200 202	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422700453.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 JoinFreeModules-PT-0200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876422700453
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 613K May 29 14:32 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748845052434

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0200
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-02 06:17:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 06:17:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 06:17:34] [INFO ] Load time of PNML (sax parser for PT used): 215 ms
[2025-06-02 06:17:34] [INFO ] Transformed 1001 places.
[2025-06-02 06:17:34] [INFO ] Transformed 1601 transitions.
[2025-06-02 06:17:34] [INFO ] Parsed PT model containing 1001 places and 1601 transitions and 4602 arcs in 392 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Reduce places removed 1 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[1, 1, 1, 2, 0, 200, 200, 1, 1, 2, 0, 1, 0, 200, 200, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 1, 1, 2, 0, 200, 200, 1, 1, 2, 0, 1, 0, 200, 200, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 1601 rows 1000 cols
[2025-06-02 06:17:34] [INFO ] Computed 200 invariants in 42 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 2, 0, 200, 200, 1, 1, 2, 0, 1, 0, 200, 200, 0] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
RANDOM walk for 10038 steps (2 resets) in 146 ms. (68 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 1719 ms. (93 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10, 201, 2, 12, 200, 200, 10, 10, 2, 9, 10, 12, 200, 200, 9] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
[2025-06-02 06:17:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:17:38] [INFO ] [Real]Absence check using 200 positive place invariants in 83 ms returned sat
[2025-06-02 06:17:38] [INFO ] [Real]Absence check using state equation in 636 ms returned sat
[2025-06-02 06:17:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:17:39] [INFO ] [Nat]Absence check using 200 positive place invariants in 76 ms returned sat
[2025-06-02 06:17:40] [INFO ] [Nat]Absence check using state equation in 878 ms returned sat
[2025-06-02 06:17:40] [INFO ] State equation strengthened by 200 read => feed constraints.
[2025-06-02 06:17:40] [INFO ] [Nat]Added 200 Read/Feed constraints in 25 ms returned sat
[2025-06-02 06:17:40] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 247 ms.
[2025-06-02 06:17:42] [INFO ] Added : 105 causal constraints over 21 iterations in 2499 ms. Result :sat
Minimization took 874 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:17:43] [INFO ] [Real]Absence check using 200 positive place invariants in 40 ms returned sat
[2025-06-02 06:17:44] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2025-06-02 06:17:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:17:44] [INFO ] [Nat]Absence check using 200 positive place invariants in 39 ms returned sat
[2025-06-02 06:17:44] [INFO ] [Nat]Absence check using state equation in 497 ms returned sat
[2025-06-02 06:17:45] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 06:17:45] [INFO ] [Nat]Added 200 Read/Feed constraints in 663 ms returned sat
[2025-06-02 06:17:45] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 95 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:17:49] [INFO ] [Real]Absence check using 200 positive place invariants in 39 ms returned sat
[2025-06-02 06:17:49] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2025-06-02 06:17:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:17:50] [INFO ] [Nat]Absence check using 200 positive place invariants in 38 ms returned sat
[2025-06-02 06:17:51] [INFO ] [Nat]Absence check using state equation in 911 ms returned sat
[2025-06-02 06:17:51] [INFO ] [Nat]Added 200 Read/Feed constraints in 69 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:51] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:51] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:51] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:51] [INFO ] Deduced a trap composed of 3 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-02 06:17:51] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:51] [INFO ] Deduced a trap composed of 3 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-02 06:17:51] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:51] [INFO ] Deduced a trap composed of 3 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-02 06:17:52] [INFO ] Deduced a trap composed of 3 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-02 06:17:52] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:52] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 6 ms to minimize.
[2025-06-02 06:17:52] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1138 ms
[2025-06-02 06:17:52] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1139 ms
[2025-06-02 06:17:52] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 71 ms.
[2025-06-02 06:17:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:17:55] [INFO ] [Real]Absence check using 200 positive place invariants in 40 ms returned sat
[2025-06-02 06:17:55] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2025-06-02 06:17:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:17:55] [INFO ] [Nat]Absence check using 200 positive place invariants in 41 ms returned sat
[2025-06-02 06:17:56] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2025-06-02 06:17:56] [INFO ] [Nat]Added 200 Read/Feed constraints in 400 ms returned sat
[2025-06-02 06:17:56] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 94 ms.
[2025-06-02 06:18:00] [INFO ] Added : 220 causal constraints over 44 iterations in 3932 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:18:00] [INFO ] [Real]Absence check using 200 positive place invariants in 37 ms returned sat
[2025-06-02 06:18:01] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2025-06-02 06:18:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:18:01] [INFO ] [Nat]Absence check using 200 positive place invariants in 42 ms returned sat
[2025-06-02 06:18:01] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2025-06-02 06:18:02] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 06:18:02] [INFO ] [Nat]Added 200 Read/Feed constraints in 954 ms returned sat
[2025-06-02 06:18:03] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 98 ms.
4timeout
^^^^^^^^
(error "Invalid token: 4timeout")
Maximisation of solution failed !
Minimization took 1 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:18:06] [INFO ] [Real]Absence check using 200 positive place invariants in 42 ms returned sat
[2025-06-02 06:18:07] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2025-06-02 06:18:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:18:07] [INFO ] [Nat]Absence check using 200 positive place invariants in 39 ms returned sat
[2025-06-02 06:18:08] [INFO ] [Nat]Absence check using state equation in 1020 ms returned sat
[2025-06-02 06:18:08] [INFO ] [Nat]Added 200 Read/Feed constraints in 219 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:08] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:09] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:09] [INFO ] Deduced a trap composed of 4 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-02 06:18:09] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:09] [INFO ] Deduced a trap composed of 3 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-02 06:18:09] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
[2025-06-02 06:18:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 760 ms
[2025-06-02 06:18:09] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 96 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:18:12] [INFO ] [Real]Absence check using 200 positive place invariants in 40 ms returned sat
[2025-06-02 06:18:12] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2025-06-02 06:18:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:18:13] [INFO ] [Nat]Absence check using 200 positive place invariants in 43 ms returned sat
[2025-06-02 06:18:13] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2025-06-02 06:18:14] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 06:18:14] [INFO ] [Nat]Added 200 Read/Feed constraints in 949 ms returned sat
[2025-06-02 06:18:14] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 93 ms.
[2025-06-02 06:18:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:18:18] [INFO ] [Real]Absence check using 200 positive place invariants in 40 ms returned sat
[2025-06-02 06:18:18] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2025-06-02 06:18:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:18:18] [INFO ] [Nat]Absence check using 200 positive place invariants in 41 ms returned sat
[2025-06-02 06:18:19] [INFO ] [Nat]Absence check using state equation in 542 ms returned sat
[2025-06-02 06:18:19] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 06:18:19] [INFO ] [Nat]Added 200 Read/Feed constraints in 681 ms returned sat
[2025-06-02 06:18:20] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 92 ms.
[2025-06-02 06:18:23] [INFO ] Added : 220 causal constraints over 44 iterations in 3541 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:18:23] [INFO ] [Real]Absence check using 200 positive place invariants in 40 ms returned sat
[2025-06-02 06:18:24] [INFO ] [Real]Absence check using state equation in 440 ms returned sat
[2025-06-02 06:18:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:18:24] [INFO ] [Nat]Absence check using 200 positive place invariants in 39 ms returned sat
[2025-06-02 06:18:24] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2025-06-02 06:18:25] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 06:18:25] [INFO ] [Nat]Added 200 Read/Feed constraints in 913 ms returned sat
[2025-06-02 06:18:25] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 90 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:18:29] [INFO ] [Real]Absence check using 200 positive place invariants in 41 ms returned sat
[2025-06-02 06:18:29] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2025-06-02 06:18:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:18:30] [INFO ] [Nat]Absence check using 200 positive place invariants in 40 ms returned sat
[2025-06-02 06:18:30] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2025-06-02 06:18:31] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 06:18:31] [INFO ] [Nat]Added 200 Read/Feed constraints in 768 ms returned sat
[2025-06-02 06:18:31] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 88 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:18:35] [INFO ] [Real]Absence check using 200 positive place invariants in 39 ms returned sat
[2025-06-02 06:18:35] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2025-06-02 06:18:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:18:35] [INFO ] [Nat]Absence check using 200 positive place invariants in 40 ms returned sat
[2025-06-02 06:18:36] [INFO ] [Nat]Absence check using state equation in 550 ms returned sat
[2025-06-02 06:18:36] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 06:18:37] [INFO ] [Nat]Added 200 Read/Feed constraints in 810 ms returned sat
[2025-06-02 06:18:37] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 80 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:41] [INFO ] Deduced a trap composed of 3 places in 749 ms of which 181 ms to minimize.
[2025-06-02 06:18:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1131)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:18:41] [INFO ] [Real]Absence check using 200 positive place invariants in 41 ms returned sat
[2025-06-02 06:18:42] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2025-06-02 06:18:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:18:42] [INFO ] [Nat]Absence check using 200 positive place invariants in 40 ms returned sat
[2025-06-02 06:18:42] [INFO ] [Nat]Absence check using state equation in 462 ms returned sat
[2025-06-02 06:18:43] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 06:18:43] [INFO ] [Nat]Added 200 Read/Feed constraints in 658 ms returned sat
[2025-06-02 06:18:43] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 86 ms.
[2025-06-02 06:18:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:18:47] [INFO ] [Real]Absence check using 200 positive place invariants in 38 ms returned sat
[2025-06-02 06:18:47] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2025-06-02 06:18:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:18:47] [INFO ] [Nat]Absence check using 200 positive place invariants in 39 ms returned sat
[2025-06-02 06:18:48] [INFO ] [Nat]Absence check using state equation in 424 ms returned sat
[2025-06-02 06:18:48] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 06:18:49] [INFO ] [Nat]Added 200 Read/Feed constraints in 725 ms returned sat
[2025-06-02 06:18:49] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 79 ms.
[2025-06-02 06:18:52] [INFO ] Added : 235 causal constraints over 47 iterations in 3644 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:18:52] [INFO ] [Real]Absence check using 200 positive place invariants in 40 ms returned sat
[2025-06-02 06:18:53] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2025-06-02 06:18:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:18:53] [INFO ] [Nat]Absence check using 200 positive place invariants in 38 ms returned sat
[2025-06-02 06:18:54] [INFO ] [Nat]Absence check using state equation in 502 ms returned sat
[2025-06-02 06:18:54] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 06:18:54] [INFO ] [Nat]Added 200 Read/Feed constraints in 739 ms returned sat
[2025-06-02 06:18:54] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 81 ms.
[2025-06-02 06:18:58] [INFO ] Added : 225 causal constraints over 45 iterations in 3554 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:18:58] [INFO ] [Real]Absence check using 200 positive place invariants in 39 ms returned sat
[2025-06-02 06:18:59] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2025-06-02 06:18:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:18:59] [INFO ] [Nat]Absence check using 200 positive place invariants in 41 ms returned sat
[2025-06-02 06:19:00] [INFO ] [Nat]Absence check using state equation in 1188 ms returned sat
[2025-06-02 06:19:00] [INFO ] [Nat]Added 200 Read/Feed constraints in 329 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:19:00] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:19:01] [INFO ] Deduced a trap composed of 3 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-02 06:19:01] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:19:01] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:19:01] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:19:01] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:19:01] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:19:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:19:01] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:19:01] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2025-06-02 06:19:01] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 900 ms
[2025-06-02 06:19:01] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 89 ms.
[2025-06-02 06:19:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 14
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:19:04] [INFO ] [Real]Absence check using 200 positive place invariants in 37 ms returned sat
[2025-06-02 06:19:04] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2025-06-02 06:19:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:19:04] [INFO ] [Nat]Absence check using 200 positive place invariants in 42 ms returned sat
[2025-06-02 06:19:05] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2025-06-02 06:19:05] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 06:19:06] [INFO ] [Nat]Added 200 Read/Feed constraints in 842 ms returned sat
[2025-06-02 06:19:06] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 94 ms.
[2025-06-02 06:19:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 15
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10, 201, 2, 12, 200, 200, 10, 10, 2, 9, 10, 12, 200, 200, 9] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[199, 201, 201, 11, 100, 200, 200, 200, 201, 8, 9, 201, 100, 200, 200, 9] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Support contains 16 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Graph (complete) has 2400 edges and 1000 vertex of which 80 are kept as prefixes of interest. Removing 920 places using SCC suffix rule.3 ms
Discarding 920 places :
Also discarding 1472 output transitions
Drop transitions (Output transitions of discarded places.) removed 1472 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 128
Applied a total of 2 rules in 28 ms. Remains 80 /1000 variables (removed 920) and now considering 128/1601 (removed 1473) transitions.
Running 96 sub problems to find dead transitions.
// Phase 1: matrix 128 rows 80 cols
[2025-06-02 06:21:39] [INFO ] Computed 16 invariants in 2 ms
[2025-06-02 06:21:39] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 112 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3010 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 96/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 208 constraints, problems are : Problem set: 0 solved, 96 unsolved in 7056 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10121ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 10128ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10175 ms. Remains : 80/1000 places, 128/1601 transitions.
[2025-06-02 06:21:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[199, 201, 201, 11, 100, 200, 200, 200, 201, 8, 9, 201, 100, 200, 200, 9] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
RANDOM walk for 1000042 steps (2 resets) in 1368 ms. (730 steps per ms)
BEST_FIRST walk for 16000016 steps (32 resets) in 21900 ms. (730 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201, 201, 201, 196, 202, 200, 200, 201, 201, 196, 198, 201, 202, 200, 200, 200] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
[2025-06-02 06:22:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:13] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:22:13] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2025-06-02 06:22:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 06:22:13] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2025-06-02 06:22:13] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 06:22:13] [INFO ] [Nat]Added 16 Read/Feed constraints in 97 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:22:13] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2025-06-02 06:22:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2025-06-02 06:22:13] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:22:13] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2025-06-02 06:22:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2025-06-02 06:22:13] [INFO ] Added : 46 causal constraints over 11 iterations in 190 ms. Result :sat
Minimization took 27 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:13] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:22:13] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 06:22:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:22:14] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 06:22:14] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-02 06:22:14] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 06:22:14] [INFO ] Added : 66 causal constraints over 14 iterations in 136 ms. Result :sat
Minimization took 32 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:14] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-02 06:22:14] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2025-06-02 06:22:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:14] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:22:14] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2025-06-02 06:22:14] [INFO ] [Nat]Added 16 Read/Feed constraints in 114 ms returned sat
[2025-06-02 06:22:14] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 06:22:14] [INFO ] Added : 76 causal constraints over 17 iterations in 164 ms. Result :sat
Minimization took 33 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:14] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:22:14] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-06-02 06:22:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:14] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:22:14] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 06:22:14] [INFO ] [Nat]Added 16 Read/Feed constraints in 63 ms returned sat
[2025-06-02 06:22:14] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 06:22:14] [INFO ] Added : 61 causal constraints over 13 iterations in 111 ms. Result :sat
Minimization took 40 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:15] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 06:22:15] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-02 06:22:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:22:15] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-02 06:22:15] [INFO ] [Nat]Added 16 Read/Feed constraints in 152 ms returned sat
[2025-06-02 06:22:15] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 06:22:15] [INFO ] Added : 58 causal constraints over 12 iterations in 110 ms. Result :sat
Minimization took 25 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:15] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:22:15] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-02 06:22:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:22:15] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2025-06-02 06:22:15] [INFO ] [Nat]Added 16 Read/Feed constraints in 131 ms returned sat
[2025-06-02 06:22:15] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:22:15] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:22:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
[2025-06-02 06:22:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 94 ms
[2025-06-02 06:22:16] [INFO ] Added : 41 causal constraints over 9 iterations in 248 ms. Result :sat
Minimization took 28 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:16] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:22:16] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2025-06-02 06:22:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:16] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:22:16] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2025-06-02 06:22:16] [INFO ] [Nat]Added 16 Read/Feed constraints in 80 ms returned sat
[2025-06-02 06:22:16] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 06:22:16] [INFO ] Added : 47 causal constraints over 10 iterations in 85 ms. Result :sat
Minimization took 28 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:16] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:22:16] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-02 06:22:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:16] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:22:16] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-02 06:22:16] [INFO ] [Nat]Added 16 Read/Feed constraints in 78 ms returned sat
[2025-06-02 06:22:16] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:22:16] [INFO ] Deduced a trap composed of 3 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-02 06:22:16] [INFO ] Deduced a trap composed of 3 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-02 06:22:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:22:17] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2025-06-02 06:22:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 253 ms
[2025-06-02 06:22:17] [INFO ] Added : 72 causal constraints over 17 iterations in 404 ms. Result :sat
Minimization took 25 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:17] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:22:17] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-02 06:22:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:17] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:22:17] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-02 06:22:17] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-02 06:22:17] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 06:22:17] [INFO ] Added : 69 causal constraints over 15 iterations in 259 ms. Result :sat
Minimization took 33 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:17] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:22:17] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-02 06:22:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:17] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:22:17] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2025-06-02 06:22:17] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-02 06:22:17] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:22:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2025-06-02 06:22:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2025-06-02 06:22:17] [INFO ] Added : 68 causal constraints over 14 iterations in 167 ms. Result :sat
Minimization took 42 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:17] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-02 06:22:17] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-02 06:22:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:17] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:22:18] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-02 06:22:18] [INFO ] [Nat]Added 16 Read/Feed constraints in 134 ms returned sat
[2025-06-02 06:22:18] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 06:22:18] [INFO ] Added : 69 causal constraints over 14 iterations in 153 ms. Result :sat
Minimization took 48 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:18] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:22:18] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-06-02 06:22:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:18] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:22:18] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-02 06:22:18] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-02 06:22:18] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 06:22:18] [INFO ] Added : 65 causal constraints over 13 iterations in 114 ms. Result :sat
Minimization took 34 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:18] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:22:18] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-02 06:22:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:18] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:22:18] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-02 06:22:18] [INFO ] [Nat]Added 16 Read/Feed constraints in 151 ms returned sat
[2025-06-02 06:22:18] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 06:22:19] [INFO ] Added : 51 causal constraints over 11 iterations in 287 ms. Result :sat
Minimization took 31 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:19] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:22:19] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-02 06:22:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:19] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:22:19] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-06-02 06:22:19] [INFO ] [Nat]Added 16 Read/Feed constraints in 177 ms returned sat
[2025-06-02 06:22:19] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 06:22:19] [INFO ] Added : 59 causal constraints over 13 iterations in 179 ms. Result :sat
Minimization took 32 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:19] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:22:19] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-02 06:22:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:19] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:22:19] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-02 06:22:20] [INFO ] [Nat]Added 16 Read/Feed constraints in 217 ms returned sat
[2025-06-02 06:22:20] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 06:22:20] [INFO ] Added : 52 causal constraints over 11 iterations in 102 ms. Result :sat
Minimization took 40 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:20] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:22:20] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-02 06:22:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:22:20] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 06:22:20] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-02 06:22:20] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-02 06:22:20] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 06:22:20] [INFO ] Added : 53 causal constraints over 11 iterations in 136 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201, 201, 201, 196, 202, 200, 200, 201, 201, 196, 198, 201, 202, 200, 200, 200] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201, 201, 201, 202, 202, 200, 200, 201, 201, 202, 201, 201, 202, 200, 200, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Support contains 16 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 80/80 places, 128/128 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2025-06-02 06:22:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:22:37] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-02 06:22:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:22:37] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 06:22:37] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:22:37] [INFO ] Redundant transitions in 4 ms returned []
Running 96 sub problems to find dead transitions.
[2025-06-02 06:22:37] [INFO ] Invariant cache hit.
[2025-06-02 06:22:37] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 112 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2780 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 96/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:22:47] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/208 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:22:53] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:22:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/208 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 0/208 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 211 constraints, problems are : Problem set: 0 solved, 96 unsolved in 20354 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23151ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 23151ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23285 ms. Remains : 80/80 places, 128/128 transitions.
[2025-06-02 06:23:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[201, 201, 201, 202, 202, 200, 200, 201, 201, 202, 201, 201, 202, 200, 200, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
RANDOM walk for 1000013 steps (2 resets) in 1361 ms. (734 steps per ms)
BEST_FIRST walk for 16000016 steps (32 resets) in 21915 ms. (730 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201, 201, 201, 202, 202, 200, 200, 201, 201, 202, 201, 201, 202, 200, 200, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
[2025-06-02 06:23:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:24] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:23:24] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-06-02 06:23:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:24] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:23:24] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2025-06-02 06:23:24] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 06:23:24] [INFO ] [Nat]Added 16 Read/Feed constraints in 94 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:23:24] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2025-06-02 06:23:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2025-06-02 06:23:24] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:23:24] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
[2025-06-02 06:23:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2025-06-02 06:23:24] [INFO ] Added : 46 causal constraints over 11 iterations in 168 ms. Result :sat
Minimization took 29 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:24] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 06:23:25] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2025-06-02 06:23:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:25] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:23:25] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-02 06:23:25] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2025-06-02 06:23:25] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 06:23:25] [INFO ] Added : 66 causal constraints over 14 iterations in 141 ms. Result :sat
Minimization took 33 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:25] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:23:25] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-02 06:23:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:25] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:23:25] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2025-06-02 06:23:25] [INFO ] [Nat]Added 16 Read/Feed constraints in 114 ms returned sat
[2025-06-02 06:23:25] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 06:23:25] [INFO ] Added : 76 causal constraints over 17 iterations in 167 ms. Result :sat
Minimization took 35 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:25] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:23:25] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2025-06-02 06:23:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:25] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 06:23:25] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-02 06:23:25] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-02 06:23:25] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 06:23:26] [INFO ] Added : 74 causal constraints over 17 iterations in 136 ms. Result :sat
Minimization took 27 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:26] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:23:26] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-02 06:23:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:26] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 06:23:26] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-02 06:23:26] [INFO ] [Nat]Added 16 Read/Feed constraints in 155 ms returned sat
[2025-06-02 06:23:26] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-02 06:23:26] [INFO ] Added : 58 causal constraints over 12 iterations in 112 ms. Result :sat
Minimization took 27 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:26] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:23:26] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-06-02 06:23:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:26] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:23:26] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2025-06-02 06:23:26] [INFO ] [Nat]Added 16 Read/Feed constraints in 136 ms returned sat
[2025-06-02 06:23:26] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:23:27] [INFO ] Deduced a trap composed of 3 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-02 06:23:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
[2025-06-02 06:23:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
[2025-06-02 06:23:27] [INFO ] Added : 41 causal constraints over 9 iterations in 234 ms. Result :sat
Minimization took 27 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:27] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:23:27] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-02 06:23:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:27] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:23:27] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2025-06-02 06:23:27] [INFO ] [Nat]Added 16 Read/Feed constraints in 80 ms returned sat
[2025-06-02 06:23:27] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 06:23:27] [INFO ] Added : 47 causal constraints over 10 iterations in 85 ms. Result :sat
Minimization took 28 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:27] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:23:27] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-02 06:23:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:27] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:23:27] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-02 06:23:27] [INFO ] [Nat]Added 16 Read/Feed constraints in 84 ms returned sat
[2025-06-02 06:23:27] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:23:27] [INFO ] Deduced a trap composed of 3 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-02 06:23:27] [INFO ] Deduced a trap composed of 3 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-02 06:23:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:23:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2025-06-02 06:23:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 240 ms
[2025-06-02 06:23:28] [INFO ] Added : 72 causal constraints over 17 iterations in 387 ms. Result :sat
Minimization took 26 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:28] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:23:28] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-02 06:23:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:28] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:23:28] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 06:23:28] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2025-06-02 06:23:28] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 06:23:28] [INFO ] Added : 69 causal constraints over 15 iterations in 265 ms. Result :sat
Minimization took 35 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:28] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:23:28] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-02 06:23:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:28] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 06:23:28] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2025-06-02 06:23:28] [INFO ] [Nat]Added 16 Read/Feed constraints in 151 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:23:28] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
[2025-06-02 06:23:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:28] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:23:28] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-02 06:23:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:28] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:23:29] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2025-06-02 06:23:29] [INFO ] [Nat]Added 16 Read/Feed constraints in 153 ms returned sat
[2025-06-02 06:23:29] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 06:23:29] [INFO ] Added : 64 causal constraints over 13 iterations in 114 ms. Result :sat
Minimization took 34 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:29] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:23:29] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-02 06:23:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:29] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:23:29] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-02 06:23:29] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-02 06:23:29] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 06:23:29] [INFO ] Added : 65 causal constraints over 13 iterations in 109 ms. Result :sat
Minimization took 33 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:29] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:23:29] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 06:23:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:29] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:23:29] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-02 06:23:29] [INFO ] [Nat]Added 16 Read/Feed constraints in 156 ms returned sat
[2025-06-02 06:23:29] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 06:23:30] [INFO ] Added : 51 causal constraints over 11 iterations in 292 ms. Result :sat
Minimization took 32 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:30] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:23:30] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-02 06:23:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:30] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:23:30] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-02 06:23:30] [INFO ] [Nat]Added 16 Read/Feed constraints in 181 ms returned sat
[2025-06-02 06:23:30] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 06:23:30] [INFO ] Added : 59 causal constraints over 13 iterations in 179 ms. Result :sat
Minimization took 32 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:30] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:23:30] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-02 06:23:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:30] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:23:30] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-02 06:23:31] [INFO ] [Nat]Added 16 Read/Feed constraints in 205 ms returned sat
[2025-06-02 06:23:31] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 06:23:31] [INFO ] Added : 52 causal constraints over 11 iterations in 95 ms. Result :sat
Minimization took 30 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:31] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:23:31] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 06:23:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:23:31] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:23:31] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-06-02 06:23:31] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-02 06:23:31] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 06:23:31] [INFO ] Added : 71 causal constraints over 15 iterations in 289 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201, 201, 201, 202, 202, 200, 200, 201, 201, 202, 201, 201, 202, 200, 200, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 202, 203, 203, 203, 203, 203, 203]
FORMULA JoinFreeModules-PT-0200-UpperBounds-09 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201, 201, 201, 202, 202, 200, 200, 201, 201, 201, 201, 202, 200, 200, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Support contains 15 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 75 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 4 ms. Remains 75 /80 variables (removed 5) and now considering 120/128 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 75/80 places, 120/128 transitions.
// Phase 1: matrix 120 rows 75 cols
[2025-06-02 06:23:47] [INFO ] Computed 15 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[201, 201, 201, 202, 202, 200, 200, 201, 201, 201, 201, 202, 200, 200, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
RANDOM walk for 1000025 steps (2 resets) in 1221 ms. (818 steps per ms)
BEST_FIRST walk for 15000015 steps (30 resets) in 18785 ms. (798 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201, 201, 201, 202, 202, 200, 200, 201, 201, 201, 201, 202, 200, 200, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
[2025-06-02 06:24:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:07] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-02 06:24:07] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-02 06:24:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:07] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:08] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2025-06-02 06:24:08] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-02 06:24:08] [INFO ] [Nat]Added 15 Read/Feed constraints in 44 ms returned sat
[2025-06-02 06:24:08] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 06:24:08] [INFO ] Added : 42 causal constraints over 11 iterations in 115 ms. Result :sat
Minimization took 21 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:08] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:08] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-02 06:24:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:08] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2025-06-02 06:24:08] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-02 06:24:08] [INFO ] [Nat]Added 15 Read/Feed constraints in 126 ms returned sat
[2025-06-02 06:24:08] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 06:24:08] [INFO ] Added : 43 causal constraints over 10 iterations in 82 ms. Result :sat
Minimization took 31 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:08] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:08] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-02 06:24:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:08] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:08] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-02 06:24:08] [INFO ] [Nat]Added 15 Read/Feed constraints in 79 ms returned sat
[2025-06-02 06:24:08] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 06:24:08] [INFO ] Added : 49 causal constraints over 11 iterations in 92 ms. Result :sat
Minimization took 29 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:09] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-02 06:24:09] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-02 06:24:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:09] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:09] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 06:24:09] [INFO ] [Nat]Added 15 Read/Feed constraints in 85 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:24:09] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2025-06-02 06:24:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:09] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2025-06-02 06:24:09] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-02 06:24:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:09] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-02 06:24:09] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2025-06-02 06:24:09] [INFO ] [Nat]Added 15 Read/Feed constraints in 124 ms returned sat
[2025-06-02 06:24:09] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:24:09] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
[2025-06-02 06:24:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2025-06-02 06:24:09] [INFO ] Added : 36 causal constraints over 9 iterations in 218 ms. Result :sat
Minimization took 19 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:09] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:09] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-02 06:24:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:09] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:10] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2025-06-02 06:24:10] [INFO ] [Nat]Added 15 Read/Feed constraints in 150 ms returned sat
[2025-06-02 06:24:10] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 06:24:10] [INFO ] Added : 35 causal constraints over 10 iterations in 102 ms. Result :sat
Minimization took 24 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:10] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:10] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 06:24:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:10] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:10] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 06:24:10] [INFO ] [Nat]Added 15 Read/Feed constraints in 187 ms returned sat
[2025-06-02 06:24:10] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 06:24:10] [INFO ] Added : 47 causal constraints over 11 iterations in 248 ms. Result :sat
Minimization took 27 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:11] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:11] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-02 06:24:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:11] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-02 06:24:11] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 06:24:11] [INFO ] [Nat]Added 15 Read/Feed constraints in 65 ms returned sat
[2025-06-02 06:24:11] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 9 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:24:11] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
[2025-06-02 06:24:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2025-06-02 06:24:11] [INFO ] Added : 49 causal constraints over 10 iterations in 164 ms. Result :sat
Minimization took 29 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:11] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:11] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-02 06:24:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:11] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-02 06:24:11] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 06:24:11] [INFO ] [Nat]Added 15 Read/Feed constraints in 108 ms returned sat
[2025-06-02 06:24:11] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 06:24:11] [INFO ] Added : 63 causal constraints over 15 iterations in 189 ms. Result :sat
Minimization took 31 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:11] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-02 06:24:11] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 06:24:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:11] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:11] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-02 06:24:12] [INFO ] [Nat]Added 15 Read/Feed constraints in 126 ms returned sat
[2025-06-02 06:24:12] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 06:24:12] [INFO ] Added : 57 causal constraints over 13 iterations in 127 ms. Result :sat
Minimization took 30 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:12] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:12] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-02 06:24:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:12] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:12] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-02 06:24:12] [INFO ] [Nat]Added 15 Read/Feed constraints in 66 ms returned sat
[2025-06-02 06:24:12] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 9 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:24:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
[2025-06-02 06:24:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2025-06-02 06:24:12] [INFO ] Added : 53 causal constraints over 12 iterations in 156 ms. Result :sat
Minimization took 29 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:12] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:12] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-02 06:24:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:12] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:12] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 06:24:13] [INFO ] [Nat]Added 15 Read/Feed constraints in 265 ms returned sat
[2025-06-02 06:24:13] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 9 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:24:13] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2025-06-02 06:24:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2025-06-02 06:24:13] [INFO ] Added : 61 causal constraints over 15 iterations in 276 ms. Result :sat
Minimization took 24 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:13] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:13] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-02 06:24:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:13] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:13] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2025-06-02 06:24:13] [INFO ] [Nat]Added 15 Read/Feed constraints in 207 ms returned sat
[2025-06-02 06:24:13] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 06:24:13] [INFO ] Added : 45 causal constraints over 10 iterations in 108 ms. Result :sat
Minimization took 27 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:13] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:13] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-02 06:24:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:13] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-02 06:24:13] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-02 06:24:14] [INFO ] [Nat]Added 15 Read/Feed constraints in 152 ms returned sat
[2025-06-02 06:24:14] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 06:24:14] [INFO ] Added : 56 causal constraints over 13 iterations in 103 ms. Result :sat
Minimization took 28 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:14] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:14] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 06:24:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:14] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:14] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2025-06-02 06:24:14] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2025-06-02 06:24:14] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 06:24:14] [INFO ] Added : 48 causal constraints over 12 iterations in 92 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201, 201, 201, 202, 202, 200, 200, 201, 201, 201, 201, 202, 200, 200, 201] Max Struct:[203, 203, 203, 202, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
FORMULA JoinFreeModules-PT-0200-UpperBounds-03 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201, 201, 201, 202, 200, 200, 201, 201, 201, 201, 202, 200, 200, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Support contains 14 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 120/120 transitions.
Graph (complete) has 180 edges and 75 vertex of which 70 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 3 ms. Remains 70 /75 variables (removed 5) and now considering 112/120 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 70/75 places, 112/120 transitions.
// Phase 1: matrix 112 rows 70 cols
[2025-06-02 06:24:27] [INFO ] Computed 14 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[201, 201, 201, 202, 200, 200, 201, 201, 201, 201, 202, 200, 200, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
RANDOM walk for 1000026 steps (2 resets) in 1128 ms. (885 steps per ms)
FORMULA JoinFreeModules-PT-0200-UpperBounds-04 203 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 13000013 steps (26 resets) in 15211 ms. (854 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201, 201, 201, 200, 200, 201, 201, 201, 201, 202, 200, 200, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
[2025-06-02 06:24:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:44] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-02 06:24:44] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 06:24:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:44] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:44] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-02 06:24:44] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-02 06:24:44] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2025-06-02 06:24:44] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 4 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:24:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
[2025-06-02 06:24:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2025-06-02 06:24:44] [INFO ] Added : 46 causal constraints over 10 iterations in 163 ms. Result :sat
Minimization took 27 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:44] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-02 06:24:44] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 06:24:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:44] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-02 06:24:44] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-02 06:24:44] [INFO ] [Nat]Added 14 Read/Feed constraints in 89 ms returned sat
[2025-06-02 06:24:44] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 06:24:44] [INFO ] Added : 35 causal constraints over 7 iterations in 151 ms. Result :sat
Minimization took 25 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:44] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:44] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 06:24:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:44] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-02 06:24:44] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2025-06-02 06:24:44] [INFO ] [Nat]Added 14 Read/Feed constraints in 47 ms returned sat
[2025-06-02 06:24:44] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 06:24:45] [INFO ] Added : 33 causal constraints over 8 iterations in 161 ms. Result :sat
Minimization took 25 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:45] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:45] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-06-02 06:24:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:45] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-02 06:24:45] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2025-06-02 06:24:45] [INFO ] [Nat]Added 14 Read/Feed constraints in 216 ms returned sat
[2025-06-02 06:24:45] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 9 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:24:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2025-06-02 06:24:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2025-06-02 06:24:45] [INFO ] Added : 59 causal constraints over 12 iterations in 162 ms. Result :sat
Minimization took 28 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:45] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:45] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 06:24:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:45] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:45] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-02 06:24:45] [INFO ] [Nat]Added 14 Read/Feed constraints in 110 ms returned sat
[2025-06-02 06:24:45] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-02 06:24:46] [INFO ] Added : 35 causal constraints over 8 iterations in 203 ms. Result :sat
Minimization took 23 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:46] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-02 06:24:46] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-02 06:24:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:46] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:46] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-02 06:24:46] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2025-06-02 06:24:46] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:24:46] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:24:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2025-06-02 06:24:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 77 ms
[2025-06-02 06:24:46] [INFO ] Added : 24 causal constraints over 6 iterations in 261 ms. Result :sat
Minimization took 18 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:46] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:46] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 06:24:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:46] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:46] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-02 06:24:46] [INFO ] [Nat]Added 14 Read/Feed constraints in 47 ms returned sat
[2025-06-02 06:24:46] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 06:24:46] [INFO ] Added : 36 causal constraints over 8 iterations in 101 ms. Result :sat
Minimization took 25 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:46] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:46] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 06:24:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:46] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:47] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-02 06:24:47] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2025-06-02 06:24:47] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 06:24:47] [INFO ] Added : 52 causal constraints over 12 iterations in 92 ms. Result :sat
Minimization took 35 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:47] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:47] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 06:24:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:47] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:47] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-02 06:24:47] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2025-06-02 06:24:47] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 06:24:47] [INFO ] Added : 37 causal constraints over 9 iterations in 140 ms. Result :sat
Minimization took 24 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:47] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:47] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 06:24:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:47] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:47] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-02 06:24:47] [INFO ] [Nat]Added 14 Read/Feed constraints in 70 ms returned sat
[2025-06-02 06:24:47] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-02 06:24:47] [INFO ] Added : 48 causal constraints over 10 iterations in 81 ms. Result :sat
Minimization took 20 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:47] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-02 06:24:47] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 06:24:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:47] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:47] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-02 06:24:47] [INFO ] [Nat]Added 14 Read/Feed constraints in 110 ms returned sat
[2025-06-02 06:24:48] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 9 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:24:48] [INFO ] Deduced a trap composed of 3 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-02 06:24:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
[2025-06-02 06:24:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 86 ms
[2025-06-02 06:24:48] [INFO ] Added : 36 causal constraints over 9 iterations in 169 ms. Result :sat
Minimization took 26 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:48] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:48] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 06:24:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:48] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2025-06-02 06:24:48] [INFO ] [Nat]Added 14 Read/Feed constraints in 152 ms returned sat
[2025-06-02 06:24:48] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:24:48] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
[2025-06-02 06:24:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2025-06-02 06:24:48] [INFO ] Added : 34 causal constraints over 7 iterations in 106 ms. Result :sat
Minimization took 24 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:48] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-02 06:24:48] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 06:24:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:24:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 06:24:48] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-02 06:24:48] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2025-06-02 06:24:48] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 06:24:48] [INFO ] Added : 35 causal constraints over 7 iterations in 53 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201, 201, 201, 200, 200, 201, 201, 201, 201, 202, 200, 200, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201, 201, 201, 200, 200, 201, 201, 201, 201, 202, 200, 200, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Support contains 13 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Graph (complete) has 168 edges and 70 vertex of which 65 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 3 ms. Remains 65 /70 variables (removed 5) and now considering 104/112 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 65/70 places, 104/112 transitions.
// Phase 1: matrix 104 rows 65 cols
[2025-06-02 06:24:59] [INFO ] Computed 13 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[201, 201, 201, 200, 200, 201, 201, 201, 201, 202, 200, 200, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
RANDOM walk for 1000010 steps (2 resets) in 1076 ms. (928 steps per ms)
BEST_FIRST walk for 13000013 steps (26 resets) in 14566 ms. (892 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201, 201, 201, 200, 200, 201, 201, 201, 201, 202, 200, 200, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
[2025-06-02 06:25:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:25:15] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 06:25:15] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 06:25:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:25:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 06:25:15] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-02 06:25:15] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-02 06:25:15] [INFO ] [Nat]Added 13 Read/Feed constraints in 1 ms returned sat
[2025-06-02 06:25:15] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:25:15] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:25:15] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:25:15] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
[2025-06-02 06:25:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 125 ms
[2025-06-02 06:25:15] [INFO ] Added : 67 causal constraints over 15 iterations in 237 ms. Result :sat
Minimization took 31 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:25:15] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 06:25:15] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-02 06:25:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:25:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 06:25:15] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-02 06:25:15] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2025-06-02 06:25:15] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 4 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:25:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
[2025-06-02 06:25:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2025-06-02 06:25:15] [INFO ] Added : 69 causal constraints over 15 iterations in 153 ms. Result :sat
Minimization took 31 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:25:15] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 06:25:15] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-02 06:25:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:25:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 06:25:16] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-02 06:25:16] [INFO ] [Nat]Added 13 Read/Feed constraints in 101 ms returned sat
[2025-06-02 06:25:16] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 06:25:16] [INFO ] Added : 64 causal constraints over 13 iterations in 97 ms. Result :sat
Minimization took 31 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:25:16] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 06:25:16] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 06:25:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:25:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 06:25:16] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-02 06:25:16] [INFO ] [Nat]Added 13 Read/Feed constraints in 112 ms returned sat
[2025-06-02 06:25:16] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:25:16] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:25:16] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
[2025-06-02 06:25:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 75 ms
[2025-06-02 06:25:16] [INFO ] Added : 58 causal constraints over 13 iterations in 261 ms. Result :sat
Minimization took 28 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:25:16] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 06:25:16] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 06:25:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:25:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 06:25:16] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-02 06:25:17] [INFO ] [Nat]Added 13 Read/Feed constraints in 112 ms returned sat
[2025-06-02 06:25:17] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:25:17] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
[2025-06-02 06:25:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2025-06-02 06:25:17] [INFO ] Added : 64 causal constraints over 15 iterations in 187 ms. Result :sat
Minimization took 30 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:25:17] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 06:25:17] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 06:25:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:25:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 06:25:17] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2025-06-02 06:25:17] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2025-06-02 06:25:17] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 06:25:17] [INFO ] Added : 49 causal constraints over 12 iterations in 186 ms. Result :sat
Minimization took 28 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:25:17] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 06:25:17] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 06:25:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:25:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 06:25:17] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-02 06:25:17] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2025-06-02 06:25:17] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:25:17] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:25:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2025-06-02 06:25:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 82 ms
[2025-06-02 06:25:17] [INFO ] Added : 69 causal constraints over 15 iterations in 196 ms. Result :sat
Minimization took 25 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:25:18] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2025-06-02 06:25:18] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-02 06:25:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:25:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 06:25:18] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-02 06:25:18] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2025-06-02 06:25:18] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 06:25:18] [INFO ] Added : 69 causal constraints over 14 iterations in 100 ms. Result :sat
Minimization took 30 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:25:18] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 06:25:18] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-02 06:25:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:25:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 06:25:18] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-02 06:25:18] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2025-06-02 06:25:18] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:25:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
[2025-06-02 06:25:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2025-06-02 06:25:18] [INFO ] Added : 66 causal constraints over 14 iterations in 155 ms. Result :sat
Minimization took 27 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:25:18] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 06:25:18] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-02 06:25:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:25:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 06:25:18] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-02 06:25:18] [INFO ] [Nat]Added 13 Read/Feed constraints in 154 ms returned sat
[2025-06-02 06:25:18] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 06:25:18] [INFO ] Added : 54 causal constraints over 11 iterations in 83 ms. Result :sat
Minimization took 20 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:25:18] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 06:25:18] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-02 06:25:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:25:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 06:25:19] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-02 06:25:19] [INFO ] [Nat]Added 13 Read/Feed constraints in 119 ms returned sat
[2025-06-02 06:25:19] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 06:25:19] [INFO ] Added : 58 causal constraints over 12 iterations in 113 ms. Result :sat
Minimization took 28 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:25:19] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 06:25:19] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2025-06-02 06:25:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:25:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 06:25:19] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-02 06:25:19] [INFO ] [Nat]Added 13 Read/Feed constraints in 113 ms returned sat
[2025-06-02 06:25:19] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 06:25:19] [INFO ] Added : 62 causal constraints over 13 iterations in 95 ms. Result :sat
Minimization took 28 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:25:19] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 06:25:19] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 06:25:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:25:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 06:25:19] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2025-06-02 06:25:19] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2025-06-02 06:25:19] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 06:25:20] [INFO ] Added : 56 causal constraints over 12 iterations in 206 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201, 201, 201, 200, 200, 201, 201, 201, 201, 202, 200, 200, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201, 201, 201, 200, 200, 201, 201, 201, 201, 202, 200, 200, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Support contains 13 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 65/65 places, 104/104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2025-06-02 06:25:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:25:30] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-02 06:25:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:25:30] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-02 06:25:30] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:25:30] [INFO ] Redundant transitions in 2 ms returned []
Running 78 sub problems to find dead transitions.
[2025-06-02 06:25:30] [INFO ] Invariant cache hit.
[2025-06-02 06:25:30] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 13/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 104/169 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 13/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/169 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 91 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1972 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 65/65 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 13/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 104/169 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 13/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 78/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:25:33] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/169 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 170 constraints, problems are : Problem set: 0 solved, 78 unsolved in 6569 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 65/65 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8554ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 8555ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8646 ms. Remains : 65/65 places, 104/104 transitions.
RANDOM walk for 40113 steps (8 resets) in 135 ms. (294 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
[2025-06-02 06:25:39] [INFO ] Flatten gal took : 39 ms
[2025-06-02 06:25:39] [INFO ] Flatten gal took : 13 ms
[2025-06-02 06:25:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11069334954858073450.gal : 6 ms
[2025-06-02 06:25:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6077353246191531828.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11069334954858073450.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6077353246191531828.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality6077353246191531828.prop.
SDD proceeding with computation,26 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,26 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,26 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,26 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,26 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,26 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,26 properties remain. new max is 256
SDD size :3104 after 10755
Interrupted probabilistic random walk after 266599 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 26
Probabilistic random walk after 266599 steps, saw 243995 distinct states, run finished after 3006 ms. (steps per millisecond=88 ) properties seen :0
[2025-06-02 06:25:42] [INFO ] Invariant cache hit.
[2025-06-02 06:25:42] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 52/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:25:42] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:25:42] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:25:42] [INFO ] Deduced a trap composed of 3 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-02 06:25:42] [INFO ] Deduced a trap composed of 3 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-02 06:25:42] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 3 ms to minimize.
Problem MAX0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:25:43] [INFO ] Deduced a trap composed of 3 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-02 06:25:43] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:25:43] [INFO ] Deduced a trap composed of 3 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-02 06:25:43] [INFO ] Deduced a trap composed of 3 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-02 06:25:43] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:25:43] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:25:43] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
Problem MAX7 is UNSAT
Problem MAX8 is UNSAT
Problem MAX10 is UNSAT
Problem MAX11 is UNSAT
Problem MAX12 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 12/25 constraints. Problems are: Problem set: 12 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/25 constraints. Problems are: Problem set: 12 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 104/169 variables, 65/90 constraints. Problems are: Problem set: 12 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 13/103 constraints. Problems are: Problem set: 12 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/103 constraints. Problems are: Problem set: 12 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/103 constraints. Problems are: Problem set: 12 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 103 constraints, problems are : Problem set: 12 solved, 14 unsolved in 1165 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 65/65 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 14 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 52/65 variables, 13/13 constraints. Problems are: Problem set: 12 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 12/25 constraints. Problems are: Problem set: 12 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/25 constraints. Problems are: Problem set: 12 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 104/169 variables, 65/90 constraints. Problems are: Problem set: 12 solved, 14 unsolved
SDD proceeding with computation,26 properties remain. new max is 512
SDD size :10755 after 19900
SDD proceeding with computation,26 properties remain. new max is 1024
SDD size :19900 after 4.87563e+06
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 13/103 constraints. Problems are: Problem set: 12 solved, 14 unsolved
SDD proceeding with computation,26 properties remain. new max is 2048
SDD size :4.87563e+06 after 1.45683e+07
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 14/117 constraints. Problems are: Problem set: 12 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 169/169 variables, and 117 constraints, problems are : Problem set: 12 solved, 14 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 65/65 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 14/26 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6199ms problems are : Problem set: 12 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Applied a total of 0 rules in 8 ms. Remains 65 /65 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Running 78 sub problems to find dead transitions.
[2025-06-02 06:25:48] [INFO ] Invariant cache hit.
[2025-06-02 06:25:48] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 13/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 104/169 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 13/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/169 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 91 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1948 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 65/65 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 13/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 104/169 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 13/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 78/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:25:51] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Invariant property MIN7 does not hold.
SDD proceeding with computation,25 properties remain. new max is 2048
SDD size :1.45683e+07 after 3.62124e+14
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 78 unsolved
SDD proceeding with computation,25 properties remain. new max is 4096
SDD size :3.62124e+14 after 1.43107e+15
At refinement iteration 8 (OVERLAPS) 0/169 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 170 constraints, problems are : Problem set: 0 solved, 78 unsolved in 6419 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 65/65 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8374ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 8375ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8389 ms. Remains : 65/65 places, 104/104 transitions.
RANDOM walk for 40120 steps (8 resets) in 89 ms. (445 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 117 ms. (339 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 175919 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 13
Probabilistic random walk after 175919 steps, saw 162384 distinct states, run finished after 3003 ms. (steps per millisecond=58 ) properties seen :0
[2025-06-02 06:26:00] [INFO ] Invariant cache hit.
[2025-06-02 06:26:00] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 48/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 96/156 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 12/84 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/156 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/169 variables, and 84 constraints, problems are : Problem set: 0 solved, 13 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, State Equation: 60/65 constraints, ReadFeed: 12/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 48/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:26:00] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:26:00] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:26:00] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:26:00] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 96/156 variables, 60/76 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 12/88 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 13/101 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:26:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:26:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
SDD proceeding with computation,25 properties remain. new max is 8192
SDD size :1.43107e+15 after 1.99722e+30
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:26:14] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:26:15] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/156 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/169 variables, and 105 constraints, problems are : Problem set: 0 solved, 13 unsolved in 14848 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, State Equation: 60/65 constraints, ReadFeed: 12/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15058ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 3 properties in 4102 ms.
Support contains 10 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 50 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Applied a total of 1 rules in 3 ms. Remains 50 /65 variables (removed 15) and now considering 80/104 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 50/65 places, 80/104 transitions.
RANDOM walk for 40051 steps (8 resets) in 49 ms. (801 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 206542 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 10
Probabilistic random walk after 206542 steps, saw 184937 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
// Phase 1: matrix 80 rows 50 cols
[2025-06-02 06:26:22] [INFO ] Computed 10 invariants in 0 ms
[2025-06-02 06:26:22] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 40/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 80/130 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/130 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 70 constraints, problems are : Problem set: 0 solved, 10 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 50/50 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 40/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:26:23] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:26:23] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 80/130 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:26:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:26:25] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/130 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 84 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3712 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 50/50 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3862ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Detected timeout of ITS tools.
[2025-06-02 06:26:29] [INFO ] Flatten gal took : 9 ms
[2025-06-02 06:26:29] [INFO ] Applying decomposition
[2025-06-02 06:26:29] [INFO ] Flatten gal took : 7 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/graph4254013389479038960.txt' '-o' '/tmp/graph4254013389479038960.bin' '-w' '/tmp/graph4254013389479038960.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4254013389479038960.bin' '-l' '-1' '-v' '-w' '/tmp/graph4254013389479038960.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:26:29] [INFO ] Decomposing Gal with order
[2025-06-02 06:26:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 06:26:29] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:26:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 06:26:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9321058532147117895.gal : 2 ms
[2025-06-02 06:26:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14019849595284853642.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9321058532147117895.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14019849595284853642.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality14019849595284853642.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :851 after 3104
Parikh walk visited 0 properties in 3373 ms.
Support contains 10 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 50/50 places, 80/80 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2025-06-02 06:26:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:26:30] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-02 06:26:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:26:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-02 06:26:30] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:26:30] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2025-06-02 06:26:30] [INFO ] Invariant cache hit.
[2025-06-02 06:26:30] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 10/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 80/130 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :3104 after 10755
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/130 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 70 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1277 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 50/50 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 10/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 80/130 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 60/130 constraints. Problems are: Problem set: 0 solved, 60 unsolved
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :10755 after 19900
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :19900 after 4.87563e+06
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :4.87563e+06 after 1.45683e+07
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :1.45683e+07 after 3.62125e+14
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.10258e+102,8.08732,118748,15,1419,196,339652,64,0,65,399420,0
Total reachable state count : 2.10257557806848344300596919806658484489e+102

Verifying 10 reachability properties.
Invariant property MIN0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,8.09145,118748,1,0,196,339652,66,0,67,399420,0
Invariant property MIN1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,0,8.09167,118748,1,0,196,339652,67,0,67,399420,0
Invariant property MIN2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,0,8.09176,118748,1,0,196,339652,68,0,67,399420,0
Invariant property MIN3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,0,8.09936,118748,1,0,196,339652,70,0,68,399420,0
Invariant property MIN4 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN4,0,8.09952,118748,1,0,196,339652,71,0,68,399420,0
Invariant property MIN5 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN5,0,8.09964,118748,1,0,196,339652,72,0,68,399420,0
Invariant property MIN6 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN6,0,8.09976,118748,1,0,196,339652,73,0,68,399420,0
Invariant property MIN8 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN8,0,8.09988,118748,1,0,196,339652,74,0,68,399420,0
Invariant property MIN10 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN10,0,8.09999,118748,1,0,196,339652,75,0,68,399420,0
Invariant property MIN11 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN11,0,8.10009,118748,1,0,196,339652,76,0,68,399420,0
ITS tools runner thread asked to quit. Dying gracefully.
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 130 constraints, problems are : Problem set: 0 solved, 60 unsolved in 11951 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 50/50 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13234ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 13235ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13320 ms. Remains : 50/50 places, 80/80 transitions.
FORMULA JoinFreeModules-PT-0200-UpperBounds-14 200 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-13 200 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-12 203 TECHNIQUES REACHABILITY_MAX
FORMULA JoinFreeModules-PT-0200-UpperBounds-11 201 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-08 201 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-07 201 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-06 200 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-05 200 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-02 201 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-01 201 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-00 201 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 11 queries.) : Max Seen:[201, 201] Max Struct:[203, 203]
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[203]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[203]
// Phase 1: matrix 104 rows 65 cols
[2025-06-02 06:26:43] [INFO ] Computed 13 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[203]
RANDOM walk for 10009 steps (2 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[152] Max Struct:[203]
[2025-06-02 06:26:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:26:43] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2025-06-02 06:26:43] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 06:26:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:26:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 06:26:43] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2025-06-02 06:26:43] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-02 06:26:43] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2025-06-02 06:26:43] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:26:43] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2025-06-02 06:26:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2025-06-02 06:26:43] [INFO ] Added : 47 causal constraints over 12 iterations in 132 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[152] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[203]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions (Output transitions of discarded places.) removed 96 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-02 06:26:44] [INFO ] Computed 1 invariants in 1 ms
[2025-06-02 06:26:44] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 135ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 135ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 5/65 places, 8/104 transitions.
[2025-06-02 06:26:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[201] Max Struct:[203]
RANDOM walk for 1000066 steps (2 resets) in 192 ms. (5181 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 449 ms. (2222 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201] Max Struct:[203]
[2025-06-02 06:26:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:26:45] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 06:26:45] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-02 06:26:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:26:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 06:26:45] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 06:26:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 06:26:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 06:26:45] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 06:26:45] [INFO ] Added : 5 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[203]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 06:26:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:26:45] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-02 06:26:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:26:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 06:26:45] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:26:45] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 06:26:45] [INFO ] Invariant cache hit.
[2025-06-02 06:26:45] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 138ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 138ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40075 steps (8 resets) in 18 ms. (2109 steps per ms) remains 2/2 properties
[2025-06-02 06:26:45] [INFO ] Flatten gal took : 4 ms
[2025-06-02 06:26:45] [INFO ] Flatten gal took : 1 ms
[2025-06-02 06:26:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6448493763083002034.gal : 5 ms
[2025-06-02 06:26:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8514996428040491928.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6448493763083002034.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8514996428040491928.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8514996428040491928.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40002 steps (8 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 10755
Interrupted probabilistic random walk after 1432503 steps, run timeout after 3001 ms. (steps per millisecond=477 ) properties seen :0 out of 2
Probabilistic random walk after 1432503 steps, saw 466930 distinct states, run finished after 3001 ms. (steps per millisecond=477 ) properties seen :0
[2025-06-02 06:26:48] [INFO ] Invariant cache hit.
[2025-06-02 06:26:48] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:26:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 122 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-02 06:26:49] [INFO ] Invariant cache hit.
[2025-06-02 06:26:49] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 142ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 143ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40058 steps (8 resets) in 16 ms. (2356 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :10755 after 19900
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4.85781e+06 after 4.87563e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.06236e+07 after 1.06334e+07
Interrupted probabilistic random walk after 3517268 steps, run timeout after 3001 ms. (steps per millisecond=1172 ) properties seen :0 out of 1
Probabilistic random walk after 3517268 steps, saw 1209654 distinct states, run finished after 3001 ms. (steps per millisecond=1172 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[201] Max Struct:[203]
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-10 in 8804 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[203]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[203]
// Phase 1: matrix 104 rows 65 cols
[2025-06-02 06:26:52] [INFO ] Computed 13 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[203]
RANDOM walk for 10048 steps (2 resets) in 11 ms. (837 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[107] Max Struct:[203]
[2025-06-02 06:26:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:26:52] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 06:26:52] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 06:26:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:26:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 06:26:52] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2025-06-02 06:26:52] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-02 06:26:52] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2025-06-02 06:26:52] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:26:52] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2025-06-02 06:26:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2025-06-02 06:26:52] [INFO ] Added : 44 causal constraints over 10 iterations in 226 ms. Result :sat
Minimization took 80 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[107] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[203]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions (Output transitions of discarded places.) removed 96 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-02 06:26:53] [INFO ] Computed 1 invariants in 1 ms
[2025-06-02 06:26:53] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 137ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 138ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 5/65 places, 8/104 transitions.
[2025-06-02 06:26:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[201] Max Struct:[203]
RANDOM walk for 1000073 steps (2 resets) in 191 ms. (5208 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 443 ms. (2252 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201] Max Struct:[203]
[2025-06-02 06:26:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:26:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 06:26:54] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 06:26:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:26:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 06:26:54] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-02 06:26:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 06:26:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-02 06:26:54] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-02 06:26:54] [INFO ] Added : 5 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[203]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 06:26:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:26:54] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-02 06:26:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:26:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 06:26:54] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:26:54] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 06:26:54] [INFO ] Invariant cache hit.
[2025-06-02 06:26:54] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 121ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 121ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-02 06:26:54] [INFO ] Flatten gal took : 1 ms
[2025-06-02 06:26:54] [INFO ] Flatten gal took : 1 ms
[2025-06-02 06:26:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15254897654422968247.gal : 3 ms
[2025-06-02 06:26:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14675251209223606168.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15254897654422968247.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14675251209223606168.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14675251209223606168.prop.
RANDOM walk for 40097 steps (8 resets) in 22 ms. (1743 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40002 steps (8 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 10755
Interrupted probabilistic random walk after 1079292 steps, run timeout after 3001 ms. (steps per millisecond=359 ) properties seen :0 out of 2
Probabilistic random walk after 1079292 steps, saw 413672 distinct states, run finished after 3001 ms. (steps per millisecond=359 ) properties seen :0
[2025-06-02 06:26:57] [INFO ] Invariant cache hit.
[2025-06-02 06:26:57] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:26:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 97ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 120 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-02 06:26:57] [INFO ] Invariant cache hit.
[2025-06-02 06:26:57] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 131ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 131ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40147 steps (8 resets) in 19 ms. (2007 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :10755 after 19900
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4.85781e+06 after 4.87563e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.06236e+07 after 1.06334e+07
Interrupted probabilistic random walk after 3357390 steps, run timeout after 3001 ms. (steps per millisecond=1118 ) properties seen :0 out of 1
Probabilistic random walk after 3357390 steps, saw 1153886 distinct states, run finished after 3001 ms. (steps per millisecond=1118 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[201] Max Struct:[203]
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-15 in 8841 ms.
[2025-06-02 06:27:01] [INFO ] Flatten gal took : 9 ms
[2025-06-02 06:27:01] [INFO ] Applying decomposition
[2025-06-02 06:27:01] [INFO ] Flatten gal took : 4 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/graph11581935413133052148.txt' '-o' '/tmp/graph11581935413133052148.bin' '-w' '/tmp/graph11581935413133052148.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11581935413133052148.bin' '-l' '-1' '-v' '-w' '/tmp/graph11581935413133052148.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:27:01] [INFO ] Decomposing Gal with order
[2025-06-02 06:27:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 06:27:01] [INFO ] Flatten gal took : 5 ms
[2025-06-02 06:27:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 06:27:01] [INFO ] Time to serialize gal into /tmp/UpperBounds11246011956126727891.gal : 2 ms
[2025-06-02 06:27:01] [INFO ] Time to serialize properties into /tmp/UpperBounds15277827362721330019.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11246011956126727891.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15277827362721330019.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds15277827362721330019.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.10258e+102,7.74883,118416,15,1419,43,339629,52,0,62,399420,0
Total reachable state count : 2.10257557806848344300596919806658484489e+102

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 202
Bounds property JoinFreeModules-PT-0200-UpperBounds-10 :0 <= u1.p84 <= 202
FORMULA JoinFreeModules-PT-0200-UpperBounds-10 202 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-10,0,7.76467,118416,1,0,82,339629,130,14,277,399420,158
Min sum of variable value : 0
Maximum sum along a path : 202
Bounds property JoinFreeModules-PT-0200-UpperBounds-15 :0 <= u7.p654 <= 202
FORMULA JoinFreeModules-PT-0200-UpperBounds-15 202 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-15,0,7.76492,118416,1,0,90,339629,159,14,277,399420,184
Total runtime 575041 ms.

BK_STOP 1748845629008

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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="JoinFreeModules-PT-0200"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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