fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r142-tall-174876813000617
Last Updated
June 24, 2025

About the Execution of ITS-Tools for Peterson-PT-5

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 3600000.00 0.00 0.00 FTT??F?T??T????? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876813000617.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 Peterson-PT-5, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876813000617
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 96K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 406K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 380K 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 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 83K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 257K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 48K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 168K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 196K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 784K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 206K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 945K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 535K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748944143894

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-5
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-03 09:49:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 09:49:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 09:49:05] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2025-06-03 09:49:05] [INFO ] Transformed 834 places.
[2025-06-03 09:49:05] [INFO ] Transformed 1242 transitions.
[2025-06-03 09:49:05] [INFO ] Found NUPN structural information;
[2025-06-03 09:49:05] [INFO ] Parsed PT model containing 834 places and 1242 transitions and 3828 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 28 ms.
FORMULA Peterson-PT-5-CTLCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 796 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 20 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2025-06-03 09:49:05] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2025-06-03 09:49:05] [INFO ] Computed 23 invariants in 43 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:49:06] [INFO ] Implicit Places using invariants in 783 ms returned []
[2025-06-03 09:49:06] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2025-06-03 09:49:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:49:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2025-06-03 09:49:08] [INFO ] Implicit Places using invariants and state equation in 1805 ms returned []
Implicit Place search using SMT with State Equation took 2619 ms to find 0 implicit places.
Running 1236 sub problems to find dead transitions.
[2025-06-03 09:49:08] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2025-06-03 09:49:08] [INFO ] Invariant cache hit.
[2025-06-03 09:49:08] [INFO ] State equation strengthened by 205 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 828/828 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 7/835 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 2/837 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:49:23] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:49:24] [INFO ] Deduced a trap composed of 139 places in 101 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:49:35] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:49:36] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:49:36] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:49:36] [INFO ] Deduced a trap composed of 126 places in 61 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 828/1956 variables, and 843 constraints, problems are : Problem set: 0 solved, 1236 unsolved in 30054 ms.
Refiners :[Domain max(s): 828/834 constraints, Positive P Invariants (semi-flows): 7/17 constraints, Generalized P Invariants (flows): 2/6 constraints, State Equation: 0/834 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 1236/1236 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1236 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 828/828 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 7/835 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 2/837 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/828 variables, 6/843 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:49:55] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:49:56] [INFO ] Deduced a trap composed of 100 places in 89 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/828 variables, 2/845 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 828/1956 variables, and 845 constraints, problems are : Problem set: 0 solved, 1236 unsolved in 30032 ms.
Refiners :[Domain max(s): 828/834 constraints, Positive P Invariants (semi-flows): 7/17 constraints, Generalized P Invariants (flows): 2/6 constraints, State Equation: 0/834 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 0/1236 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60492ms problems are : Problem set: 0 solved, 1236 unsolved
Search for dead transitions found 0 dead transitions in 60510ms
Finished structural reductions in LTL mode , in 1 iterations and 63179 ms. Remains : 834/834 places, 1242/1242 transitions.
Support contains 796 out of 834 places after structural reductions.
[2025-06-03 09:50:08] [INFO ] Flatten gal took : 89 ms
[2025-06-03 09:50:08] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Peterson-PT-5-CTLCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 09:50:08] [INFO ] Flatten gal took : 58 ms
[2025-06-03 09:50:09] [INFO ] Input system was already deterministic with 1242 transitions.
Support contains 474 out of 834 places (down from 796) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1530 ms. (26 steps per ms) remains 19/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 17/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
[2025-06-03 09:50:09] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2025-06-03 09:50:09] [INFO ] Invariant cache hit.
[2025-06-03 09:50:09] [INFO ] State equation strengthened by 205 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 436/436 constraints. Problems are: Problem set: 6 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/436 variables, 0/436 constraints. Problems are: Problem set: 6 solved, 11 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 2 (OVERLAPS) 362/798 variables, 12/448 constraints. Problems are: Problem set: 9 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/798 variables, 362/810 constraints. Problems are: Problem set: 9 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:10] [INFO ] Deduced a trap composed of 139 places in 286 ms of which 65 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/798 variables, 1/811 constraints. Problems are: Problem set: 9 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/798 variables, 0/811 constraints. Problems are: Problem set: 9 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 6/804 variables, 6/817 constraints. Problems are: Problem set: 9 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/804 variables, 6/823 constraints. Problems are: Problem set: 9 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:11] [INFO ] Deduced a trap composed of 79 places in 324 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:11] [INFO ] Deduced a trap composed of 99 places in 284 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:12] [INFO ] Deduced a trap composed of 119 places in 184 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:12] [INFO ] Deduced a trap composed of 139 places in 98 ms of which 17 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/804 variables, 4/827 constraints. Problems are: Problem set: 9 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/804 variables, 0/827 constraints. Problems are: Problem set: 9 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1122/1926 variables, 804/1631 constraints. Problems are: Problem set: 9 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1926 variables, 205/1836 constraints. Problems are: Problem set: 9 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1926 variables, 0/1836 constraints. Problems are: Problem set: 9 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 30/1956 variables, 30/1866 constraints. Problems are: Problem set: 9 solved, 8 unsolved
SMT process timed out in 5038ms, After SMT, problems are : Problem set: 9 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 342 transitions
Trivial Post-agglo rules discarded 342 transitions
Performed 342 trivial Post agglomeration. Transition count delta: 342
Iterating post reduction 0 with 342 rules applied. Total rules applied 342 place count 834 transition count 900
Reduce places removed 342 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 346 rules applied. Total rules applied 688 place count 492 transition count 896
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 692 place count 488 transition count 896
Performed 177 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 177 Pre rules applied. Total rules applied 692 place count 488 transition count 719
Deduced a syphon composed of 177 places in 1 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 3 with 354 rules applied. Total rules applied 1046 place count 311 transition count 719
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1106 place count 281 transition count 689
Applied a total of 1106 rules in 107 ms. Remains 281 /834 variables (removed 553) and now considering 689/1242 (removed 553) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 281/834 places, 689/1242 transitions.
RANDOM walk for 40000 steps (8 resets) in 429 ms. (93 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 640647 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :0 out of 8
Probabilistic random walk after 640647 steps, saw 95326 distinct states, run finished after 3009 ms. (steps per millisecond=212 ) properties seen :0
[2025-06-03 09:50:18] [INFO ] Flow matrix only has 569 transitions (discarded 120 similar events)
// Phase 1: matrix 569 rows 281 cols
[2025-06-03 09:50:18] [INFO ] Computed 23 invariants in 3 ms
[2025-06-03 09:50:18] [INFO ] State equation strengthened by 205 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 191/202 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 191/207 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 5/207 variables, 5/212 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 5/217 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 5/212 variables, 5/222 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 5/227 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:18] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:18] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:18] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:19] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 14 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 4/231 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 477/689 variables, 212/443 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/689 variables, 140/583 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/689 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 55/744 variables, 30/613 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/744 variables, 30/643 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/744 variables, 5/648 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/744 variables, 5/653 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/744 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 55/799 variables, 10/663 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/799 variables, 10/673 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/799 variables, 60/733 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/799 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 27/826 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/826 variables, 27/761 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/826 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (OVERLAPS) 1/827 variables, 1/762 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/827 variables, 1/763 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/827 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (OVERLAPS) 1/828 variables, 1/764 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/828 variables, 1/765 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/828 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (OVERLAPS) 22/850 variables, 29/794 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/850 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (OVERLAPS) 0/850 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 850/850 variables, and 794 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2507 ms.
Refiners :[Domain max(s): 281/281 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 281/281 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 191/202 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 191/207 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 5/207 variables, 5/212 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 5/217 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 5/212 variables, 5/222 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 5/227 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 4/231 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 477/689 variables, 212/443 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/689 variables, 140/583 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/689 variables, 6/589 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/689 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 55/744 variables, 30/619 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/744 variables, 30/649 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/744 variables, 5/654 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/744 variables, 5/659 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:21] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:21] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:21] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:22] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:22] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:22] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:22] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:22] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:22] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:22] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:22] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:23] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:23] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:23] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:23] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:23] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:23] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:23] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:23] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:23] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 11 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/744 variables, 20/679 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:24] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:24] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:24] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:24] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:24] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:24] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:24] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 12 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/744 variables, 7/686 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:25] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 9 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/744 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/744 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 55/799 variables, 10/697 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/799 variables, 10/707 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/799 variables, 60/767 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:26] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 6 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/799 variables, 1/768 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:26] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:26] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 13 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/799 variables, 2/770 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/799 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (OVERLAPS) 27/826 variables, 1/771 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/826 variables, 27/798 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:27] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:27] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 5 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/826 variables, 2/800 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/826 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (OVERLAPS) 1/827 variables, 1/801 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/827 variables, 1/802 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/827 variables, 1/803 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:28] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:28] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 11 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/827 variables, 2/805 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:29] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 8 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/827 variables, 1/806 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/827 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (OVERLAPS) 1/828 variables, 1/807 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/828 variables, 1/808 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/828 variables, 1/809 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/828 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 44 (OVERLAPS) 22/850 variables, 29/838 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/850 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 46 (OVERLAPS) 0/850 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 850/850 variables, and 838 constraints, problems are : Problem set: 0 solved, 8 unsolved in 11857 ms.
Refiners :[Domain max(s): 281/281 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 281/281 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14375ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 1 properties in 1629 ms.
Support contains 10 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 689/689 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 281 transition count 688
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 280 transition count 688
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 280 transition count 687
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 279 transition count 687
Applied a total of 4 rules in 29 ms. Remains 279 /281 variables (removed 2) and now considering 687/689 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 279/281 places, 687/689 transitions.
RANDOM walk for 40000 steps (8 resets) in 173 ms. (229 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 688121 steps, run timeout after 3001 ms. (steps per millisecond=229 ) properties seen :0 out of 7
Probabilistic random walk after 688121 steps, saw 100543 distinct states, run finished after 3003 ms. (steps per millisecond=229 ) properties seen :0
[2025-06-03 09:50:37] [INFO ] Flow matrix only has 567 transitions (discarded 120 similar events)
// Phase 1: matrix 567 rows 279 cols
[2025-06-03 09:50:37] [INFO ] Computed 23 invariants in 2 ms
[2025-06-03 09:50:37] [INFO ] State equation strengthened by 205 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, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 190/200 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 190/205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 5/205 variables, 5/210 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 5/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 5/210 variables, 5/220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 5/225 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:37] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:37] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:38] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:38] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 14 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 4/229 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 475/685 variables, 210/439 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/685 variables, 140/579 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/685 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 55/740 variables, 30/609 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/740 variables, 30/639 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/740 variables, 5/644 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/740 variables, 5/649 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/740 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 55/795 variables, 10/659 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/795 variables, 10/669 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/795 variables, 60/729 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/795 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (OVERLAPS) 27/822 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/822 variables, 27/757 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/822 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (OVERLAPS) 1/823 variables, 1/758 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/823 variables, 1/759 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/823 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (OVERLAPS) 1/824 variables, 1/760 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/824 variables, 1/761 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/824 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (OVERLAPS) 22/846 variables, 29/790 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/846 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (OVERLAPS) 0/846 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 846/846 variables, and 790 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2252 ms.
Refiners :[Domain max(s): 279/279 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 279/279 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 190/200 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 190/205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 5/205 variables, 5/210 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 5/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 5/210 variables, 5/220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 5/225 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 4/229 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 475/685 variables, 210/439 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/685 variables, 140/579 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/685 variables, 5/584 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/685 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 55/740 variables, 30/614 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/740 variables, 30/644 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/740 variables, 5/649 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/740 variables, 5/654 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:40] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:40] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:40] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:40] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:41] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:41] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:41] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:41] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:41] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:41] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:41] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:41] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:41] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:42] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:42] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:42] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:42] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:42] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:42] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:42] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 10 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/740 variables, 20/674 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:42] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:43] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:43] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:43] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:43] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:43] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:43] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:43] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:43] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:44] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:44] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:44] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:44] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:44] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:44] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:44] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:45] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 15 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/740 variables, 17/691 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:45] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:45] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:45] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 4 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/740 variables, 3/694 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/740 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (OVERLAPS) 55/795 variables, 10/704 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/795 variables, 10/714 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/795 variables, 60/774 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:46] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:46] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 5 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/795 variables, 2/776 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/795 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (OVERLAPS) 27/822 variables, 1/777 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/822 variables, 27/804 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:47] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:47] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:47] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:47] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:47] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:48] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 12 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/822 variables, 6/810 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:48] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:48] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 11 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/822 variables, 2/812 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:49] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 10 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/822 variables, 1/813 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/822 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (OVERLAPS) 1/823 variables, 1/814 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/823 variables, 1/815 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/823 variables, 1/816 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/823 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (OVERLAPS) 1/824 variables, 1/817 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/824 variables, 1/818 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/824 variables, 1/819 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/824 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 43 (OVERLAPS) 22/846 variables, 29/848 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/846 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 45 (OVERLAPS) 0/846 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 846/846 variables, and 848 constraints, problems are : Problem set: 0 solved, 7 unsolved in 13455 ms.
Refiners :[Domain max(s): 279/279 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 279/279 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15725ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 2 properties in 972 ms.
Support contains 7 out of 279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 687/687 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 279 transition count 685
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 277 transition count 685
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 277 transition count 682
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 274 transition count 682
Applied a total of 10 rules in 22 ms. Remains 274 /279 variables (removed 5) and now considering 682/687 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 274/279 places, 682/687 transitions.
RANDOM walk for 40000 steps (8 resets) in 136 ms. (291 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 754425 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :0 out of 5
Probabilistic random walk after 754425 steps, saw 111378 distinct states, run finished after 3001 ms. (steps per millisecond=251 ) properties seen :0
[2025-06-03 09:50:57] [INFO ] Flow matrix only has 562 transitions (discarded 120 similar events)
// Phase 1: matrix 562 rows 274 cols
[2025-06-03 09:50:57] [INFO ] Computed 23 invariants in 2 ms
[2025-06-03 09:50:57] [INFO ] State equation strengthened by 205 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 151/158 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 151/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 4/162 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 4/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 4/166 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:57] [INFO ] Deduced a trap composed of 34 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-03 09:50:57] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/166 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 378/544 variables, 166/346 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/544 variables, 90/436 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/544 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 80/624 variables, 30/466 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/624 variables, 30/496 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/624 variables, 5/501 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/624 variables, 5/506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/624 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 110/734 variables, 20/526 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/734 variables, 20/546 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/734 variables, 110/656 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/734 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 54/788 variables, 2/658 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/788 variables, 54/712 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/788 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 2/790 variables, 2/714 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/790 variables, 2/716 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/790 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 2/792 variables, 2/718 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/792 variables, 2/720 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/792 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (OVERLAPS) 44/836 variables, 58/778 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/836 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (OVERLAPS) 0/836 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 836/836 variables, and 778 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1264 ms.
Refiners :[Domain max(s): 274/274 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 274/274 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 151/158 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 151/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 4/162 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 4/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 4/166 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/166 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 378/544 variables, 166/346 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/544 variables, 90/436 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/544 variables, 4/440 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/544 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 80/624 variables, 30/470 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/624 variables, 30/500 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/624 variables, 5/505 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/624 variables, 5/510 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:59] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:59] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:59] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:59] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:59] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:59] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:59] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:59] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:59] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:59] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:00] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:00] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:00] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:00] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:00] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:00] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:00] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:00] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:00] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:00] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 5 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/624 variables, 20/530 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:01] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:01] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/624 variables, 2/532 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:01] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 12 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/624 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/624 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 110/734 variables, 20/553 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/734 variables, 20/573 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/734 variables, 110/683 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:01] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 6 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/734 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/734 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (OVERLAPS) 54/788 variables, 2/686 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/788 variables, 54/740 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/788 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (OVERLAPS) 2/790 variables, 2/742 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/790 variables, 2/744 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/790 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:02] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:02] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:02] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:03] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:03] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:03] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:03] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 10 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/790 variables, 7/752 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/790 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (OVERLAPS) 2/792 variables, 2/754 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/792 variables, 2/756 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/792 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (OVERLAPS) 44/836 variables, 58/814 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:04] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:04] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:04] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 7 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/836 variables, 3/817 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/836 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (OVERLAPS) 0/836 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 836/836 variables, and 817 constraints, problems are : Problem set: 0 solved, 5 unsolved in 7511 ms.
Refiners :[Domain max(s): 274/274 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 274/274 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8786ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 427 ms.
Support contains 7 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 682/682 transitions.
Applied a total of 0 rules in 11 ms. Remains 274 /274 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 274/274 places, 682/682 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 682/682 transitions.
Applied a total of 0 rules in 10 ms. Remains 274 /274 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2025-06-03 09:51:06] [INFO ] Flow matrix only has 562 transitions (discarded 120 similar events)
[2025-06-03 09:51:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:51:06] [INFO ] Implicit Places using invariants in 295 ms returned [238, 250, 251, 252, 253, 254]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 301 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 268/274 places, 682/682 transitions.
Applied a total of 0 rules in 15 ms. Remains 268 /268 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 327 ms. Remains : 268/274 places, 682/682 transitions.
RANDOM walk for 40000 steps (8 resets) in 143 ms. (277 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 696059 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :0 out of 5
Probabilistic random walk after 696059 steps, saw 101686 distinct states, run finished after 3001 ms. (steps per millisecond=231 ) properties seen :0
[2025-06-03 09:51:10] [INFO ] Flow matrix only has 562 transitions (discarded 120 similar events)
// Phase 1: matrix 562 rows 268 cols
[2025-06-03 09:51:10] [INFO ] Computed 17 invariants in 2 ms
[2025-06-03 09:51:10] [INFO ] State equation strengthened by 205 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 151/158 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 151/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:10] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:10] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 4/162 variables, 4/168 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 4/172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 378/540 variables, 162/334 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 90/424 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 80/620 variables, 30/454 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/620 variables, 30/484 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/620 variables, 5/489 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/620 variables, 5/494 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/620 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 110/730 variables, 20/514 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/730 variables, 20/534 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/730 variables, 110/644 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/730 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 54/784 variables, 2/646 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/784 variables, 54/700 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/784 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 2/786 variables, 2/702 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/786 variables, 2/704 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/786 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 44/830 variables, 56/760 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/830 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (OVERLAPS) 0/830 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 830/830 variables, and 760 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1196 ms.
Refiners :[Domain max(s): 268/268 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 268/268 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 151/158 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 151/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 4/162 variables, 4/168 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 4/172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 378/540 variables, 162/334 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 90/424 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 4/428 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 80/620 variables, 30/458 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/620 variables, 30/488 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/620 variables, 5/493 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/620 variables, 5/498 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:11] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:11] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:12] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:12] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:12] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:12] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:12] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:12] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:12] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:12] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:12] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:12] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:13] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:13] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:13] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:13] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:13] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:13] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:13] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:13] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 9 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/620 variables, 20/518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:13] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:14] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:14] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/620 variables, 3/521 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/620 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 110/730 variables, 20/541 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/730 variables, 20/561 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/730 variables, 110/671 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/730 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 54/784 variables, 2/673 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/784 variables, 54/727 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/784 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 2/786 variables, 2/729 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/786 variables, 2/731 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/786 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:15] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:15] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:15] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:16] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:16] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 6 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/786 variables, 5/737 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:16] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 14 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/786 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/786 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (OVERLAPS) 44/830 variables, 56/794 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:17] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:17] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:17] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 4 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/830 variables, 3/797 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:17] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 10 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/830 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/830 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (OVERLAPS) 0/830 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 830/830 variables, and 798 constraints, problems are : Problem set: 0 solved, 5 unsolved in 7551 ms.
Refiners :[Domain max(s): 268/268 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 268/268 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8758ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 738 ms.
Support contains 7 out of 268 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 682/682 transitions.
Applied a total of 0 rules in 14 ms. Remains 268 /268 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 268/268 places, 682/682 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 682/682 transitions.
Applied a total of 0 rules in 9 ms. Remains 268 /268 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2025-06-03 09:51:19] [INFO ] Flow matrix only has 562 transitions (discarded 120 similar events)
[2025-06-03 09:51:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:51:19] [INFO ] Implicit Places using invariants in 240 ms returned []
[2025-06-03 09:51:19] [INFO ] Flow matrix only has 562 transitions (discarded 120 similar events)
[2025-06-03 09:51:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:51:20] [INFO ] State equation strengthened by 205 read => feed constraints.
[2025-06-03 09:51:20] [INFO ] Implicit Places using invariants and state equation in 914 ms returned []
Implicit Place search using SMT with State Equation took 1156 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 09:51:20] [INFO ] Redundant transitions in 43 ms returned []
Running 676 sub problems to find dead transitions.
[2025-06-03 09:51:20] [INFO ] Flow matrix only has 562 transitions (discarded 120 similar events)
[2025-06-03 09:51:20] [INFO ] Invariant cache hit.
[2025-06-03 09:51:20] [INFO ] State equation strengthened by 205 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 268/268 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 17/285 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:24] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:24] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:24] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:24] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:24] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:24] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:24] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:24] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:24] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:25] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:25] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:25] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:25] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:25] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:25] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:25] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:25] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:25] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:25] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:26] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 20/305 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:26] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:26] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:27] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:27] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:27] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:27] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:27] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:27] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:27] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:27] [INFO ] Deduced a trap composed of 39 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-03 09:51:27] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:27] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:28] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:28] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:28] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:28] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:28] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:28] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:28] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:28] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 20/325 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:32] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:33] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:33] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:33] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:33] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:33] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:33] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:33] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:33] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:33] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:33] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:34] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:34] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:34] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:34] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:34] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:34] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:34] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:34] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:34] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 20/345 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:36] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:36] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:36] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:36] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:36] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:36] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:36] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:36] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:37] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:37] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:37] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:37] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:37] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:37] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:37] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:37] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:37] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:37] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:38] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:38] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 20/365 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:39] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:39] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:39] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:40] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:40] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:40] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:40] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:40] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:40] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:40] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:40] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:41] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:41] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:41] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:41] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:41] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:41] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:41] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:41] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:41] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 20/385 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:49] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:49] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:49] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:49] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:49] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:49] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:49] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:50] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:50] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:50] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:50] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:50] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:50] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 268/830 variables, and 398 constraints, problems are : Problem set: 0 solved, 676 unsolved in 30020 ms.
Refiners :[Domain max(s): 268/268 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/268 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 676/676 constraints, Known Traps: 113/113 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 676 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 268/268 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 17/285 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 113/398 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:54] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:54] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:54] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:54] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:54] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:55] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:55] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:55] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:55] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:55] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:55] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:55] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:55] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:56] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:56] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:56] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:56] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:56] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:56] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:51:56] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 20/418 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:00] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:00] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:00] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:00] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:00] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:00] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:01] [INFO ] Deduced a trap composed of 25 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-03 09:52:01] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:01] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:01] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:01] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:02] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:02] [INFO ] Deduced a trap composed of 43 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-03 09:52:02] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:02] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:02] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:02] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:03] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:03] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:03] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 20/438 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:07] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:07] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:07] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:07] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:09] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:09] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:10] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:10] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:11] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:11] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:11] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:11] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:11] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:11] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:11] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:12] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:12] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:13] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:13] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:13] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 20/458 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:18] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 268/830 variables, and 459 constraints, problems are : Problem set: 0 solved, 676 unsolved in 30023 ms.
Refiners :[Domain max(s): 268/268 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/268 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 0/676 constraints, Known Traps: 174/174 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 676 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61352 ms. Remains : 268/268 places, 682/682 transitions.
Successfully simplified 9 atomic propositions for a total of 13 simplifications.
FORMULA Peterson-PT-5-CTLCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-CTLCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 09:52:21] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-03 09:52:21] [INFO ] Flatten gal took : 40 ms
FORMULA Peterson-PT-5-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 09:52:21] [INFO ] Flatten gal took : 44 ms
[2025-06-03 09:52:21] [INFO ] Input system was already deterministic with 1242 transitions.
Support contains 201 out of 834 places (down from 433) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 11 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2025-06-03 09:52:21] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2025-06-03 09:52:21] [INFO ] Computed 23 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:52:22] [INFO ] Implicit Places using invariants in 1040 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1045 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 12 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1068 ms. Remains : 828/834 places, 1242/1242 transitions.
[2025-06-03 09:52:22] [INFO ] Flatten gal took : 32 ms
[2025-06-03 09:52:22] [INFO ] Flatten gal took : 32 ms
[2025-06-03 09:52:22] [INFO ] Input system was already deterministic with 1242 transitions.
[2025-06-03 09:52:22] [INFO ] Flatten gal took : 31 ms
[2025-06-03 09:52:22] [INFO ] Flatten gal took : 31 ms
[2025-06-03 09:52:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality16092664307005548928.gal : 20 ms
[2025-06-03 09:52:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality10471139629786032280.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16092664307005548928.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10471139629786032280.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 09:52:52] [INFO ] Flatten gal took : 28 ms
[2025-06-03 09:52:52] [INFO ] Applying decomposition
[2025-06-03 09:52:52] [INFO ] Flatten gal took : 27 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/graph1980395996119658342.txt' '-o' '/tmp/graph1980395996119658342.bin' '-w' '/tmp/graph1980395996119658342.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1980395996119658342.bin' '-l' '-1' '-v' '-w' '/tmp/graph1980395996119658342.weights' '-q' '0' '-e' '0.001'
[2025-06-03 09:52:52] [INFO ] Decomposing Gal with order
[2025-06-03 09:52:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 09:52:53] [INFO ] Removed a total of 1038 redundant transitions.
[2025-06-03 09:52:53] [INFO ] Flatten gal took : 185 ms
[2025-06-03 09:52:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2025-06-03 09:52:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality3052221663751573726.gal : 18 ms
[2025-06-03 09:52:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality427850568107747504.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3052221663751573726.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality427850568107747504.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 18 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2025-06-03 09:53:23] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2025-06-03 09:53:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:53:24] [INFO ] Implicit Places using invariants in 1050 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1052 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 11 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1081 ms. Remains : 828/834 places, 1242/1242 transitions.
[2025-06-03 09:53:24] [INFO ] Flatten gal took : 24 ms
[2025-06-03 09:53:24] [INFO ] Flatten gal took : 34 ms
[2025-06-03 09:53:24] [INFO ] Input system was already deterministic with 1242 transitions.
[2025-06-03 09:53:24] [INFO ] Flatten gal took : 31 ms
[2025-06-03 09:53:24] [INFO ] Flatten gal took : 25 ms
[2025-06-03 09:53:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality13871775548905655499.gal : 4 ms
[2025-06-03 09:53:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality6275977165527680265.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13871775548905655499.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6275977165527680265.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 09:53:54] [INFO ] Flatten gal took : 25 ms
[2025-06-03 09:53:54] [INFO ] Applying decomposition
[2025-06-03 09:53:54] [INFO ] Flatten gal took : 24 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/graph13683369461683887984.txt' '-o' '/tmp/graph13683369461683887984.bin' '-w' '/tmp/graph13683369461683887984.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13683369461683887984.bin' '-l' '-1' '-v' '-w' '/tmp/graph13683369461683887984.weights' '-q' '0' '-e' '0.001'
[2025-06-03 09:53:54] [INFO ] Decomposing Gal with order
[2025-06-03 09:53:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 09:53:54] [INFO ] Removed a total of 1038 redundant transitions.
[2025-06-03 09:53:54] [INFO ] Flatten gal took : 50 ms
[2025-06-03 09:53:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-03 09:53:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality13101967590531262616.gal : 8 ms
[2025-06-03 09:53:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality17608794996615704840.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13101967590531262616.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17608794996615704840.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 17 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2025-06-03 09:54:25] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2025-06-03 09:54:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:54:26] [INFO ] Implicit Places using invariants in 1005 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1009 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 18 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1045 ms. Remains : 828/834 places, 1242/1242 transitions.
[2025-06-03 09:54:26] [INFO ] Flatten gal took : 20 ms
[2025-06-03 09:54:26] [INFO ] Flatten gal took : 22 ms
[2025-06-03 09:54:26] [INFO ] Input system was already deterministic with 1242 transitions.
[2025-06-03 09:54:26] [INFO ] Flatten gal took : 22 ms
[2025-06-03 09:54:26] [INFO ] Flatten gal took : 22 ms
[2025-06-03 09:54:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality3568592230929708575.gal : 6 ms
[2025-06-03 09:54:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality1733153759871814357.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3568592230929708575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1733153759871814357.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 09:54:56] [INFO ] Flatten gal took : 22 ms
[2025-06-03 09:54:56] [INFO ] Applying decomposition
[2025-06-03 09:54:56] [INFO ] Flatten gal took : 21 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/graph15817405716165536185.txt' '-o' '/tmp/graph15817405716165536185.bin' '-w' '/tmp/graph15817405716165536185.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15817405716165536185.bin' '-l' '-1' '-v' '-w' '/tmp/graph15817405716165536185.weights' '-q' '0' '-e' '0.001'
[2025-06-03 09:54:56] [INFO ] Decomposing Gal with order
[2025-06-03 09:54:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 09:54:56] [INFO ] Removed a total of 1038 redundant transitions.
[2025-06-03 09:54:56] [INFO ] Flatten gal took : 47 ms
[2025-06-03 09:54:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-03 09:54:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality983062114717608545.gal : 8 ms
[2025-06-03 09:54:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality9923499504592567823.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality983062114717608545.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9923499504592567823.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 834 transition count 1237
Reduce places removed 5 places and 0 transitions.
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Iterating post reduction 1 with 185 rules applied. Total rules applied 190 place count 829 transition count 1057
Reduce places removed 180 places and 0 transitions.
Iterating post reduction 2 with 180 rules applied. Total rules applied 370 place count 649 transition count 1057
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 370 place count 649 transition count 1027
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 430 place count 619 transition count 1027
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 480 place count 594 transition count 1002
Applied a total of 480 rules in 54 ms. Remains 594 /834 variables (removed 240) and now considering 1002/1242 (removed 240) transitions.
[2025-06-03 09:55:26] [INFO ] Flow matrix only has 882 transitions (discarded 120 similar events)
// Phase 1: matrix 882 rows 594 cols
[2025-06-03 09:55:26] [INFO ] Computed 23 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:55:27] [INFO ] Implicit Places using invariants in 648 ms returned [558, 570, 571, 572, 573, 574]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 653 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 588/834 places, 1002/1242 transitions.
Applied a total of 0 rules in 23 ms. Remains 588 /588 variables (removed 0) and now considering 1002/1002 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 731 ms. Remains : 588/834 places, 1002/1242 transitions.
[2025-06-03 09:55:27] [INFO ] Flatten gal took : 15 ms
[2025-06-03 09:55:27] [INFO ] Flatten gal took : 17 ms
[2025-06-03 09:55:27] [INFO ] Input system was already deterministic with 1002 transitions.
RANDOM walk for 165 steps (0 resets) in 5 ms. (27 steps per ms) remains 0/1 properties
FORMULA Peterson-PT-5-CTLCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-03 09:55:27] [INFO ] Flatten gal took : 20 ms
[2025-06-03 09:55:27] [INFO ] Flatten gal took : 18 ms
[2025-06-03 09:55:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8989330719318293221.gal : 4 ms
[2025-06-03 09:55:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16855189780103854601.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/ReachabilityCardinality8989330719318293221.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16855189780103854601.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

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
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 15 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2025-06-03 09:55:27] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2025-06-03 09:55:27] [INFO ] Computed 23 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:55:28] [INFO ] Implicit Places using invariants in 1091 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1094 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 13 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1122 ms. Remains : 828/834 places, 1242/1242 transitions.
[2025-06-03 09:55:28] [INFO ] Flatten gal took : 18 ms
[2025-06-03 09:55:28] [INFO ] Flatten gal took : 21 ms
[2025-06-03 09:55:28] [INFO ] Input system was already deterministic with 1242 transitions.
[2025-06-03 09:55:28] [INFO ] Flatten gal took : 21 ms
[2025-06-03 09:55:28] [INFO ] Flatten gal took : 20 ms
[2025-06-03 09:55:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality3862649982597616802.gal : 4 ms
[2025-06-03 09:55:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality9311726364472668986.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3862649982597616802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9311726364472668986.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 09:55:58] [INFO ] Flatten gal took : 21 ms
[2025-06-03 09:55:58] [INFO ] Applying decomposition
[2025-06-03 09:55:58] [INFO ] Flatten gal took : 20 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/graph5035168200254207944.txt' '-o' '/tmp/graph5035168200254207944.bin' '-w' '/tmp/graph5035168200254207944.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5035168200254207944.bin' '-l' '-1' '-v' '-w' '/tmp/graph5035168200254207944.weights' '-q' '0' '-e' '0.001'
[2025-06-03 09:55:58] [INFO ] Decomposing Gal with order
[2025-06-03 09:55:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 09:55:59] [INFO ] Removed a total of 1038 redundant transitions.
[2025-06-03 09:55:59] [INFO ] Flatten gal took : 59 ms
[2025-06-03 09:55:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-03 09:55:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality3920713863010048951.gal : 30 ms
[2025-06-03 09:55:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality12115574387926773417.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3920713863010048951.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12115574387926773417.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 17 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2025-06-03 09:56:29] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2025-06-03 09:56:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:56:30] [INFO ] Implicit Places using invariants in 1018 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1021 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 20 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1058 ms. Remains : 828/834 places, 1242/1242 transitions.
[2025-06-03 09:56:30] [INFO ] Flatten gal took : 18 ms
[2025-06-03 09:56:30] [INFO ] Flatten gal took : 20 ms
[2025-06-03 09:56:30] [INFO ] Input system was already deterministic with 1242 transitions.
[2025-06-03 09:56:30] [INFO ] Flatten gal took : 20 ms
[2025-06-03 09:56:30] [INFO ] Flatten gal took : 20 ms
[2025-06-03 09:56:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality9129675384069035608.gal : 4 ms
[2025-06-03 09:56:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality15198539292001970672.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9129675384069035608.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15198539292001970672.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 09:57:00] [INFO ] Flatten gal took : 19 ms
[2025-06-03 09:57:00] [INFO ] Applying decomposition
[2025-06-03 09:57:00] [INFO ] Flatten gal took : 25 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/graph5330722967996919075.txt' '-o' '/tmp/graph5330722967996919075.bin' '-w' '/tmp/graph5330722967996919075.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5330722967996919075.bin' '-l' '-1' '-v' '-w' '/tmp/graph5330722967996919075.weights' '-q' '0' '-e' '0.001'
[2025-06-03 09:57:00] [INFO ] Decomposing Gal with order
[2025-06-03 09:57:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 09:57:00] [INFO ] Removed a total of 1038 redundant transitions.
[2025-06-03 09:57:00] [INFO ] Flatten gal took : 44 ms
[2025-06-03 09:57:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-03 09:57:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality8988249309667610270.gal : 8 ms
[2025-06-03 09:57:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality12144214289526626336.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8988249309667610270.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12144214289526626336.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 356 transitions
Trivial Post-agglo rules discarded 356 transitions
Performed 356 trivial Post agglomeration. Transition count delta: 356
Iterating post reduction 0 with 356 rules applied. Total rules applied 356 place count 834 transition count 886
Reduce places removed 356 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 358 rules applied. Total rules applied 714 place count 478 transition count 884
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 716 place count 476 transition count 884
Performed 178 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 178 Pre rules applied. Total rules applied 716 place count 476 transition count 706
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 3 with 356 rules applied. Total rules applied 1072 place count 298 transition count 706
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1132 place count 268 transition count 676
Applied a total of 1132 rules in 39 ms. Remains 268 /834 variables (removed 566) and now considering 676/1242 (removed 566) transitions.
[2025-06-03 09:57:30] [INFO ] Flow matrix only has 556 transitions (discarded 120 similar events)
// Phase 1: matrix 556 rows 268 cols
[2025-06-03 09:57:30] [INFO ] Computed 23 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:57:31] [INFO ] Implicit Places using invariants in 264 ms returned [232, 244, 245, 246, 247, 248]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 265 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 262/834 places, 676/1242 transitions.
Applied a total of 0 rules in 14 ms. Remains 262 /262 variables (removed 0) and now considering 676/676 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 319 ms. Remains : 262/834 places, 676/1242 transitions.
[2025-06-03 09:57:31] [INFO ] Flatten gal took : 13 ms
[2025-06-03 09:57:31] [INFO ] Flatten gal took : 13 ms
[2025-06-03 09:57:31] [INFO ] Input system was already deterministic with 676 transitions.
[2025-06-03 09:57:31] [INFO ] Flatten gal took : 12 ms
[2025-06-03 09:57:31] [INFO ] Flatten gal took : 13 ms
[2025-06-03 09:57:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality4686838200240680818.gal : 2 ms
[2025-06-03 09:57:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality9167387418347555439.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4686838200240680818.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9167387418347555439.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 09:58:01] [INFO ] Flatten gal took : 13 ms
[2025-06-03 09:58:01] [INFO ] Applying decomposition
[2025-06-03 09:58:01] [INFO ] Flatten gal took : 12 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/graph13338084602365461809.txt' '-o' '/tmp/graph13338084602365461809.bin' '-w' '/tmp/graph13338084602365461809.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13338084602365461809.bin' '-l' '-1' '-v' '-w' '/tmp/graph13338084602365461809.weights' '-q' '0' '-e' '0.001'
[2025-06-03 09:58:01] [INFO ] Decomposing Gal with order
[2025-06-03 09:58:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 09:58:01] [INFO ] Removed a total of 917 redundant transitions.
[2025-06-03 09:58:01] [INFO ] Flatten gal took : 28 ms
[2025-06-03 09:58:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 237 labels/synchronizations in 17 ms.
[2025-06-03 09:58:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality16482963493554929326.gal : 3 ms
[2025-06-03 09:58:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality667350382304076262.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16482963493554929326.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality667350382304076262.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 10 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2025-06-03 09:58:31] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2025-06-03 09:58:31] [INFO ] Computed 23 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:58:32] [INFO ] Implicit Places using invariants in 1050 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1052 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 13 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1077 ms. Remains : 828/834 places, 1242/1242 transitions.
[2025-06-03 09:58:32] [INFO ] Flatten gal took : 18 ms
[2025-06-03 09:58:32] [INFO ] Flatten gal took : 24 ms
[2025-06-03 09:58:32] [INFO ] Input system was already deterministic with 1242 transitions.
[2025-06-03 09:58:32] [INFO ] Flatten gal took : 20 ms
[2025-06-03 09:58:32] [INFO ] Flatten gal took : 20 ms
[2025-06-03 09:58:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality6201476044460876949.gal : 5 ms
[2025-06-03 09:58:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality18190965888273810158.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6201476044460876949.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18190965888273810158.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 09:59:02] [INFO ] Flatten gal took : 25 ms
[2025-06-03 09:59:02] [INFO ] Applying decomposition
[2025-06-03 09:59:02] [INFO ] Flatten gal took : 20 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/graph15457358515367360972.txt' '-o' '/tmp/graph15457358515367360972.bin' '-w' '/tmp/graph15457358515367360972.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15457358515367360972.bin' '-l' '-1' '-v' '-w' '/tmp/graph15457358515367360972.weights' '-q' '0' '-e' '0.001'
[2025-06-03 09:59:02] [INFO ] Decomposing Gal with order
[2025-06-03 09:59:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 09:59:02] [INFO ] Removed a total of 1038 redundant transitions.
[2025-06-03 09:59:03] [INFO ] Flatten gal took : 71 ms
[2025-06-03 09:59:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-03 09:59:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality6656692279363066743.gal : 13 ms
[2025-06-03 09:59:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality14271804180344934120.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6656692279363066743.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14271804180344934120.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 18 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2025-06-03 09:59:33] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2025-06-03 09:59:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:59:34] [INFO ] Implicit Places using invariants in 1016 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1022 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 17 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1058 ms. Remains : 828/834 places, 1242/1242 transitions.
[2025-06-03 09:59:34] [INFO ] Flatten gal took : 18 ms
[2025-06-03 09:59:34] [INFO ] Flatten gal took : 20 ms
[2025-06-03 09:59:34] [INFO ] Input system was already deterministic with 1242 transitions.
[2025-06-03 09:59:34] [INFO ] Flatten gal took : 19 ms
[2025-06-03 09:59:34] [INFO ] Flatten gal took : 20 ms
[2025-06-03 09:59:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality14604326409155687454.gal : 4 ms
[2025-06-03 09:59:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality11131579163226255617.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14604326409155687454.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11131579163226255617.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 10:00:04] [INFO ] Flatten gal took : 23 ms
[2025-06-03 10:00:04] [INFO ] Applying decomposition
[2025-06-03 10:00:04] [INFO ] Flatten gal took : 20 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/graph11448408814076775390.txt' '-o' '/tmp/graph11448408814076775390.bin' '-w' '/tmp/graph11448408814076775390.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11448408814076775390.bin' '-l' '-1' '-v' '-w' '/tmp/graph11448408814076775390.weights' '-q' '0' '-e' '0.001'
[2025-06-03 10:00:04] [INFO ] Decomposing Gal with order
[2025-06-03 10:00:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 10:00:04] [INFO ] Removed a total of 1038 redundant transitions.
[2025-06-03 10:00:04] [INFO ] Flatten gal took : 37 ms
[2025-06-03 10:00:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-03 10:00:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality8849391349732494011.gal : 7 ms
[2025-06-03 10:00:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality17946510528863668502.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8849391349732494011.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17946510528863668502.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 11 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2025-06-03 10:00:34] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2025-06-03 10:00:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:00:35] [INFO ] Implicit Places using invariants in 1034 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1036 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 12 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1060 ms. Remains : 828/834 places, 1242/1242 transitions.
[2025-06-03 10:00:35] [INFO ] Flatten gal took : 18 ms
[2025-06-03 10:00:35] [INFO ] Flatten gal took : 19 ms
[2025-06-03 10:00:35] [INFO ] Input system was already deterministic with 1242 transitions.
[2025-06-03 10:00:35] [INFO ] Flatten gal took : 19 ms
[2025-06-03 10:00:35] [INFO ] Flatten gal took : 19 ms
[2025-06-03 10:00:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality3971696962835952155.gal : 4 ms
[2025-06-03 10:00:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality2067866587587182303.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3971696962835952155.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2067866587587182303.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 10:01:05] [INFO ] Flatten gal took : 19 ms
[2025-06-03 10:01:05] [INFO ] Applying decomposition
[2025-06-03 10:01:06] [INFO ] Flatten gal took : 34 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/graph1373979104255160145.txt' '-o' '/tmp/graph1373979104255160145.bin' '-w' '/tmp/graph1373979104255160145.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1373979104255160145.bin' '-l' '-1' '-v' '-w' '/tmp/graph1373979104255160145.weights' '-q' '0' '-e' '0.001'
[2025-06-03 10:01:06] [INFO ] Decomposing Gal with order
[2025-06-03 10:01:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 10:01:06] [INFO ] Removed a total of 1038 redundant transitions.
[2025-06-03 10:01:06] [INFO ] Flatten gal took : 35 ms
[2025-06-03 10:01:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-03 10:01:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality8211382045689266984.gal : 7 ms
[2025-06-03 10:01:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality10347213828334824640.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8211382045689266984.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10347213828334824640.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 17 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2025-06-03 10:01:36] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2025-06-03 10:01:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:01:37] [INFO ] Implicit Places using invariants in 1016 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1018 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 13 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1049 ms. Remains : 828/834 places, 1242/1242 transitions.
[2025-06-03 10:01:37] [INFO ] Flatten gal took : 19 ms
[2025-06-03 10:01:37] [INFO ] Flatten gal took : 19 ms
[2025-06-03 10:01:37] [INFO ] Input system was already deterministic with 1242 transitions.
[2025-06-03 10:01:37] [INFO ] Flatten gal took : 20 ms
[2025-06-03 10:01:37] [INFO ] Flatten gal took : 20 ms
[2025-06-03 10:01:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality8545766770044321313.gal : 4 ms
[2025-06-03 10:01:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality16306827139067177279.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8545766770044321313.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16306827139067177279.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 10:02:07] [INFO ] Flatten gal took : 26 ms
[2025-06-03 10:02:07] [INFO ] Applying decomposition
[2025-06-03 10:02:07] [INFO ] Flatten gal took : 20 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/graph15397628461510514690.txt' '-o' '/tmp/graph15397628461510514690.bin' '-w' '/tmp/graph15397628461510514690.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15397628461510514690.bin' '-l' '-1' '-v' '-w' '/tmp/graph15397628461510514690.weights' '-q' '0' '-e' '0.001'
[2025-06-03 10:02:07] [INFO ] Decomposing Gal with order
[2025-06-03 10:02:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 10:02:07] [INFO ] Removed a total of 1038 redundant transitions.
[2025-06-03 10:02:07] [INFO ] Flatten gal took : 35 ms
[2025-06-03 10:02:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-03 10:02:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality1093694931461079864.gal : 6 ms
[2025-06-03 10:02:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality16635788589412334803.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1093694931461079864.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16635788589412334803.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 10:02:37] [INFO ] Flatten gal took : 20 ms
[2025-06-03 10:02:37] [INFO ] Flatten gal took : 19 ms
[2025-06-03 10:02:37] [INFO ] Applying decomposition
[2025-06-03 10:02:37] [INFO ] Flatten gal took : 20 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/graph13790462615296229612.txt' '-o' '/tmp/graph13790462615296229612.bin' '-w' '/tmp/graph13790462615296229612.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13790462615296229612.bin' '-l' '-1' '-v' '-w' '/tmp/graph13790462615296229612.weights' '-q' '0' '-e' '0.001'
[2025-06-03 10:02:37] [INFO ] Decomposing Gal with order
[2025-06-03 10:02:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 10:02:38] [INFO ] Removed a total of 1034 redundant transitions.
[2025-06-03 10:02:38] [INFO ] Flatten gal took : 42 ms
[2025-06-03 10:02:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-03 10:02:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality11507030478792048627.gal : 5 ms
[2025-06-03 10:02:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality5576302238476534982.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11507030478792048627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5576302238476534982.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 10:27:10] [INFO ] Applying decomposition
[2025-06-03 10:27:11] [INFO ] Flatten gal took : 136 ms
[2025-06-03 10:27:11] [INFO ] Decomposing Gal with order
[2025-06-03 10:27:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 10:27:11] [INFO ] Removed a total of 768 redundant transitions.
[2025-06-03 10:27:11] [INFO ] Flatten gal took : 342 ms
[2025-06-03 10:27:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 390 labels/synchronizations in 111 ms.
[2025-06-03 10:27:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality13417527914570137163.gal : 33 ms
[2025-06-03 10:27:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality5230830286631894520.ctl : 9 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13417527914570137163.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5230830286631894520.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="Peterson-PT-5"
export BK_EXAMINATION="CTLCardinality"
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 Peterson-PT-5, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r142-tall-174876813000617"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-5.tgz
mv Peterson-PT-5 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;