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

About the Execution of ITS-Tools for ShieldPPPs-PT-002B

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

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r198-tall-174894533100628.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 ShieldPPPs-PT-002B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894533100628
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 35K 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 ShieldPPPs-PT-002B-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749189194006

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-002B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-06 05:53:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 05:53:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 05:53:15] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2025-06-06 05:53:15] [INFO ] Transformed 139 places.
[2025-06-06 05:53:15] [INFO ] Transformed 129 transitions.
[2025-06-06 05:53:15] [INFO ] Found NUPN structural information;
[2025-06-06 05:53:15] [INFO ] Parsed PT model containing 139 places and 129 transitions and 354 arcs in 145 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldPPPs-PT-002B-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-002B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-002B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-002B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 129/129 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 128 transition count 118
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 128 transition count 118
Applied a total of 22 rules in 27 ms. Remains 128 /139 variables (removed 11) and now considering 118/129 (removed 11) transitions.
// Phase 1: matrix 118 rows 128 cols
[2025-06-06 05:53:15] [INFO ] Computed 23 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:53:15] [INFO ] Implicit Places using invariants in 226 ms returned []
[2025-06-06 05:53:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:53:15] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2025-06-06 05:53:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:17] [INFO ] Deduced a trap composed of 16 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-06 05:53:17] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:17] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:17] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:17] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:17] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:17] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:17] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:17] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:17] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:17] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:17] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:17] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:17] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:17] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:17] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:17] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:17] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:17] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 19/42 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:18] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:18] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:18] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:18] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:18] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:18] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:18] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:19] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:19] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:19] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:19] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:19] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:19] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:19] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:19] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:19] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 118/246 variables, 128/186 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:21] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:21] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:21] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:21] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:22] [INFO ] Deduced a trap along path composed of 5 places in 49 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:23] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:23] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:25] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 3 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/246 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 15 (OVERLAPS) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 194 constraints, problems are : Problem set: 0 solved, 117 unsolved in 11635 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 42/65 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:27] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:28] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:28] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:28] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:28] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:28] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 118/246 variables, 128/199 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 117/316 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:29] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:29] [INFO ] Deduced a trap composed of 15 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-06 05:53:29] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:30] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:30] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:30] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:30] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 7/323 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:31] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:32] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:32] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:32] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:32] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:32] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:32] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:32] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:32] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:32] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 10/333 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:34] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:34] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:34] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:34] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 4/337 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:37] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:37] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:37] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:40] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:40] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:40] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:43] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:43] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:45] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:46] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:49] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:49] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/246 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/246 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:57] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 246/246 variables, and 351 constraints, problems are : Problem set: 0 solved, 117 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41702ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 41719ms
Starting structural reductions in LTL mode, iteration 1 : 128/139 places, 118/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42172 ms. Remains : 128/139 places, 118/129 transitions.
Support contains 33 out of 128 places after structural reductions.
[2025-06-06 05:53:57] [INFO ] Flatten gal took : 27 ms
[2025-06-06 05:53:57] [INFO ] Flatten gal took : 12 ms
[2025-06-06 05:53:57] [INFO ] Input system was already deterministic with 118 transitions.
RANDOM walk for 6520 steps (15 resets) in 174 ms. (37 steps per ms) remains 0/26 properties
Computed a total of 26 stabilizing places and 26 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1)) U (p2 U p0)))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 118/118 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 125 transition count 115
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 125 transition count 115
Applied a total of 6 rules in 9 ms. Remains 125 /128 variables (removed 3) and now considering 115/118 (removed 3) transitions.
// Phase 1: matrix 115 rows 125 cols
[2025-06-06 05:53:58] [INFO ] Computed 23 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:53:58] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-06 05:53:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:53:58] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2025-06-06 05:53:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:59] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:59] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:59] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:59] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:59] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:59] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:59] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:59] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:59] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:59] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:59] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:59] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:59] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:59] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:59] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:00] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:00] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:00] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:00] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:00] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:00] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:00] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:01] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:01] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:01] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:01] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:01] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 115/240 variables, 125/175 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:02] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:02] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:02] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:02] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:03] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:03] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:03] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:03] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 8/183 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:03] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:03] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:03] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:03] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:04] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:04] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:05] [INFO ] Deduced a trap along path composed of 5 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:06] [INFO ] Deduced a trap along path composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/240 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 13 (OVERLAPS) 0/240 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 191 constraints, problems are : Problem set: 0 solved, 114 unsolved in 9962 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 41/64 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:08] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:08] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:08] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:08] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:08] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:08] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:09] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:09] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:09] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:09] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:09] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:10] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:10] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 115/240 variables, 125/202 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 114/316 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:11] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:11] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:11] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:11] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:11] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:11] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:11] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 7/323 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:12] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:12] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:12] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:12] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:14] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:14] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:14] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:14] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:14] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 5/332 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:16] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:16] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/240 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:25] [INFO ] Deduced a trap along path composed of 5 places in 34 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/240 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:34] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/240 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/240 variables, and 338 constraints, problems are : Problem set: 0 solved, 114 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 73/73 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 39995ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 39997ms
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 115/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40163 ms. Remains : 125/128 places, 115/118 transitions.
Stuttering acceptance computed with spot in 286 ms :[(NOT p0), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), true, (AND (NOT p0) p1)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-01
Entered a terminal (fully accepting) state of product in 7 steps with 1 reset in 3 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLFireability-01 finished in 40518 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 118/118 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 127 transition count 103
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 113 transition count 103
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 28 place count 113 transition count 94
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 46 place count 104 transition count 94
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 50 place count 100 transition count 90
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 100 transition count 90
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 54 place count 100 transition count 88
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 98 transition count 88
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 122 place count 66 transition count 56
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 64 transition count 54
Applied a total of 124 rules in 33 ms. Remains 64 /128 variables (removed 64) and now considering 54/118 (removed 64) transitions.
// Phase 1: matrix 54 rows 64 cols
[2025-06-06 05:54:38] [INFO ] Computed 23 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:54:38] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-06 05:54:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:54:38] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 05:54:38] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2025-06-06 05:54:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:39] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 10 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:39] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 54/118 variables, 64/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 0/118 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 89 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1222 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 54/118 variables, 64/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 52/141 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:40] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 0/118 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 142 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1253 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2481ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 2481ms
Starting structural reductions in SI_LTL mode, iteration 1 : 64/128 places, 54/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2621 ms. Remains : 64/128 places, 54/118 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-02
Stuttering criterion allowed to conclude after 172 steps with 0 reset in 5 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLFireability-02 finished in 2681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0||G(p1)||G(p2)))))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 118/118 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 126 transition count 116
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 126 transition count 116
Applied a total of 4 rules in 15 ms. Remains 126 /128 variables (removed 2) and now considering 116/118 (removed 2) transitions.
// Phase 1: matrix 116 rows 126 cols
[2025-06-06 05:54:41] [INFO ] Computed 23 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:54:41] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-06 05:54:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:54:41] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2025-06-06 05:54:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:42] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:42] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:42] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:42] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:42] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:42] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:42] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:42] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:43] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:43] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:43] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:43] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:43] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:43] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:43] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:43] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:43] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:43] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 18/41 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/242 variables, 126/167 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:44] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:44] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:45] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:45] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:45] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:46] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:46] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:46] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:46] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:46] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:46] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 15 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:47] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:48] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:48] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:49] [INFO ] Deduced a trap along path composed of 5 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:50] [INFO ] Deduced a trap along path composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:51] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 4 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/242 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/242 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 16 (OVERLAPS) 0/242 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 184 constraints, problems are : Problem set: 0 solved, 115 unsolved in 12571 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 33/56 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:54] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:54] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 116/242 variables, 126/184 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 115/299 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:55] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:55] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:55] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:55] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:55] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:55] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:55] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:55] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:55] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:55] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 10/309 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:56] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:57] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:57] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:57] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:57] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:57] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:57] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:57] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:57] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:57] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 10/319 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:59] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:59] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:59] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:04] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:04] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:06] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:13] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:16] [INFO ] Deduced a trap along path composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:20] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:21] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:21] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/242 variables, and 332 constraints, problems are : Problem set: 0 solved, 115 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 42592ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 42593ms
Starting structural reductions in LTL mode, iteration 1 : 126/128 places, 116/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42754 ms. Remains : 126/128 places, 116/118 transitions.
Stuttering acceptance computed with spot in 276 ms :[true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-03
Entered a terminal (fully accepting) state of product in 120 steps with 0 reset in 4 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLFireability-03 finished in 43060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(G(p0))&&p1)) U G((X((F(p1)||p2)) U p3))))'
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 118/118 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 124 transition count 114
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 124 transition count 114
Applied a total of 8 rules in 6 ms. Remains 124 /128 variables (removed 4) and now considering 114/118 (removed 4) transitions.
// Phase 1: matrix 114 rows 124 cols
[2025-06-06 05:55:24] [INFO ] Computed 23 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:55:24] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-06 05:55:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:55:24] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2025-06-06 05:55:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:25] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:25] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:25] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:25] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:25] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:25] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:25] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:25] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:25] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:25] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:26] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:26] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:26] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:26] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:26] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:26] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:26] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:27] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:27] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:27] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:27] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/238 variables, 124/168 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:28] [INFO ] Deduced a trap along path composed of 5 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:29] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:29] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:29] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:29] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:30] [INFO ] Deduced a trap along path composed of 5 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:30] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:31] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/238 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:33] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:33] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:33] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 3 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/238 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 15 (OVERLAPS) 0/238 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 179 constraints, problems are : Problem set: 0 solved, 113 unsolved in 11704 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 29/52 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:36] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:36] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:36] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:36] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:36] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:36] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:36] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:36] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:36] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:37] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:37] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:37] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:37] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/238 variables, 124/189 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 113/302 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:38] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:38] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:38] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:38] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:38] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/307 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:39] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:39] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:41] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:41] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:42] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:43] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:43] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:45] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:47] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:47] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:47] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:47] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:48] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:03] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:03] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 3 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/238 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 238/238 variables, and 325 constraints, problems are : Problem set: 0 solved, 113 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 41727ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 41728ms
Starting structural reductions in LTL mode, iteration 1 : 124/128 places, 114/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41891 ms. Remains : 124/128 places, 114/118 transitions.
Stuttering acceptance computed with spot in 354 ms :[(NOT p3), (AND (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-05
Stuttering criterion allowed to conclude after 55901 steps with 3801 reset in 134 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLFireability-05 finished in 42418 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 118/118 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 127 transition count 102
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 112 transition count 102
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 30 place count 112 transition count 93
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 48 place count 103 transition count 93
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 100 transition count 90
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 100 transition count 90
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 54 place count 100 transition count 88
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 98 transition count 88
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 124 place count 65 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 63 transition count 53
Applied a total of 126 rules in 22 ms. Remains 63 /128 variables (removed 65) and now considering 53/118 (removed 65) transitions.
// Phase 1: matrix 53 rows 63 cols
[2025-06-06 05:56:06] [INFO ] Computed 23 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:56:07] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-06 05:56:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:56:07] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 05:56:07] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2025-06-06 05:56:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:07] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:07] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 53/116 variables, 63/88 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 0/116 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 88 constraints, problems are : Problem set: 0 solved, 51 unsolved in 840 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 53/116 variables, 63/88 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 51/139 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:08] [INFO ] Deduced a trap along path composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/116 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 140 constraints, problems are : Problem set: 0 solved, 51 unsolved in 2822 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3666ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 3666ms
Starting structural reductions in SI_LTL mode, iteration 1 : 63/128 places, 53/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3792 ms. Remains : 63/128 places, 53/118 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-06
Product exploration explored 100000 steps with 5292 reset in 157 ms.
Product exploration explored 100000 steps with 5224 reset in 270 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 80 steps (0 resets) in 7 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
[2025-06-06 05:56:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 05:56:11] [INFO ] [Real]Absence check using 23 positive place invariants in 3 ms returned sat
[2025-06-06 05:56:11] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-06 05:56:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 05:56:11] [INFO ] [Nat]Absence check using 23 positive place invariants in 3 ms returned sat
[2025-06-06 05:56:11] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-06 05:56:11] [INFO ] Computed and/alt/rep : 51/94/51 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-06 05:56:11] [INFO ] Added : 42 causal constraints over 9 iterations in 77 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2025-06-06 05:56:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:56:11] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-06 05:56:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:56:11] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 05:56:11] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2025-06-06 05:56:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:12] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:12] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 53/116 variables, 63/88 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 0/116 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 88 constraints, problems are : Problem set: 0 solved, 51 unsolved in 879 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 53/116 variables, 63/88 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 51/139 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:13] [INFO ] Deduced a trap along path composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/116 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 140 constraints, problems are : Problem set: 0 solved, 51 unsolved in 2744 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3629ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 3629ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3733 ms. Remains : 63/63 places, 53/53 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 77 steps (0 resets) in 7 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
[2025-06-06 05:56:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 05:56:16] [INFO ] [Real]Absence check using 23 positive place invariants in 3 ms returned sat
[2025-06-06 05:56:16] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-06 05:56:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 05:56:16] [INFO ] [Nat]Absence check using 23 positive place invariants in 4 ms returned sat
[2025-06-06 05:56:16] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-06 05:56:16] [INFO ] Computed and/alt/rep : 51/94/51 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-06 05:56:16] [INFO ] Added : 42 causal constraints over 9 iterations in 72 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5272 reset in 127 ms.
Product exploration explored 100000 steps with 5204 reset in 134 ms.
Built C files in :
/tmp/ltsmin2142854561400844222
[2025-06-06 05:56:16] [INFO ] Computing symmetric may disable matrix : 53 transitions.
[2025-06-06 05:56:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 05:56:16] [INFO ] Computing symmetric may enable matrix : 53 transitions.
[2025-06-06 05:56:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 05:56:16] [INFO ] Computing Do-Not-Accords matrix : 53 transitions.
[2025-06-06 05:56:16] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 05:56:16] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2142854561400844222
Running compilation step : cd /tmp/ltsmin2142854561400844222;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 274 ms.
Running link step : cd /tmp/ltsmin2142854561400844222;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin2142854561400844222;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18160235090222511129.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 53/53 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2025-06-06 05:56:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:56:31] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-06 05:56:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:56:31] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 05:56:31] [INFO ] Redundant transitions in 0 ms returned []
Running 51 sub problems to find dead transitions.
[2025-06-06 05:56:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:31] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:32] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 53/116 variables, 63/88 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 0/116 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 88 constraints, problems are : Problem set: 0 solved, 51 unsolved in 876 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 53/116 variables, 63/88 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 51/139 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:33] [INFO ] Deduced a trap along path composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/116 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 140 constraints, problems are : Problem set: 0 solved, 51 unsolved in 2855 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3736ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 3736ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3848 ms. Remains : 63/63 places, 53/53 transitions.
Built C files in :
/tmp/ltsmin14793553025576414432
[2025-06-06 05:56:35] [INFO ] Computing symmetric may disable matrix : 53 transitions.
[2025-06-06 05:56:35] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 05:56:35] [INFO ] Computing symmetric may enable matrix : 53 transitions.
[2025-06-06 05:56:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 05:56:35] [INFO ] Computing Do-Not-Accords matrix : 53 transitions.
[2025-06-06 05:56:35] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 05:56:35] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14793553025576414432
Running compilation step : cd /tmp/ltsmin14793553025576414432;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 143 ms.
Running link step : cd /tmp/ltsmin14793553025576414432;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14793553025576414432;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5874584740421573306.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-06 05:56:50] [INFO ] Flatten gal took : 4 ms
[2025-06-06 05:56:50] [INFO ] Flatten gal took : 3 ms
[2025-06-06 05:56:50] [INFO ] Time to serialize gal into /tmp/LTL2799475101092954488.gal : 2 ms
[2025-06-06 05:56:50] [INFO ] Time to serialize properties into /tmp/LTL8699206550758286154.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2799475101092954488.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8851621338311601635.hoa' '-atoms' '/tmp/LTL8699206550758286154.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8699206550758286154.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8851621338311601635.hoa
Reverse transition relation is NOT exact ! Due to transitions t0.t79, t1.t76, t2.t73, t4, t5, t7, t8, t10, t11, t12.t51, t13.t48, t16, t18, t20, t21, t23, ...380
Computing Next relation with stutter on 162 deadlock states
Detected timeout of ITS tools.
[2025-06-06 05:57:05] [INFO ] Flatten gal took : 4 ms
[2025-06-06 05:57:05] [INFO ] Flatten gal took : 3 ms
[2025-06-06 05:57:05] [INFO ] Time to serialize gal into /tmp/LTL12764403338756330967.gal : 1 ms
[2025-06-06 05:57:05] [INFO ] Time to serialize properties into /tmp/LTL10263945151925881222.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12764403338756330967.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10263945151925881222.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(p115==1)"))))
Formula 0 simplified : FG!"(p115==1)"
Reverse transition relation is NOT exact ! Due to transitions t0.t79, t1.t76, t2.t73, t4, t5, t7, t8, t10, t11, t12.t51, t13.t48, t16, t18, t20, t21, t23, ...380
Computing Next relation with stutter on 162 deadlock states
Detected timeout of ITS tools.
[2025-06-06 05:57:20] [INFO ] Flatten gal took : 7 ms
[2025-06-06 05:57:20] [INFO ] Applying decomposition
[2025-06-06 05:57:20] [INFO ] Flatten gal took : 8 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/graph3949774421746628940.txt' '-o' '/tmp/graph3949774421746628940.bin' '-w' '/tmp/graph3949774421746628940.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3949774421746628940.bin' '-l' '-1' '-v' '-w' '/tmp/graph3949774421746628940.weights' '-q' '0' '-e' '0.001'
[2025-06-06 05:57:20] [INFO ] Decomposing Gal with order
[2025-06-06 05:57:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 05:57:20] [INFO ] Removed a total of 12 redundant transitions.
[2025-06-06 05:57:21] [INFO ] Flatten gal took : 160 ms
[2025-06-06 05:57:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 3 ms.
[2025-06-06 05:57:21] [INFO ] Time to serialize gal into /tmp/LTL17776935510346681767.gal : 2 ms
[2025-06-06 05:57:21] [INFO ] Time to serialize properties into /tmp/LTL13956788482643351142.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17776935510346681767.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13956788482643351142.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("(i4.u20.p115==1)"))))
Formula 0 simplified : FG!"(i4.u20.p115==1)"
Reverse transition relation is NOT exact ! Due to transitions t0_t79, t1_t76, t2_t73, t12_t51, t13_t48, t14_t45_t82_t44, i0.t61_t62_t63_t103, i0.t61_t62_t6...529
Computing Next relation with stutter on 162 deadlock states
53 unique states visited
53 strongly connected components in search stack
54 transitions explored
53 items max in DFS search stack
967 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.68526,246080,1,0,412999,134,636,699764,133,310,414605
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPs-PT-002B-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldPPPs-PT-002B-LTLFireability-06 finished in 85135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))&&(G(!p1)||(!p1&&F(!p2)))))'
Support contains 6 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 118/118 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 124 transition count 114
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 124 transition count 114
Applied a total of 8 rules in 4 ms. Remains 124 /128 variables (removed 4) and now considering 114/118 (removed 4) transitions.
// Phase 1: matrix 114 rows 124 cols
[2025-06-06 05:57:32] [INFO ] Computed 23 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:57:32] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-06 05:57:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:57:32] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2025-06-06 05:57:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:33] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:33] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:33] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:33] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:33] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:33] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:33] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:33] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:33] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:33] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:33] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:33] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:33] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:33] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:33] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:34] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:34] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:34] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:34] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:34] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:34] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/238 variables, 124/168 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:36] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:36] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:37] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:37] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:37] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:38] [INFO ] Deduced a trap along path composed of 5 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:38] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:39] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/238 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:41] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:41] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:41] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 3 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/238 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 15 (OVERLAPS) 0/238 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 179 constraints, problems are : Problem set: 0 solved, 113 unsolved in 11586 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 29/52 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:44] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:44] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:44] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:44] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:44] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:44] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:44] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:44] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:44] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:44] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:44] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:44] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:44] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/238 variables, 124/189 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 113/302 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:45] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:45] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:46] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:46] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:46] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/307 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:47] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:47] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:49] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:49] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:49] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:50] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:51] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:53] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:54] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:54] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:54] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:55] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:55] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:10] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:10] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 2 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/238 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 238/238 variables, and 325 constraints, problems are : Problem set: 0 solved, 113 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 41615ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 41616ms
Starting structural reductions in LTL mode, iteration 1 : 124/128 places, 114/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41861 ms. Remains : 124/128 places, 114/118 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) p1), true, (NOT p0), (AND p2 p1), (NOT p0), p2]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-07
Product exploration explored 100000 steps with 1030 reset in 125 ms.
Product exploration explored 100000 steps with 1031 reset in 135 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 120 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 418 steps (0 resets) in 10 ms. (38 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 10 factoid took 119 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-06 05:58:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 05:58:14] [INFO ] [Real]Absence check using 23 positive place invariants in 6 ms returned sat
[2025-06-06 05:58:15] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2025-06-06 05:58:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 05:58:15] [INFO ] [Nat]Absence check using 23 positive place invariants in 5 ms returned sat
[2025-06-06 05:58:15] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2025-06-06 05:58:15] [INFO ] Computed and/alt/rep : 113/200/113 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-06 05:58:15] [INFO ] Added : 107 causal constraints over 22 iterations in 419 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 124 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 114/114 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2025-06-06 05:58:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:58:15] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-06 05:58:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:58:15] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2025-06-06 05:58:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:16] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:16] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:16] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:16] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:16] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:16] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:16] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:16] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:17] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:17] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:17] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:17] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:17] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:17] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:17] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:17] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:17] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:18] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:18] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:18] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:18] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/238 variables, 124/168 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:19] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:20] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:20] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:20] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:20] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:21] [INFO ] Deduced a trap along path composed of 5 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:21] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:23] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/238 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:24] [INFO ] Deduced a trap composed of 18 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-06 05:58:24] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:25] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/238 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 15 (OVERLAPS) 0/238 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 179 constraints, problems are : Problem set: 0 solved, 113 unsolved in 11823 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 29/52 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:27] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:27] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:27] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:28] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:28] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:28] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:28] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:28] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:28] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:28] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:28] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:28] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:28] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/238 variables, 124/189 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 113/302 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:29] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:29] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:29] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:29] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:29] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/307 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:30] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:30] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:33] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:33] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:33] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:34] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:35] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:37] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:38] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:38] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:38] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:38] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:39] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:54] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:58:54] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 2 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/238 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 238/238 variables, and 325 constraints, problems are : Problem set: 0 solved, 113 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 41846ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 41846ms
Finished structural reductions in LTL mode , in 1 iterations and 42024 ms. Remains : 124/124 places, 114/114 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 454 steps (0 resets) in 6 ms. (64 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-06 05:58:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 05:58:58] [INFO ] [Real]Absence check using 23 positive place invariants in 6 ms returned sat
[2025-06-06 05:58:58] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2025-06-06 05:58:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 05:58:58] [INFO ] [Nat]Absence check using 23 positive place invariants in 5 ms returned sat
[2025-06-06 05:58:58] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2025-06-06 05:58:58] [INFO ] Computed and/alt/rep : 113/200/113 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-06 05:58:58] [INFO ] Added : 107 causal constraints over 22 iterations in 407 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1027 reset in 133 ms.
Product exploration explored 100000 steps with 1025 reset in 134 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 114/114 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 124 transition count 114
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 14 place count 124 transition count 115
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 20 place count 124 transition count 115
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 59 place count 124 transition count 115
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 75 place count 108 transition count 99
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 91 place count 108 transition count 99
Deduced a syphon composed of 43 places in 0 ms
Applied a total of 91 rules in 18 ms. Remains 108 /124 variables (removed 16) and now considering 99/114 (removed 15) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 05:58:59] [INFO ] Redundant transitions in 2 ms returned []
Running 98 sub problems to find dead transitions.
// Phase 1: matrix 99 rows 108 cols
[2025-06-06 05:58:59] [INFO ] Computed 23 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:00] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 4 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:00] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:00] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:00] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:00] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:00] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 3 ms to minimize.
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:00] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:00] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 3 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:00] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 3 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:00] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:00] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:00] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:00] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
Problem TDEAD55 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:00] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 2 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:00] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:00] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 20/43 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/43 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 99/207 variables, 108/151 constraints. Problems are: Problem set: 44 solved, 54 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:01] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 1/152 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/152 constraints. Problems are: Problem set: 44 solved, 54 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:02] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 3 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/207 variables, 1/153 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/153 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 0/207 variables, 0/153 constraints. Problems are: Problem set: 44 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 153 constraints, problems are : Problem set: 44 solved, 54 unsolved in 3437 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 44 solved, 54 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 44/108 variables, 23/23 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 22/45 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/45 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 99/207 variables, 108/153 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 54/207 constraints. Problems are: Problem set: 44 solved, 54 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:03] [INFO ] Deduced a trap along path composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 1/208 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/208 constraints. Problems are: Problem set: 44 solved, 54 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:07] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:07] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/207 variables, 2/210 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/210 constraints. Problems are: Problem set: 44 solved, 54 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:12] [INFO ] Deduced a trap along path composed of 10 places in 21 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/207 variables, 1/211 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 0/211 constraints. Problems are: Problem set: 44 solved, 54 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:16] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 3 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/207 variables, 1/212 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/212 constraints. Problems are: Problem set: 44 solved, 54 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:21] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 3 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/207 variables, 1/213 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/207 variables, 0/213 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 16 (OVERLAPS) 0/207 variables, 0/213 constraints. Problems are: Problem set: 44 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 213 constraints, problems are : Problem set: 44 solved, 54 unsolved in 24876 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 54/98 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 28335ms problems are : Problem set: 44 solved, 54 unsolved
Search for dead transitions found 44 dead transitions in 28340ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 108/124 places, 55/114 transitions.
Graph (complete) has 170 edges and 108 vertex of which 65 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.2 ms
Discarding 43 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 65 /108 variables (removed 43) and now considering 55/55 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 65/124 places, 55/114 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 28373 ms. Remains : 65/124 places, 55/114 transitions.
Built C files in :
/tmp/ltsmin4565739560502248499
[2025-06-06 05:59:27] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4565739560502248499
Running compilation step : cd /tmp/ltsmin4565739560502248499;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 186 ms.
Running link step : cd /tmp/ltsmin4565739560502248499;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin4565739560502248499;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8136048955080653236.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 114/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 114/114 (removed 0) transitions.
// Phase 1: matrix 114 rows 124 cols
[2025-06-06 05:59:43] [INFO ] Computed 23 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:59:43] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-06 05:59:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:59:43] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2025-06-06 05:59:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:44] [INFO ] Deduced a trap composed of 16 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-06 05:59:44] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:44] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:44] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:44] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:44] [INFO ] Deduced a trap composed of 16 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-06 05:59:44] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:44] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:44] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:44] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:44] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:44] [INFO ] Deduced a trap composed of 18 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-06 05:59:44] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:44] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:44] [INFO ] Deduced a trap composed of 24 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-06 05:59:44] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:45] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:45] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:45] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:45] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:45] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/238 variables, 124/168 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:47] [INFO ] Deduced a trap along path composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:47] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:47] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:48] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:48] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:49] [INFO ] Deduced a trap along path composed of 5 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:49] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:50] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/238 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:52] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:52] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:52] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/238 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 15 (OVERLAPS) 0/238 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 179 constraints, problems are : Problem set: 0 solved, 113 unsolved in 11770 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 29/52 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:55] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:55] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:55] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:55] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:55] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:55] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:55] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:55] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:55] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:55] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:55] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:55] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:55] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/238 variables, 124/189 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 113/302 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:56] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:56] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:57] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:57] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:57] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/307 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:58] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:59:58] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:00:00] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:00:00] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:00:00] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:00:02] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:00:02] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:00:04] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:00:05] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:00:05] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:00:06] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:00:06] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:00:06] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:00:21] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:00:22] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 238/238 variables, and 325 constraints, problems are : Problem set: 0 solved, 113 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 41795ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 41795ms
Finished structural reductions in LTL mode , in 1 iterations and 41954 ms. Remains : 124/124 places, 114/114 transitions.
Built C files in :
/tmp/ltsmin18352858344882324246
[2025-06-06 06:00:24] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18352858344882324246
Running compilation step : cd /tmp/ltsmin18352858344882324246;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 178 ms.
Running link step : cd /tmp/ltsmin18352858344882324246;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin18352858344882324246;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11084634487407326319.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-06 06:00:40] [INFO ] Flatten gal took : 6 ms
[2025-06-06 06:00:40] [INFO ] Flatten gal took : 5 ms
[2025-06-06 06:00:40] [INFO ] Time to serialize gal into /tmp/LTL17473746553962170638.gal : 2 ms
[2025-06-06 06:00:40] [INFO ] Time to serialize properties into /tmp/LTL13770463028201161675.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17473746553962170638.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16818537720874325968.hoa' '-atoms' '/tmp/LTL13770463028201161675.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL13770463028201161675.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16818537720874325968.hoa
Detected timeout of ITS tools.
[2025-06-06 06:00:55] [INFO ] Flatten gal took : 7 ms
[2025-06-06 06:00:55] [INFO ] Flatten gal took : 6 ms
[2025-06-06 06:00:55] [INFO ] Time to serialize gal into /tmp/LTL3828718498145693487.gal : 1 ms
[2025-06-06 06:00:55] [INFO ] Time to serialize properties into /tmp/LTL11841866829228569732.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3828718498145693487.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11841866829228569732.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("((p39==1)&&(p90==1))"))))&&((G("((p83!=1)||(p116!=1))"))||(F("((p100!=1)||(p136!=1))")))))
Formula 0 simplified : XXG!"((p39==1)&&(p90==1))" | (F!"((p83!=1)||(p116!=1))" & G!"((p100!=1)||(p136!=1))")
Detected timeout of ITS tools.
[2025-06-06 06:01:10] [INFO ] Flatten gal took : 12 ms
[2025-06-06 06:01:10] [INFO ] Applying decomposition
[2025-06-06 06:01:10] [INFO ] Flatten gal took : 5 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/graph13998409581021042872.txt' '-o' '/tmp/graph13998409581021042872.bin' '-w' '/tmp/graph13998409581021042872.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13998409581021042872.bin' '-l' '-1' '-v' '-w' '/tmp/graph13998409581021042872.weights' '-q' '0' '-e' '0.001'
[2025-06-06 06:01:10] [INFO ] Decomposing Gal with order
[2025-06-06 06:01:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 06:01:10] [INFO ] Removed a total of 18 redundant transitions.
[2025-06-06 06:01:10] [INFO ] Flatten gal took : 11 ms
[2025-06-06 06:01:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-06 06:01:10] [INFO ] Time to serialize gal into /tmp/LTL2870960887278225469.gal : 2 ms
[2025-06-06 06:01:10] [INFO ] Time to serialize properties into /tmp/LTL18079140250842667069.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2870960887278225469.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18079140250842667069.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("((i2.i1.u16.p39==1)&&(i8.i0.u32.p90==1))"))))&&((G("((i7.i0.u29.p83!=1)||(i6.i1.u40.p116!=1))"))||(F("((i9.u36.p100!=1)||(i...177
Formula 0 simplified : XXG!"((i2.i1.u16.p39==1)&&(i8.i0.u32.p90==1))" | (F!"((i7.i0.u29.p83!=1)||(i6.i1.u40.p116!=1))" & G!"((i9.u36.p100!=1)||(i10.u46.p13...163
Reverse transition relation is NOT exact ! Due to transitions t43, t46, t49, t71, t74, t77, i0.i1.u5.t80, i1.u6.t79, i2.i0.u9.t76, i2.i1.u15.t68, i2.i1.u16...631
Computing Next relation with stutter on 162 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
994 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.9636,221672,1,0,445574,360,1584,542089,202,1173,452855
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldPPPs-PT-002B-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldPPPs-PT-002B-LTLFireability-07 finished in 228718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!p0 U p1))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 118/118 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 127 transition count 103
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 113 transition count 103
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 28 place count 113 transition count 94
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 46 place count 104 transition count 94
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 50 place count 100 transition count 90
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 100 transition count 90
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 54 place count 100 transition count 88
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 98 transition count 88
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 122 place count 66 transition count 56
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 64 transition count 54
Applied a total of 124 rules in 17 ms. Remains 64 /128 variables (removed 64) and now considering 54/118 (removed 64) transitions.
// Phase 1: matrix 54 rows 64 cols
[2025-06-06 06:01:20] [INFO ] Computed 23 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:01:20] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-06 06:01:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:01:20] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 06:01:20] [INFO ] Redundant transitions in 0 ms returned []
Running 52 sub problems to find dead transitions.
[2025-06-06 06:01:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:21] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:21] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 54/118 variables, 64/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 0/118 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 89 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1211 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 54/118 variables, 64/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 52/141 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:22] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 0/118 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 142 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1233 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2451ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 2451ms
Starting structural reductions in SI_LTL mode, iteration 1 : 64/128 places, 54/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2582 ms. Remains : 64/128 places, 54/118 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-08
Stuttering criterion allowed to conclude after 183 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLFireability-08 finished in 2675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(F(p0))||(p1&&F(p0)))) U X(X(G(!p2))))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 118/118 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 124 transition count 114
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 124 transition count 114
Applied a total of 8 rules in 3 ms. Remains 124 /128 variables (removed 4) and now considering 114/118 (removed 4) transitions.
// Phase 1: matrix 114 rows 124 cols
[2025-06-06 06:01:23] [INFO ] Computed 23 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:01:23] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-06 06:01:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:01:23] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2025-06-06 06:01:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:24] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:24] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:24] [INFO ] Deduced a trap composed of 20 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-06 06:01:24] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:24] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:24] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:24] [INFO ] Deduced a trap composed of 18 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-06 06:01:24] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:25] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:25] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:25] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:25] [INFO ] Deduced a trap composed of 18 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-06 06:01:25] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:25] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:25] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:25] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:25] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:26] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:26] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:26] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:26] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/238 variables, 124/168 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:27] [INFO ] Deduced a trap along path composed of 5 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:28] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:28] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:28] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:28] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:29] [INFO ] Deduced a trap along path composed of 5 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:29] [INFO ] Deduced a trap along path composed of 3 places in 41 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:31] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/238 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:32] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:32] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:33] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/238 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 15 (OVERLAPS) 0/238 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 179 constraints, problems are : Problem set: 0 solved, 113 unsolved in 11745 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 29/52 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:35] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:35] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:35] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:35] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:35] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:35] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:35] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:35] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:35] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:36] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:36] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:36] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:36] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/238 variables, 124/189 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 113/302 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:37] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:37] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:37] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:37] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:37] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/307 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:38] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:38] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:40] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:41] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:41] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:42] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:43] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:45] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:46] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:46] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:46] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:47] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:01:47] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:02] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:03] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 238/238 variables, and 325 constraints, problems are : Problem set: 0 solved, 113 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 41777ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 41778ms
Starting structural reductions in LTL mode, iteration 1 : 124/128 places, 114/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41976 ms. Remains : 124/128 places, 114/118 transitions.
Stuttering acceptance computed with spot in 264 ms :[p2, (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-09
Product exploration explored 100000 steps with 5909 reset in 108 ms.
Product exploration explored 100000 steps with 5962 reset in 133 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Detected a total of 23/124 stabilizing places and 23/114 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 141 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[p2, (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (96 resets) in 219 ms. (181 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40004 steps (21 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
[2025-06-06 06:02:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/73 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/124 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:06] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:06] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:06] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 114/238 variables, 124/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:06] [INFO ] Deduced a trap along path composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/238 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/73 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/124 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:06] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:06] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 114/238 variables, 124/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:07] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:07] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:07] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Problem apf5 is UNSAT
After SMT solving in domain Int declared 238/238 variables, and 157 constraints, problems are : Problem set: 1 solved, 0 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 639ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p2) p0))]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p2 p1))), (F (NOT (OR p2 p0))), (F (NOT (OR (NOT p2) p1))), (F (NOT p1))]
Knowledge based reduction with 11 factoid took 399 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[p2, (AND (NOT p1) p2 (NOT p0)), p2, (AND (NOT p1) p2 (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 233 ms :[p2, (AND (NOT p1) p2 (NOT p0)), p2, (AND (NOT p1) p2 (NOT p0)), (NOT p0), (NOT p0)]
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 114/114 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2025-06-06 06:02:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:02:08] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-06 06:02:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:02:08] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2025-06-06 06:02:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:08] [INFO ] Deduced a trap composed of 16 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-06 06:02:09] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:09] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:09] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:09] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:09] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:09] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:09] [INFO ] Deduced a trap composed of 20 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-06 06:02:09] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:09] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:09] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:09] [INFO ] Deduced a trap composed of 18 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-06 06:02:09] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:09] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:10] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:10] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:10] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:10] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:10] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:10] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:11] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/238 variables, 124/168 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:12] [INFO ] Deduced a trap along path composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:13] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:13] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:13] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:13] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:14] [INFO ] Deduced a trap along path composed of 5 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:14] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:15] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/238 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:17] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:17] [INFO ] Deduced a trap composed of 19 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-06 06:02:17] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/238 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 15 (OVERLAPS) 0/238 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 179 constraints, problems are : Problem set: 0 solved, 113 unsolved in 11778 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 29/52 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:20] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:20] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:20] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:20] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:20] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:20] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:20] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:20] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:20] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:20] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:20] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:20] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:20] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/238 variables, 124/189 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 113/302 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:21] [INFO ] Deduced a trap composed of 9 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-06 06:02:21] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:22] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:22] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:22] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/307 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:23] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:23] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:25] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:25] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:25] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:27] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:27] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:29] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:30] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:30] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:31] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:31] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:31] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:46] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:47] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 3 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/238 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 238/238 variables, and 325 constraints, problems are : Problem set: 0 solved, 113 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 41800ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 41800ms
Finished structural reductions in LTL mode , in 1 iterations and 41935 ms. Remains : 124/124 places, 114/114 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Detected a total of 23/124 stabilizing places and 23/114 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X p1), (X (X (NOT p2))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 116 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[p2, (AND (NOT p1) p2 (NOT p0)), p2, (AND (NOT p1) p2 (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 2118 steps (4 resets) in 18 ms. (111 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X p1), (X (X (NOT p2))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p2 p1))), (F p2), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 6 factoid took 292 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[p2, (AND (NOT p1) p2 (NOT p0)), p2, (AND (NOT p1) p2 (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 249 ms :[p2, (AND (NOT p1) p2 (NOT p0)), p2, (AND (NOT p1) p2 (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 235 ms :[p2, (AND (NOT p1) p2 (NOT p0)), p2, (AND (NOT p1) p2 (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2578 reset in 127 ms.
Product exploration explored 100000 steps with 2527 reset in 134 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 228 ms :[p2, (AND (NOT p1) p2 (NOT p0)), p2, (AND (NOT p1) p2 (NOT p0)), (NOT p0), (NOT p0)]
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 114/114 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 124 transition count 114
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 13 place count 124 transition count 115
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 124 transition count 115
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 56 place count 124 transition count 115
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 69 place count 111 transition count 102
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 82 place count 111 transition count 102
Deduced a syphon composed of 43 places in 0 ms
Applied a total of 82 rules in 17 ms. Remains 111 /124 variables (removed 13) and now considering 102/114 (removed 12) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 06:02:52] [INFO ] Redundant transitions in 1 ms returned []
Running 101 sub problems to find dead transitions.
// Phase 1: matrix 102 rows 111 cols
[2025-06-06 06:02:52] [INFO ] Computed 23 invariants in 2 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:52] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:52] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:52] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:52] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:52] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:52] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 2 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:52] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:52] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:52] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:53] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 3 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:53] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 2 ms to minimize.
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:53] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:53] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:53] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 17/40 constraints. Problems are: Problem set: 44 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/40 constraints. Problems are: Problem set: 44 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 102/213 variables, 111/151 constraints. Problems are: Problem set: 44 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:53] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:53] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:53] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 3/154 constraints. Problems are: Problem set: 44 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:54] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 1/155 constraints. Problems are: Problem set: 44 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:54] [INFO ] Deduced a trap along path composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/156 constraints. Problems are: Problem set: 44 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:54] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:54] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 2/158 constraints. Problems are: Problem set: 44 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:55] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 1/159 constraints. Problems are: Problem set: 44 solved, 57 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/159 constraints. Problems are: Problem set: 44 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:55] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 4 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/213 variables, 1/160 constraints. Problems are: Problem set: 44 solved, 57 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 0/160 constraints. Problems are: Problem set: 44 solved, 57 unsolved
At refinement iteration 13 (OVERLAPS) 0/213 variables, 0/160 constraints. Problems are: Problem set: 44 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 160 constraints, problems are : Problem set: 44 solved, 57 unsolved in 4661 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 44 solved, 57 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 44 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 44/111 variables, 23/23 constraints. Problems are: Problem set: 44 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 25/48 constraints. Problems are: Problem set: 44 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/48 constraints. Problems are: Problem set: 44 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 102/213 variables, 111/159 constraints. Problems are: Problem set: 44 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 57/216 constraints. Problems are: Problem set: 44 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 1/217 constraints. Problems are: Problem set: 44 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:02:59] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/218 constraints. Problems are: Problem set: 44 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/218 constraints. Problems are: Problem set: 44 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:04] [INFO ] Deduced a trap along path composed of 11 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/213 variables, 1/219 constraints. Problems are: Problem set: 44 solved, 57 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/219 constraints. Problems are: Problem set: 44 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:09] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/213 variables, 1/220 constraints. Problems are: Problem set: 44 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:13] [INFO ] Deduced a trap along path composed of 12 places in 41 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 1/221 constraints. Problems are: Problem set: 44 solved, 57 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 0/221 constraints. Problems are: Problem set: 44 solved, 57 unsolved
At refinement iteration 14 (OVERLAPS) 0/213 variables, 0/221 constraints. Problems are: Problem set: 44 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 221 constraints, problems are : Problem set: 44 solved, 57 unsolved in 27856 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 57/101 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 32534ms problems are : Problem set: 44 solved, 57 unsolved
Search for dead transitions found 44 dead transitions in 32535ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 111/124 places, 58/114 transitions.
Graph (complete) has 168 edges and 111 vertex of which 68 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.1 ms
Discarding 43 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 68 /111 variables (removed 43) and now considering 58/58 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/124 places, 58/114 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 32568 ms. Remains : 68/124 places, 58/114 transitions.
Built C files in :
/tmp/ltsmin14329672511087915310
[2025-06-06 06:03:24] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14329672511087915310
Running compilation step : cd /tmp/ltsmin14329672511087915310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 182 ms.
Running link step : cd /tmp/ltsmin14329672511087915310;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14329672511087915310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6446912051096749786.hoa' '--buchi-type=spotba'
LTSmin run took 535 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-002B-LTLFireability-09 finished in 121927 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F(G(p0))))))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 118/118 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 124 transition count 114
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 124 transition count 114
Applied a total of 8 rules in 2 ms. Remains 124 /128 variables (removed 4) and now considering 114/118 (removed 4) transitions.
// Phase 1: matrix 114 rows 124 cols
[2025-06-06 06:03:25] [INFO ] Computed 23 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:03:25] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-06 06:03:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:03:25] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2025-06-06 06:03:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:26] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:26] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:26] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:26] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:26] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:26] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:26] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:26] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:26] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:26] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:26] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:27] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:27] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:27] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:27] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:27] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:27] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:28] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:28] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:28] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:28] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/238 variables, 124/168 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:29] [INFO ] Deduced a trap along path composed of 5 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:30] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:30] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:30] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:30] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:31] [INFO ] Deduced a trap along path composed of 5 places in 29 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:31] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:32] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/238 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:34] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:34] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:34] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 3 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/238 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 15 (OVERLAPS) 0/238 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 179 constraints, problems are : Problem set: 0 solved, 113 unsolved in 11670 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 29/52 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:37] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:37] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:37] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:37] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:37] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:37] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:37] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:37] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:37] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:37] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:38] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:38] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:38] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/238 variables, 124/189 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 113/302 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:39] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:39] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:39] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:39] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:39] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/307 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:40] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:40] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:42] [INFO ] Deduced a trap composed of 16 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-06 06:03:42] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:43] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:44] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:44] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:46] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:47] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:48] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:48] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:48] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:03:49] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:03] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:04] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 2 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/238 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 238/238 variables, and 325 constraints, problems are : Problem set: 0 solved, 113 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 41709ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 41709ms
Starting structural reductions in LTL mode, iteration 1 : 124/128 places, 114/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41899 ms. Remains : 124/128 places, 114/118 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-11
Product exploration explored 100000 steps with 250 reset in 143 ms.
Stack based approach found an accepted trace after 3401 steps with 7 reset with depth 450 and stack size 450 in 5 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPs-PT-002B-LTLFireability-11 finished in 42185 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)&&X(G(p1))))))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 118/118 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 124 transition count 114
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 124 transition count 114
Applied a total of 8 rules in 1 ms. Remains 124 /128 variables (removed 4) and now considering 114/118 (removed 4) transitions.
[2025-06-06 06:04:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:04:07] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-06 06:04:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:04:07] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2025-06-06 06:04:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:08] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:08] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:08] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:08] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:08] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:08] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:08] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:08] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:08] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:09] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:09] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:09] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:09] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:09] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:09] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:09] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:09] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:10] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:10] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:10] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:10] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/238 variables, 124/168 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:11] [INFO ] Deduced a trap along path composed of 5 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:12] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:12] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:12] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:12] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:13] [INFO ] Deduced a trap along path composed of 5 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:13] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:15] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/238 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:16] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:16] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:16] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/238 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 15 (OVERLAPS) 0/238 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 179 constraints, problems are : Problem set: 0 solved, 113 unsolved in 11580 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 29/52 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:19] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:19] [INFO ] Deduced a trap composed of 24 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-06 06:04:19] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:19] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:19] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:19] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:19] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:19] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:19] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:19] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:20] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:20] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:20] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/238 variables, 124/189 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 113/302 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:21] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:21] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:21] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:21] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:21] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/307 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:22] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:22] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:24] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:24] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:25] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:26] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:26] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:28] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:30] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:30] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:30] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:30] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:31] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:46] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:47] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 238/238 variables, and 325 constraints, problems are : Problem set: 0 solved, 113 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 41615ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 41616ms
Starting structural reductions in LTL mode, iteration 1 : 124/128 places, 114/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41776 ms. Remains : 124/128 places, 114/118 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-12
Stuttering criterion allowed to conclude after 7321 steps with 124 reset in 16 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLFireability-12 finished in 42005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 118/118 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 127 transition count 103
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 113 transition count 103
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 28 place count 113 transition count 95
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 44 place count 105 transition count 95
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 48 place count 101 transition count 91
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 101 transition count 91
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 52 place count 101 transition count 89
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 99 transition count 89
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 120 place count 67 transition count 57
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 65 transition count 55
Applied a total of 122 rules in 16 ms. Remains 65 /128 variables (removed 63) and now considering 55/118 (removed 63) transitions.
// Phase 1: matrix 55 rows 65 cols
[2025-06-06 06:04:49] [INFO ] Computed 23 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:04:49] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-06 06:04:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:04:49] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 06:04:49] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2025-06-06 06:04:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 2/65 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:50] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:50] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 55/120 variables, 65/90 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 90 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1074 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 2/65 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 55/120 variables, 65/90 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 51/141 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:51] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:51] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:51] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:51] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:51] [INFO ] Deduced a trap along path composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 146 constraints, problems are : Problem set: 0 solved, 51 unsolved in 2105 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3183ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 3184ms
Starting structural reductions in SI_LTL mode, iteration 1 : 65/128 places, 55/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3304 ms. Remains : 65/128 places, 55/118 transitions.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-13
Product exploration explored 100000 steps with 8293 reset in 122 ms.
Product exploration explored 100000 steps with 8175 reset in 137 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 371 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 49 steps (0 resets) in 7 ms. (6 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 488 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 55/55 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2025-06-06 06:04:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:04:54] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-06 06:04:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:04:54] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 06:04:54] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2025-06-06 06:04:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 2/65 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:54] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:54] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 55/120 variables, 65/90 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 90 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1116 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 2/65 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 55/120 variables, 65/90 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 51/141 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:55] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:55] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:55] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:55] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:04:56] [INFO ] Deduced a trap along path composed of 9 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 146 constraints, problems are : Problem set: 0 solved, 51 unsolved in 2103 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3227ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 3227ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3329 ms. Remains : 65/65 places, 55/55 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 367 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 76 steps (0 resets) in 4 ms. (15 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 449 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8272 reset in 131 ms.
Product exploration explored 100000 steps with 8302 reset in 143 ms.
Built C files in :
/tmp/ltsmin1334312863952820941
[2025-06-06 06:04:58] [INFO ] Computing symmetric may disable matrix : 55 transitions.
[2025-06-06 06:04:58] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 06:04:58] [INFO ] Computing symmetric may enable matrix : 55 transitions.
[2025-06-06 06:04:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 06:04:58] [INFO ] Computing Do-Not-Accords matrix : 55 transitions.
[2025-06-06 06:04:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 06:04:58] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1334312863952820941
Running compilation step : cd /tmp/ltsmin1334312863952820941;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 143 ms.
Running link step : cd /tmp/ltsmin1334312863952820941;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1334312863952820941;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3146842789919805771.hoa' '--buchi-type=spotba'
LTSmin run took 12048 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-002B-LTLFireability-13 finished in 21458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&F(p1)))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 118/118 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 128 transition count 104
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 114 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 113 transition count 103
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 30 place count 113 transition count 93
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 50 place count 103 transition count 93
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 54 place count 99 transition count 89
Iterating global reduction 3 with 4 rules applied. Total rules applied 58 place count 99 transition count 89
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 58 place count 99 transition count 87
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 62 place count 97 transition count 87
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 128 place count 64 transition count 54
Applied a total of 128 rules in 17 ms. Remains 64 /128 variables (removed 64) and now considering 54/118 (removed 64) transitions.
// Phase 1: matrix 54 rows 64 cols
[2025-06-06 06:05:11] [INFO ] Computed 23 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:05:11] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-06 06:05:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:05:11] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 06:05:11] [INFO ] Redundant transitions in 0 ms returned []
Running 53 sub problems to find dead transitions.
[2025-06-06 06:05:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:05:11] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:05:11] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:05:11] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 54/118 variables, 64/90 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 0/118 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 90 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1052 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 54/118 variables, 64/90 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 53/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:05:12] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:05:12] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:05:13] [INFO ] Deduced a trap along path composed of 2 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:05:13] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:05:15] [INFO ] Deduced a trap along path composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/118 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 0/118 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 148 constraints, problems are : Problem set: 0 solved, 53 unsolved in 10495 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 11551ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 11552ms
Starting structural reductions in SI_LTL mode, iteration 1 : 64/128 places, 54/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11687 ms. Remains : 64/128 places, 54/118 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-14
Stuttering criterion allowed to conclude after 110 steps with 0 reset in 2 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLFireability-14 finished in 11829 ms.
All properties solved by simple procedures.
Total runtime 727715 ms.

BK_STOP 1749189922904

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLFireability -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="ShieldPPPs-PT-002B"
export BK_EXAMINATION="LTLFireability"
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 ShieldPPPs-PT-002B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r198-tall-174894533100628"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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