fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r003-smll-171620116800034
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for ASLink-PT-02b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12362.979 3600000.00 13905743.00 975.00 ?TFF?????F?F?FT? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r003-smll-171620116800034.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is ASLink-PT-02b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620116800034
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 417K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-02b-CTLFireability-2024-00
FORMULA_NAME ASLink-PT-02b-CTLFireability-2024-01
FORMULA_NAME ASLink-PT-02b-CTLFireability-2024-02
FORMULA_NAME ASLink-PT-02b-CTLFireability-2024-03
FORMULA_NAME ASLink-PT-02b-CTLFireability-2024-04
FORMULA_NAME ASLink-PT-02b-CTLFireability-2024-05
FORMULA_NAME ASLink-PT-02b-CTLFireability-2024-06
FORMULA_NAME ASLink-PT-02b-CTLFireability-2024-07
FORMULA_NAME ASLink-PT-02b-CTLFireability-2024-08
FORMULA_NAME ASLink-PT-02b-CTLFireability-2024-09
FORMULA_NAME ASLink-PT-02b-CTLFireability-2024-10
FORMULA_NAME ASLink-PT-02b-CTLFireability-2024-11
FORMULA_NAME ASLink-PT-02b-CTLFireability-2023-12
FORMULA_NAME ASLink-PT-02b-CTLFireability-2023-13
FORMULA_NAME ASLink-PT-02b-CTLFireability-2023-14
FORMULA_NAME ASLink-PT-02b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716229751272

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-20 18:29:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-20 18:29:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 18:29:13] [INFO ] Load time of PNML (sax parser for PT used): 262 ms
[2024-05-20 18:29:13] [INFO ] Transformed 1242 places.
[2024-05-20 18:29:13] [INFO ] Transformed 1621 transitions.
[2024-05-20 18:29:13] [INFO ] Found NUPN structural information;
[2024-05-20 18:29:13] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 471 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 113 ms.
Support contains 161 out of 1242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 1172 transition count 1551
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 1172 transition count 1551
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 141 place count 1172 transition count 1550
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 163 place count 1150 transition count 1523
Iterating global reduction 1 with 22 rules applied. Total rules applied 185 place count 1150 transition count 1523
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 193 place count 1150 transition count 1515
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 196 place count 1147 transition count 1512
Iterating global reduction 2 with 3 rules applied. Total rules applied 199 place count 1147 transition count 1512
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 200 place count 1146 transition count 1511
Iterating global reduction 2 with 1 rules applied. Total rules applied 201 place count 1146 transition count 1511
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 202 place count 1145 transition count 1510
Iterating global reduction 2 with 1 rules applied. Total rules applied 203 place count 1145 transition count 1510
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 204 place count 1144 transition count 1509
Iterating global reduction 2 with 1 rules applied. Total rules applied 205 place count 1144 transition count 1509
Applied a total of 205 rules in 789 ms. Remains 1144 /1242 variables (removed 98) and now considering 1509/1621 (removed 112) transitions.
// Phase 1: matrix 1509 rows 1144 cols
[2024-05-20 18:29:14] [INFO ] Computed 121 invariants in 104 ms
[2024-05-20 18:29:15] [INFO ] Implicit Places using invariants in 1315 ms returned [978, 989, 1000, 1008, 1016, 1024, 1032, 1043, 1051, 1059, 1070]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 1381 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1133/1242 places, 1509/1621 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1122 transition count 1498
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1122 transition count 1498
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 1114 transition count 1490
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 1114 transition count 1490
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 1109 transition count 1485
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 1109 transition count 1485
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 1106 transition count 1482
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 1106 transition count 1482
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 1104 transition count 1480
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 1104 transition count 1480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 1102 transition count 1478
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 1102 transition count 1478
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1101 transition count 1477
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1101 transition count 1477
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1100 transition count 1476
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1100 transition count 1476
Applied a total of 66 rules in 753 ms. Remains 1100 /1133 variables (removed 33) and now considering 1476/1509 (removed 33) transitions.
// Phase 1: matrix 1476 rows 1100 cols
[2024-05-20 18:29:16] [INFO ] Computed 110 invariants in 51 ms
[2024-05-20 18:29:17] [INFO ] Implicit Places using invariants in 742 ms returned []
[2024-05-20 18:29:17] [INFO ] Invariant cache hit.
[2024-05-20 18:29:22] [INFO ] Implicit Places using invariants and state equation in 5158 ms returned []
Implicit Place search using SMT with State Equation took 5909 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1100/1242 places, 1476/1621 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8862 ms. Remains : 1100/1242 places, 1476/1621 transitions.
Support contains 161 out of 1100 places after structural reductions.
[2024-05-20 18:29:23] [INFO ] Flatten gal took : 211 ms
[2024-05-20 18:29:23] [INFO ] Flatten gal took : 135 ms
[2024-05-20 18:29:23] [INFO ] Input system was already deterministic with 1476 transitions.
Support contains 153 out of 1100 places (down from 161) after GAL structural reductions.
RANDOM walk for 40000 steps (162 resets) in 2842 ms. (14 steps per ms) remains 36/85 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
[2024-05-20 18:29:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 204/286 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 70/356 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 5 (OVERLAPS) 730/1086 variables, 78/105 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1086 variables, 0/105 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 14/1100 variables, 5/110 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1100 variables, 0/110 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 1476/2576 variables, 1100/1210 constraints. Problems are: Problem set: 2 solved, 34 unsolved
[2024-05-20 18:29:30] [INFO ] Deduced a trap composed of 165 places in 852 ms of which 102 ms to minimize.
SMT process timed out in 5160ms, After SMT, problems are : Problem set: 2 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 65 out of 1100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1100/1100 places, 1476/1476 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 172 transitions
Trivial Post-agglo rules discarded 172 transitions
Performed 172 trivial Post agglomeration. Transition count delta: 172
Iterating post reduction 0 with 172 rules applied. Total rules applied 172 place count 1100 transition count 1304
Reduce places removed 172 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 177 rules applied. Total rules applied 349 place count 928 transition count 1299
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 354 place count 925 transition count 1297
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 356 place count 923 transition count 1297
Performed 264 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 264 Pre rules applied. Total rules applied 356 place count 923 transition count 1033
Deduced a syphon composed of 264 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 288 places and 0 transitions.
Iterating global reduction 4 with 552 rules applied. Total rules applied 908 place count 635 transition count 1033
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 4 with 14 rules applied. Total rules applied 922 place count 633 transition count 1021
Reduce places removed 12 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 5 with 17 rules applied. Total rules applied 939 place count 621 transition count 1016
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 944 place count 616 transition count 1016
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 944 place count 616 transition count 1007
Deduced a syphon composed of 9 places in 3 ms
Ensure Unique test removed 9 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 27 rules applied. Total rules applied 971 place count 598 transition count 1007
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 8 Pre rules applied. Total rules applied 971 place count 598 transition count 999
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 987 place count 590 transition count 999
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 993 place count 584 transition count 985
Iterating global reduction 7 with 6 rules applied. Total rules applied 999 place count 584 transition count 985
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 999 place count 584 transition count 983
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1003 place count 582 transition count 983
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1005 place count 580 transition count 981
Iterating global reduction 7 with 2 rules applied. Total rules applied 1007 place count 580 transition count 981
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1008 place count 579 transition count 980
Iterating global reduction 7 with 1 rules applied. Total rules applied 1009 place count 579 transition count 980
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1010 place count 578 transition count 979
Iterating global reduction 7 with 1 rules applied. Total rules applied 1011 place count 578 transition count 979
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1012 place count 577 transition count 978
Iterating global reduction 7 with 1 rules applied. Total rules applied 1013 place count 577 transition count 978
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 7 with 165 rules applied. Total rules applied 1178 place count 494 transition count 896
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1183 place count 489 transition count 891
Ensure Unique test removed 1 places
Iterating global reduction 7 with 6 rules applied. Total rules applied 1189 place count 488 transition count 891
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1189 place count 488 transition count 890
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1191 place count 487 transition count 890
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1193 place count 485 transition count 888
Iterating global reduction 7 with 2 rules applied. Total rules applied 1195 place count 485 transition count 888
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 1197 place count 485 transition count 886
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1198 place count 484 transition count 886
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1200 place count 483 transition count 891
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 1203 place count 483 transition count 888
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1206 place count 480 transition count 888
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1207 place count 480 transition count 888
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1208 place count 479 transition count 887
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 4 rules applied. Total rules applied 1212 place count 476 transition count 886
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1213 place count 475 transition count 886
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 4 Pre rules applied. Total rules applied 1213 place count 475 transition count 882
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 1221 place count 471 transition count 882
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 12 with 1 rules applied. Total rules applied 1222 place count 470 transition count 882
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 1228 place count 467 transition count 879
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1229 place count 466 transition count 878
Iterating global reduction 13 with 1 rules applied. Total rules applied 1230 place count 466 transition count 878
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1231 place count 466 transition count 877
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1232 place count 465 transition count 877
Applied a total of 1232 rules in 607 ms. Remains 465 /1100 variables (removed 635) and now considering 877/1476 (removed 599) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 607 ms. Remains : 465/1100 places, 877/1476 transitions.
RANDOM walk for 40000 steps (499 resets) in 1108 ms. (36 steps per ms) remains 32/34 properties
BEST_FIRST walk for 4003 steps (13 resets) in 36 ms. (108 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (14 resets) in 25 ms. (153 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (16 resets) in 46 ms. (85 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (13 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (14 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (14 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (14 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (12 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (17 resets) in 32 ms. (121 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (14 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (13 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (16 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (13 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (13 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (13 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (13 resets) in 26 ms. (148 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (14 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (15 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (13 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (13 resets) in 21 ms. (182 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (16 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (15 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (18 resets) in 19 ms. (200 steps per ms) remains 30/32 properties
BEST_FIRST walk for 4002 steps (11 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (15 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (14 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (13 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (13 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (14 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (16 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
// Phase 1: matrix 877 rows 465 cols
[2024-05-20 18:29:31] [INFO ] Computed 69 invariants in 9 ms
[2024-05-20 18:29:31] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 97/153 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 26/179 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 270/449 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 11/460 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 5/465 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 877/1342 variables, 465/534 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1342 variables, 2/536 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1342 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 14 (OVERLAPS) 0/1342 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1342/1342 variables, and 536 constraints, problems are : Problem set: 0 solved, 30 unsolved in 4417 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 465/465 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 97/153 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 26/179 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 270/449 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-20 18:29:36] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 4 ms to minimize.
[2024-05-20 18:29:36] [INFO ] Deduced a trap composed of 27 places in 196 ms of which 3 ms to minimize.
[2024-05-20 18:29:37] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 2 ms to minimize.
[2024-05-20 18:29:37] [INFO ] Deduced a trap composed of 47 places in 228 ms of which 4 ms to minimize.
[2024-05-20 18:29:37] [INFO ] Deduced a trap composed of 64 places in 214 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-20 18:29:38] [INFO ] Deduced a trap composed of 27 places in 190 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 11/460 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-20 18:29:39] [INFO ] Deduced a trap composed of 61 places in 355 ms of which 4 ms to minimize.
[2024-05-20 18:29:40] [INFO ] Deduced a trap composed of 77 places in 372 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (OVERLAPS) 5/465 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/465 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp79 is UNSAT
At refinement iteration 14 (OVERLAPS) 877/1342 variables, 465/542 constraints. Problems are: Problem set: 23 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1342 variables, 2/544 constraints. Problems are: Problem set: 23 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1342 variables, 7/551 constraints. Problems are: Problem set: 23 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1342 variables, 0/551 constraints. Problems are: Problem set: 23 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/1342 variables, 0/551 constraints. Problems are: Problem set: 23 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1342/1342 variables, and 551 constraints, problems are : Problem set: 23 solved, 7 unsolved in 9587 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 465/465 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 7/30 constraints, Known Traps: 8/8 constraints]
After SMT, in 14087ms problems are : Problem set: 23 solved, 7 unsolved
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 2 properties in 15888 ms.
Support contains 9 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 877/877 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 465 transition count 875
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 463 transition count 875
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 4 place count 463 transition count 836
Deduced a syphon composed of 39 places in 2 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 82 place count 424 transition count 836
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 422 transition count 822
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 422 transition count 822
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 421 transition count 822
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 420 transition count 814
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 420 transition count 814
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 419 transition count 806
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 419 transition count 806
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 418 transition count 798
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 418 transition count 798
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 94 place count 417 transition count 790
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 417 transition count 790
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 416 transition count 782
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 416 transition count 782
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 415 transition count 774
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 415 transition count 774
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 414 transition count 766
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 414 transition count 766
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 413 transition count 758
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 413 transition count 758
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 412 transition count 750
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 412 transition count 750
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 411 transition count 742
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 411 transition count 742
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 108 place count 410 transition count 734
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 410 transition count 734
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 409 transition count 726
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 409 transition count 726
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 408 transition count 718
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 408 transition count 718
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 407 transition count 710
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 407 transition count 710
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 406 transition count 702
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 406 transition count 702
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 128 place count 400 transition count 697
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 130 place count 398 transition count 695
Iterating global reduction 3 with 2 rules applied. Total rules applied 132 place count 398 transition count 695
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 133 place count 398 transition count 694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 134 place count 397 transition count 694
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 135 place count 397 transition count 693
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 136 place count 396 transition count 693
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 137 place count 396 transition count 693
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 140 place count 393 transition count 690
Applied a total of 140 rules in 254 ms. Remains 393 /465 variables (removed 72) and now considering 690/877 (removed 187) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 254 ms. Remains : 393/465 places, 690/877 transitions.
RANDOM walk for 40000 steps (576 resets) in 234 ms. (170 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (162 resets) in 63 ms. (625 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (203 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (183 resets) in 72 ms. (548 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (179 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (147 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 376576 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :0 out of 5
Probabilistic random walk after 376576 steps, saw 73239 distinct states, run finished after 3007 ms. (steps per millisecond=125 ) properties seen :0
// Phase 1: matrix 690 rows 393 cols
[2024-05-20 18:30:04] [INFO ] Computed 67 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 101/117 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3/120 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 55/175 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 40/215 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 2/217 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 103/320 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/320 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 29/349 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/349 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 42/391 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/391 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1/392 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/392 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 1/393 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/393 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 690/1083 variables, 393/460 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1083 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 0/1083 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1083/1083 variables, and 460 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1532 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 101/117 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3/120 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 55/175 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 40/215 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 2/217 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 103/320 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/320 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 29/349 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-20 18:30:06] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/349 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/349 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 42/391 variables, 10/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/391 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 1/392 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/392 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 1/393 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/393 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 690/1083 variables, 393/461 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1083 variables, 5/466 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1083 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-20 18:30:08] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 2 ms to minimize.
At refinement iteration 27 (OVERLAPS) 0/1083 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1083 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (OVERLAPS) 0/1083 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1083/1083 variables, and 467 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2020 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 3571ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 7230 ms.
Support contains 9 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 690/690 transitions.
Applied a total of 0 rules in 14 ms. Remains 393 /393 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 393/393 places, 690/690 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 690/690 transitions.
Applied a total of 0 rules in 13 ms. Remains 393 /393 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-05-20 18:30:15] [INFO ] Invariant cache hit.
[2024-05-20 18:30:16] [INFO ] Implicit Places using invariants in 464 ms returned [19, 20, 23, 35, 52, 70, 165, 168, 185, 203, 272, 276, 277, 280, 291, 292, 293, 311, 332, 333, 334, 335]
[2024-05-20 18:30:16] [INFO ] Actually due to overlaps returned [311, 293, 52, 185, 35, 168, 291, 332, 165, 292, 333, 19, 276, 277, 70, 203, 334, 20, 23, 280, 335]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 467 ms to find 21 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 372/393 places, 690/690 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 371 transition count 658
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 38 rules applied. Total rules applied 71 place count 339 transition count 652
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 76 place count 334 transition count 652
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 76 place count 334 transition count 639
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 103 place count 320 transition count 639
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 115 place count 316 transition count 631
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 123 place count 308 transition count 631
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 126 place count 305 transition count 628
Iterating global reduction 5 with 3 rules applied. Total rules applied 129 place count 305 transition count 628
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 132 place count 305 transition count 625
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 172 place count 285 transition count 605
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 173 place count 284 transition count 604
Iterating global reduction 6 with 1 rules applied. Total rules applied 174 place count 284 transition count 604
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 175 place count 284 transition count 603
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 179 place count 282 transition count 604
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 187 place count 282 transition count 596
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 196 place count 273 transition count 596
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 202 place count 273 transition count 596
Applied a total of 202 rules in 92 ms. Remains 273 /372 variables (removed 99) and now considering 596/690 (removed 94) transitions.
// Phase 1: matrix 596 rows 273 cols
[2024-05-20 18:30:16] [INFO ] Computed 39 invariants in 6 ms
[2024-05-20 18:30:16] [INFO ] Implicit Places using invariants in 311 ms returned [108, 114, 124, 125, 182, 198, 204, 207, 209]
[2024-05-20 18:30:16] [INFO ] Actually due to overlaps returned [124, 125, 198, 204, 209, 108, 114, 182]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 315 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 265/393 places, 596/690 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 260 transition count 591
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 260 transition count 591
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 259 transition count 590
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 259 transition count 590
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 257 transition count 588
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 257 transition count 585
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 22 place count 254 transition count 585
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 254 transition count 584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 253 transition count 584
Applied a total of 24 rules in 45 ms. Remains 253 /265 variables (removed 12) and now considering 584/596 (removed 12) transitions.
// Phase 1: matrix 584 rows 253 cols
[2024-05-20 18:30:16] [INFO ] Computed 31 invariants in 5 ms
[2024-05-20 18:30:16] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-20 18:30:17] [INFO ] Invariant cache hit.
[2024-05-20 18:30:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-20 18:30:17] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 1013 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 253/393 places, 584/690 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1946 ms. Remains : 253/393 places, 584/690 transitions.
RANDOM walk for 40000 steps (816 resets) in 165 ms. (240 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (187 resets) in 62 ms. (634 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (256 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (267 resets) in 115 ms. (344 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (265 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (185 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 431967 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :2 out of 5
Probabilistic random walk after 431967 steps, saw 113016 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :2
[2024-05-20 18:30:21] [INFO ] Invariant cache hit.
[2024-05-20 18:30:21] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 27/32 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 136/168 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 48/216 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 35/251 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 583/834 variables, 251/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/834 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/834 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/837 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/837 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/837 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/837 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 837/837 variables, and 286 constraints, problems are : Problem set: 0 solved, 3 unsolved in 657 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 253/253 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 27/32 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 136/168 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 48/216 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 35/251 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 583/834 variables, 251/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/834 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/834 variables, 3/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/834 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/837 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/837 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/837 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/837 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 837/837 variables, and 289 constraints, problems are : Problem set: 0 solved, 3 unsolved in 604 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 253/253 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1270ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1389 ms.
Support contains 5 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 584/584 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 253 transition count 583
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 251 transition count 583
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 3 place count 251 transition count 582
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 250 transition count 582
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 249 transition count 582
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 6 place count 249 transition count 581
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 248 transition count 581
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 245 transition count 578
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 245 transition count 577
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 244 transition count 576
Applied a total of 16 rules in 34 ms. Remains 244 /253 variables (removed 9) and now considering 576/584 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 244/253 places, 576/584 transitions.
RANDOM walk for 40000 steps (903 resets) in 167 ms. (238 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (227 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (299 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (311 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 648036 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :2 out of 3
Probabilistic random walk after 648036 steps, saw 168472 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :2
// Phase 1: matrix 576 rows 244 cols
[2024-05-20 18:30:26] [INFO ] Computed 29 invariants in 9 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 105/121 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/142 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 65/207 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/230 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/244 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 576/820 variables, 244/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/820 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/820 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 820/820 variables, and 273 constraints, problems are : Problem set: 0 solved, 1 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 244/244 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 105/121 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/142 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 65/207 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/230 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/244 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 576/820 variables, 244/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/820 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/820 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/820 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 820/820 variables, and 274 constraints, problems are : Problem set: 0 solved, 1 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 244/244 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 679ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 2 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 576/576 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 244 transition count 575
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 243 transition count 575
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 243 transition count 573
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 241 transition count 573
Applied a total of 6 rules in 16 ms. Remains 241 /244 variables (removed 3) and now considering 573/576 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 241/244 places, 573/576 transitions.
RANDOM walk for 40000 steps (906 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (217 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 786427 steps, run timeout after 3001 ms. (steps per millisecond=262 ) properties seen :0 out of 1
Probabilistic random walk after 786427 steps, saw 207229 distinct states, run finished after 3001 ms. (steps per millisecond=262 ) properties seen :0
// Phase 1: matrix 573 rows 241 cols
[2024-05-20 18:30:30] [INFO ] Computed 29 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 96/119 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/153 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 53/206 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 22/228 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/241 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/241 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 573/814 variables, 241/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/814 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/814 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 814/814 variables, and 270 constraints, problems are : Problem set: 0 solved, 1 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 96/119 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/153 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 53/206 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 22/228 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/241 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/241 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 573/814 variables, 241/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/814 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/814 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/814 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 814/814 variables, and 271 constraints, problems are : Problem set: 0 solved, 1 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 718ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 573/573 transitions.
Applied a total of 0 rules in 9 ms. Remains 241 /241 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 241/241 places, 573/573 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 573/573 transitions.
Applied a total of 0 rules in 8 ms. Remains 241 /241 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2024-05-20 18:30:31] [INFO ] Invariant cache hit.
[2024-05-20 18:30:31] [INFO ] Implicit Places using invariants in 339 ms returned [1, 77, 108]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 340 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 238/241 places, 573/573 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 238 transition count 571
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 236 transition count 571
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 8 place count 234 transition count 569
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 234 transition count 568
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 233 transition count 568
Applied a total of 10 rules in 22 ms. Remains 233 /238 variables (removed 5) and now considering 568/573 (removed 5) transitions.
// Phase 1: matrix 568 rows 233 cols
[2024-05-20 18:30:31] [INFO ] Computed 26 invariants in 10 ms
[2024-05-20 18:30:32] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-20 18:30:32] [INFO ] Invariant cache hit.
[2024-05-20 18:30:32] [INFO ] Implicit Places using invariants and state equation in 653 ms returned []
Implicit Place search using SMT with State Equation took 989 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 233/241 places, 568/573 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1359 ms. Remains : 233/241 places, 568/573 transitions.
RANDOM walk for 40000 steps (900 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (231 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 760550 steps, run timeout after 3001 ms. (steps per millisecond=253 ) properties seen :0 out of 1
Probabilistic random walk after 760550 steps, saw 200338 distinct states, run finished after 3001 ms. (steps per millisecond=253 ) properties seen :0
[2024-05-20 18:30:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 87/90 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/110 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 88/198 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 22/220 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/233 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 568/801 variables, 233/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/801 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/801 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 801/801 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 381 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 87/90 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/110 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 88/198 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 22/220 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/233 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 568/801 variables, 233/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/801 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/801 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/801 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 801/801 variables, and 260 constraints, problems are : Problem set: 0 solved, 1 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 731ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 2 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 568/568 transitions.
Applied a total of 0 rules in 8 ms. Remains 233 /233 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 233/233 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 568/568 transitions.
Applied a total of 0 rules in 8 ms. Remains 233 /233 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-20 18:30:36] [INFO ] Invariant cache hit.
[2024-05-20 18:30:37] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-05-20 18:30:37] [INFO ] Invariant cache hit.
[2024-05-20 18:30:37] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 994 ms to find 0 implicit places.
[2024-05-20 18:30:37] [INFO ] Redundant transitions in 38 ms returned []
Running 550 sub problems to find dead transitions.
[2024-05-20 18:30:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 550 unsolved
[2024-05-20 18:30:44] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 2 ms to minimize.
[2024-05-20 18:30:44] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 4 (OVERLAPS) 2/233 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 550 unsolved
[2024-05-20 18:30:54] [INFO ] Deduced a trap composed of 82 places in 192 ms of which 3 ms to minimize.
[2024-05-20 18:30:55] [INFO ] Deduced a trap composed of 82 places in 191 ms of which 2 ms to minimize.
[2024-05-20 18:30:55] [INFO ] Deduced a trap composed of 81 places in 205 ms of which 3 ms to minimize.
[2024-05-20 18:30:57] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-05-20 18:30:57] [INFO ] Deduced a trap composed of 61 places in 175 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 550 unsolved
[2024-05-20 18:31:02] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 2 ms to minimize.
[2024-05-20 18:31:05] [INFO ] Deduced a trap composed of 54 places in 200 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 550 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 233/801 variables, and 35 constraints, problems are : Problem set: 0 solved, 550 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/233 constraints, PredecessorRefiner: 550/550 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 550 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 4 (OVERLAPS) 2/233 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 7/35 constraints. Problems are: Problem set: 0 solved, 550 unsolved
[2024-05-20 18:31:15] [INFO ] Deduced a trap composed of 77 places in 189 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 550 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 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 TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD189 is UNSAT
At refinement iteration 9 (OVERLAPS) 568/801 variables, 233/269 constraints. Problems are: Problem set: 134 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 801/801 variables, and 685 constraints, problems are : Problem set: 134 solved, 416 unsolved in 30123 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 416/550 constraints, Known Traps: 10/10 constraints]
After SMT, in 60607ms problems are : Problem set: 134 solved, 416 unsolved
Search for dead transitions found 134 dead transitions in 60619ms
Found 134 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 134 transitions
Dead transitions reduction (with SMT) removed 134 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 233/233 places, 434/568 transitions.
Applied a total of 0 rules in 6 ms. Remains 233 /233 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2024-05-20 18:31:38] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61690 ms. Remains : 233/233 places, 434/568 transitions.
Successfully simplified 25 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-02b-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-CTLFireability-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-20 18:31:38] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-20 18:31:38] [INFO ] Flatten gal took : 80 ms
[2024-05-20 18:31:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ASLink-PT-02b-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-20 18:31:38] [INFO ] Flatten gal took : 83 ms
[2024-05-20 18:31:38] [INFO ] Input system was already deterministic with 1476 transitions.
Support contains 58 out of 1100 places (down from 64) after GAL structural reductions.
Computed a total of 45 stabilizing places and 45 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1100/1100 places, 1476/1476 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1088 transition count 1451
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1088 transition count 1451
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1088 transition count 1450
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 33 place count 1080 transition count 1442
Iterating global reduction 1 with 8 rules applied. Total rules applied 41 place count 1080 transition count 1442
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 1075 transition count 1430
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 1075 transition count 1430
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 1071 transition count 1426
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 1071 transition count 1426
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 1069 transition count 1417
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 1069 transition count 1417
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 1067 transition count 1408
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 1067 transition count 1408
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 1065 transition count 1406
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 1065 transition count 1406
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 1064 transition count 1398
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 1064 transition count 1398
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 1063 transition count 1390
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 1063 transition count 1390
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 1062 transition count 1389
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 1062 transition count 1389
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 1061 transition count 1381
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 1061 transition count 1381
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 1060 transition count 1373
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 1060 transition count 1373
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 1059 transition count 1372
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 1059 transition count 1372
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 1058 transition count 1364
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 1058 transition count 1364
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 1057 transition count 1356
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 1057 transition count 1356
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 1056 transition count 1355
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 1056 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 1055 transition count 1347
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 1055 transition count 1347
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 1054 transition count 1339
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 1054 transition count 1339
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 1053 transition count 1338
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 1053 transition count 1338
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 1052 transition count 1330
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 1052 transition count 1330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 1051 transition count 1322
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 1051 transition count 1322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 1050 transition count 1321
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 1050 transition count 1321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 1049 transition count 1313
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 1049 transition count 1313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 1048 transition count 1305
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 1048 transition count 1305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 1047 transition count 1304
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 1047 transition count 1304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 108 place count 1046 transition count 1296
Iterating global reduction 1 with 1 rules applied. Total rules applied 109 place count 1046 transition count 1296
Applied a total of 109 rules in 939 ms. Remains 1046 /1100 variables (removed 54) and now considering 1296/1476 (removed 180) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 940 ms. Remains : 1046/1100 places, 1296/1476 transitions.
[2024-05-20 18:31:39] [INFO ] Flatten gal took : 48 ms
[2024-05-20 18:31:39] [INFO ] Flatten gal took : 54 ms
[2024-05-20 18:31:39] [INFO ] Input system was already deterministic with 1296 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1100/1100 places, 1476/1476 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1087 transition count 1450
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1087 transition count 1450
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1087 transition count 1449
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 36 place count 1078 transition count 1440
Iterating global reduction 1 with 9 rules applied. Total rules applied 45 place count 1078 transition count 1440
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 51 place count 1072 transition count 1427
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 1072 transition count 1427
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 1068 transition count 1423
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 1068 transition count 1423
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 1066 transition count 1414
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 1066 transition count 1414
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 1064 transition count 1405
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 1064 transition count 1405
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 1062 transition count 1403
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 1062 transition count 1403
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 1060 transition count 1394
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 1060 transition count 1394
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 1058 transition count 1385
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 1058 transition count 1385
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 1057 transition count 1384
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 1057 transition count 1384
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 1056 transition count 1376
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 1056 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 1055 transition count 1368
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 1055 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 1054 transition count 1367
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 1054 transition count 1367
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 1053 transition count 1359
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 1053 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 1052 transition count 1351
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 1052 transition count 1351
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 1051 transition count 1350
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 1051 transition count 1350
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 1050 transition count 1342
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 1050 transition count 1342
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 1049 transition count 1334
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 1049 transition count 1334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 1048 transition count 1333
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 1048 transition count 1333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 1047 transition count 1325
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 1047 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 108 place count 1046 transition count 1317
Iterating global reduction 1 with 1 rules applied. Total rules applied 109 place count 1046 transition count 1317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 1045 transition count 1316
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 1045 transition count 1316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 1044 transition count 1308
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 1044 transition count 1308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 1043 transition count 1300
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 1043 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 1042 transition count 1299
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 1042 transition count 1299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 1041 transition count 1291
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 1041 transition count 1291
Applied a total of 119 rules in 950 ms. Remains 1041 /1100 variables (removed 59) and now considering 1291/1476 (removed 185) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 950 ms. Remains : 1041/1100 places, 1291/1476 transitions.
[2024-05-20 18:31:41] [INFO ] Flatten gal took : 43 ms
[2024-05-20 18:31:41] [INFO ] Flatten gal took : 49 ms
[2024-05-20 18:31:41] [INFO ] Input system was already deterministic with 1291 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1100/1100 places, 1476/1476 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1088 transition count 1456
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1088 transition count 1456
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1088 transition count 1455
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 33 place count 1080 transition count 1447
Iterating global reduction 1 with 8 rules applied. Total rules applied 41 place count 1080 transition count 1447
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 1074 transition count 1434
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 1074 transition count 1434
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 57 place count 1070 transition count 1430
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 1070 transition count 1430
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 1068 transition count 1421
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 1068 transition count 1421
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 1066 transition count 1412
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 1066 transition count 1412
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 1064 transition count 1410
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 1064 transition count 1410
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 1062 transition count 1401
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 1062 transition count 1401
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 1060 transition count 1392
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 1060 transition count 1392
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 1059 transition count 1391
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 1059 transition count 1391
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 1058 transition count 1383
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 1058 transition count 1383
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 1057 transition count 1375
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 1057 transition count 1375
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 1056 transition count 1374
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 1056 transition count 1374
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 1055 transition count 1366
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 1055 transition count 1366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 1054 transition count 1358
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 1054 transition count 1358
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 1053 transition count 1357
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 1053 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 1052 transition count 1349
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 1052 transition count 1349
Applied a total of 97 rules in 662 ms. Remains 1052 /1100 variables (removed 48) and now considering 1349/1476 (removed 127) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 662 ms. Remains : 1052/1100 places, 1349/1476 transitions.
[2024-05-20 18:31:41] [INFO ] Flatten gal took : 44 ms
[2024-05-20 18:31:41] [INFO ] Flatten gal took : 53 ms
[2024-05-20 18:31:42] [INFO ] Input system was already deterministic with 1349 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1100/1100 places, 1476/1476 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1088 transition count 1451
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1088 transition count 1451
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1088 transition count 1450
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 33 place count 1080 transition count 1442
Iterating global reduction 1 with 8 rules applied. Total rules applied 41 place count 1080 transition count 1442
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 1075 transition count 1430
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 1075 transition count 1430
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 1071 transition count 1426
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 1071 transition count 1426
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1070 transition count 1425
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1070 transition count 1425
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1069 transition count 1424
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1069 transition count 1424
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1068 transition count 1423
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1068 transition count 1423
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1067 transition count 1422
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1067 transition count 1422
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1066 transition count 1421
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1066 transition count 1421
Applied a total of 69 rules in 356 ms. Remains 1066 /1100 variables (removed 34) and now considering 1421/1476 (removed 55) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 356 ms. Remains : 1066/1100 places, 1421/1476 transitions.
[2024-05-20 18:31:42] [INFO ] Flatten gal took : 44 ms
[2024-05-20 18:31:42] [INFO ] Flatten gal took : 52 ms
[2024-05-20 18:31:42] [INFO ] Input system was already deterministic with 1421 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1100/1100 places, 1476/1476 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 185 transitions
Trivial Post-agglo rules discarded 185 transitions
Performed 185 trivial Post agglomeration. Transition count delta: 185
Iterating post reduction 0 with 185 rules applied. Total rules applied 185 place count 1099 transition count 1290
Reduce places removed 185 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 188 rules applied. Total rules applied 373 place count 914 transition count 1287
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 7 rules applied. Total rules applied 380 place count 912 transition count 1282
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 385 place count 907 transition count 1282
Performed 293 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 293 Pre rules applied. Total rules applied 385 place count 907 transition count 989
Deduced a syphon composed of 293 places in 1 ms
Ensure Unique test removed 23 places
Reduce places removed 316 places and 0 transitions.
Iterating global reduction 4 with 609 rules applied. Total rules applied 994 place count 591 transition count 989
Discarding 2 places :
Implicit places reduction removed 2 places
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 4 with 17 rules applied. Total rules applied 1011 place count 589 transition count 974
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1026 place count 574 transition count 974
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 1026 place count 574 transition count 965
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 27 rules applied. Total rules applied 1053 place count 556 transition count 965
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 1053 place count 556 transition count 957
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1069 place count 548 transition count 957
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1078 place count 539 transition count 935
Iterating global reduction 6 with 9 rules applied. Total rules applied 1087 place count 539 transition count 935
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1087 place count 539 transition count 933
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1091 place count 537 transition count 933
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1096 place count 532 transition count 921
Iterating global reduction 6 with 5 rules applied. Total rules applied 1101 place count 532 transition count 921
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1103 place count 530 transition count 912
Iterating global reduction 6 with 2 rules applied. Total rules applied 1105 place count 530 transition count 912
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1107 place count 528 transition count 903
Iterating global reduction 6 with 2 rules applied. Total rules applied 1109 place count 528 transition count 903
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1111 place count 526 transition count 894
Iterating global reduction 6 with 2 rules applied. Total rules applied 1113 place count 526 transition count 894
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1114 place count 525 transition count 886
Iterating global reduction 6 with 1 rules applied. Total rules applied 1115 place count 525 transition count 886
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1116 place count 524 transition count 878
Iterating global reduction 6 with 1 rules applied. Total rules applied 1117 place count 524 transition count 878
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1118 place count 523 transition count 870
Iterating global reduction 6 with 1 rules applied. Total rules applied 1119 place count 523 transition count 870
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1120 place count 522 transition count 862
Iterating global reduction 6 with 1 rules applied. Total rules applied 1121 place count 522 transition count 862
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1122 place count 521 transition count 854
Iterating global reduction 6 with 1 rules applied. Total rules applied 1123 place count 521 transition count 854
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1124 place count 520 transition count 846
Iterating global reduction 6 with 1 rules applied. Total rules applied 1125 place count 520 transition count 846
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1126 place count 519 transition count 838
Iterating global reduction 6 with 1 rules applied. Total rules applied 1127 place count 519 transition count 838
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1128 place count 518 transition count 830
Iterating global reduction 6 with 1 rules applied. Total rules applied 1129 place count 518 transition count 830
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1130 place count 517 transition count 822
Iterating global reduction 6 with 1 rules applied. Total rules applied 1131 place count 517 transition count 822
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1132 place count 516 transition count 814
Iterating global reduction 6 with 1 rules applied. Total rules applied 1133 place count 516 transition count 814
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1134 place count 515 transition count 806
Iterating global reduction 6 with 1 rules applied. Total rules applied 1135 place count 515 transition count 806
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1136 place count 514 transition count 798
Iterating global reduction 6 with 1 rules applied. Total rules applied 1137 place count 514 transition count 798
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 6 with 142 rules applied. Total rules applied 1279 place count 442 transition count 728
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1283 place count 438 transition count 724
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 1288 place count 437 transition count 724
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 1289 place count 437 transition count 723
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1290 place count 436 transition count 723
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1290 place count 436 transition count 722
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1292 place count 435 transition count 722
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1294 place count 433 transition count 720
Iterating global reduction 8 with 2 rules applied. Total rules applied 1296 place count 433 transition count 720
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 1298 place count 433 transition count 718
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1299 place count 432 transition count 718
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1299 place count 432 transition count 717
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1301 place count 431 transition count 717
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1302 place count 431 transition count 717
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1304 place count 429 transition count 715
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 4 rules applied. Total rules applied 1308 place count 426 transition count 714
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1309 place count 425 transition count 714
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 7 Pre rules applied. Total rules applied 1309 place count 425 transition count 707
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 12 with 15 rules applied. Total rules applied 1324 place count 417 transition count 707
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 12 with 4 rules applied. Total rules applied 1328 place count 413 transition count 707
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 1328 place count 413 transition count 706
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1330 place count 412 transition count 706
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 1338 place count 408 transition count 702
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 1341 place count 405 transition count 699
Iterating global reduction 13 with 3 rules applied. Total rules applied 1344 place count 405 transition count 699
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1346 place count 403 transition count 697
Iterating global reduction 13 with 2 rules applied. Total rules applied 1348 place count 403 transition count 697
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 1350 place count 403 transition count 695
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 2 Pre rules applied. Total rules applied 1350 place count 403 transition count 693
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 1354 place count 401 transition count 693
Applied a total of 1354 rules in 440 ms. Remains 401 /1100 variables (removed 699) and now considering 693/1476 (removed 783) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 441 ms. Remains : 401/1100 places, 693/1476 transitions.
[2024-05-20 18:31:43] [INFO ] Flatten gal took : 25 ms
[2024-05-20 18:31:43] [INFO ] Flatten gal took : 28 ms
[2024-05-20 18:31:43] [INFO ] Input system was already deterministic with 693 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1100/1100 places, 1476/1476 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1087 transition count 1450
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1087 transition count 1450
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1087 transition count 1449
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 36 place count 1078 transition count 1440
Iterating global reduction 1 with 9 rules applied. Total rules applied 45 place count 1078 transition count 1440
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 51 place count 1072 transition count 1427
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 1072 transition count 1427
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 1068 transition count 1423
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 1068 transition count 1423
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 1066 transition count 1414
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 1066 transition count 1414
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 1064 transition count 1405
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 1064 transition count 1405
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 1062 transition count 1403
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 1062 transition count 1403
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 1060 transition count 1394
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 1060 transition count 1394
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 1058 transition count 1385
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 1058 transition count 1385
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 1057 transition count 1384
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 1057 transition count 1384
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 1056 transition count 1376
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 1056 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 1055 transition count 1368
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 1055 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 1054 transition count 1367
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 1054 transition count 1367
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 1053 transition count 1359
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 1053 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 1052 transition count 1351
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 1052 transition count 1351
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 1051 transition count 1350
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 1051 transition count 1350
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 1050 transition count 1342
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 1050 transition count 1342
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 1049 transition count 1334
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 1049 transition count 1334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 1048 transition count 1333
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 1048 transition count 1333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 1047 transition count 1325
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 1047 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 108 place count 1046 transition count 1317
Iterating global reduction 1 with 1 rules applied. Total rules applied 109 place count 1046 transition count 1317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 1045 transition count 1316
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 1045 transition count 1316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 1044 transition count 1308
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 1044 transition count 1308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 1043 transition count 1300
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 1043 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 1042 transition count 1299
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 1042 transition count 1299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 1041 transition count 1291
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 1041 transition count 1291
Applied a total of 119 rules in 975 ms. Remains 1041 /1100 variables (removed 59) and now considering 1291/1476 (removed 185) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 976 ms. Remains : 1041/1100 places, 1291/1476 transitions.
[2024-05-20 18:31:44] [INFO ] Flatten gal took : 39 ms
[2024-05-20 18:31:44] [INFO ] Flatten gal took : 46 ms
[2024-05-20 18:31:44] [INFO ] Input system was already deterministic with 1291 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1100/1100 places, 1476/1476 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 0 with 190 rules applied. Total rules applied 190 place count 1099 transition count 1285
Reduce places removed 190 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 195 rules applied. Total rules applied 385 place count 909 transition count 1280
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 389 place count 906 transition count 1279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 390 place count 905 transition count 1279
Performed 292 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 292 Pre rules applied. Total rules applied 390 place count 905 transition count 987
Deduced a syphon composed of 292 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 316 places and 0 transitions.
Iterating global reduction 4 with 608 rules applied. Total rules applied 998 place count 589 transition count 987
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 4 with 18 rules applied. Total rules applied 1016 place count 587 transition count 971
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 1032 place count 571 transition count 971
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 1032 place count 571 transition count 962
Deduced a syphon composed of 9 places in 2 ms
Ensure Unique test removed 9 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 27 rules applied. Total rules applied 1059 place count 553 transition count 962
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 1059 place count 553 transition count 954
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1075 place count 545 transition count 954
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1084 place count 536 transition count 932
Iterating global reduction 6 with 9 rules applied. Total rules applied 1093 place count 536 transition count 932
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1093 place count 536 transition count 930
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1097 place count 534 transition count 930
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1102 place count 529 transition count 918
Iterating global reduction 6 with 5 rules applied. Total rules applied 1107 place count 529 transition count 918
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1109 place count 527 transition count 909
Iterating global reduction 6 with 2 rules applied. Total rules applied 1111 place count 527 transition count 909
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1113 place count 525 transition count 900
Iterating global reduction 6 with 2 rules applied. Total rules applied 1115 place count 525 transition count 900
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1117 place count 523 transition count 891
Iterating global reduction 6 with 2 rules applied. Total rules applied 1119 place count 523 transition count 891
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1120 place count 522 transition count 883
Iterating global reduction 6 with 1 rules applied. Total rules applied 1121 place count 522 transition count 883
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1122 place count 521 transition count 875
Iterating global reduction 6 with 1 rules applied. Total rules applied 1123 place count 521 transition count 875
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1124 place count 520 transition count 867
Iterating global reduction 6 with 1 rules applied. Total rules applied 1125 place count 520 transition count 867
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1126 place count 519 transition count 859
Iterating global reduction 6 with 1 rules applied. Total rules applied 1127 place count 519 transition count 859
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1128 place count 518 transition count 851
Iterating global reduction 6 with 1 rules applied. Total rules applied 1129 place count 518 transition count 851
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1130 place count 517 transition count 843
Iterating global reduction 6 with 1 rules applied. Total rules applied 1131 place count 517 transition count 843
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1132 place count 516 transition count 835
Iterating global reduction 6 with 1 rules applied. Total rules applied 1133 place count 516 transition count 835
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1134 place count 515 transition count 827
Iterating global reduction 6 with 1 rules applied. Total rules applied 1135 place count 515 transition count 827
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1136 place count 514 transition count 819
Iterating global reduction 6 with 1 rules applied. Total rules applied 1137 place count 514 transition count 819
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1138 place count 513 transition count 811
Iterating global reduction 6 with 1 rules applied. Total rules applied 1139 place count 513 transition count 811
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1140 place count 512 transition count 803
Iterating global reduction 6 with 1 rules applied. Total rules applied 1141 place count 512 transition count 803
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1142 place count 511 transition count 795
Iterating global reduction 6 with 1 rules applied. Total rules applied 1143 place count 511 transition count 795
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 6 with 138 rules applied. Total rules applied 1281 place count 441 transition count 727
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1284 place count 438 transition count 724
Iterating global reduction 6 with 3 rules applied. Total rules applied 1287 place count 438 transition count 724
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 1288 place count 438 transition count 723
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1289 place count 437 transition count 723
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1289 place count 437 transition count 722
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1291 place count 436 transition count 722
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1292 place count 435 transition count 721
Iterating global reduction 8 with 1 rules applied. Total rules applied 1293 place count 435 transition count 721
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1295 place count 433 transition count 719
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 6 rules applied. Total rules applied 1301 place count 429 transition count 717
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1303 place count 427 transition count 717
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 8 Pre rules applied. Total rules applied 1303 place count 427 transition count 709
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 10 with 17 rules applied. Total rules applied 1320 place count 418 transition count 709
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 10 with 5 rules applied. Total rules applied 1325 place count 413 transition count 709
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 1325 place count 413 transition count 708
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1327 place count 412 transition count 708
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 1337 place count 407 transition count 703
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1341 place count 403 transition count 699
Iterating global reduction 11 with 4 rules applied. Total rules applied 1345 place count 403 transition count 699
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 1347 place count 401 transition count 697
Iterating global reduction 11 with 2 rules applied. Total rules applied 1349 place count 401 transition count 697
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1351 place count 401 transition count 695
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 2 Pre rules applied. Total rules applied 1351 place count 401 transition count 693
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 1355 place count 399 transition count 693
Applied a total of 1355 rules in 381 ms. Remains 399 /1100 variables (removed 701) and now considering 693/1476 (removed 783) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 382 ms. Remains : 399/1100 places, 693/1476 transitions.
[2024-05-20 18:31:44] [INFO ] Flatten gal took : 24 ms
[2024-05-20 18:31:44] [INFO ] Flatten gal took : 27 ms
[2024-05-20 18:31:44] [INFO ] Input system was already deterministic with 693 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1100/1100 places, 1476/1476 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1087 transition count 1450
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1087 transition count 1450
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1087 transition count 1449
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 36 place count 1078 transition count 1440
Iterating global reduction 1 with 9 rules applied. Total rules applied 45 place count 1078 transition count 1440
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 50 place count 1073 transition count 1435
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 1073 transition count 1435
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 1070 transition count 1432
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 1070 transition count 1432
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1069 transition count 1431
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1069 transition count 1431
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1068 transition count 1430
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1068 transition count 1430
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1067 transition count 1429
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1067 transition count 1429
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1066 transition count 1428
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1066 transition count 1428
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 1065 transition count 1427
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 1065 transition count 1427
Applied a total of 71 rules in 344 ms. Remains 1065 /1100 variables (removed 35) and now considering 1427/1476 (removed 49) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 344 ms. Remains : 1065/1100 places, 1427/1476 transitions.
[2024-05-20 18:31:45] [INFO ] Flatten gal took : 43 ms
[2024-05-20 18:31:45] [INFO ] Flatten gal took : 53 ms
[2024-05-20 18:31:45] [INFO ] Input system was already deterministic with 1427 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1100/1100 places, 1476/1476 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1088 transition count 1451
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1088 transition count 1451
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1088 transition count 1450
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 32 place count 1081 transition count 1443
Iterating global reduction 1 with 7 rules applied. Total rules applied 39 place count 1081 transition count 1443
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 1077 transition count 1439
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 1077 transition count 1439
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 1074 transition count 1436
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 1074 transition count 1436
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1073 transition count 1435
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1073 transition count 1435
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1072 transition count 1434
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1072 transition count 1434
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1071 transition count 1433
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1071 transition count 1433
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1070 transition count 1432
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1070 transition count 1432
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1069 transition count 1431
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1069 transition count 1431
Applied a total of 63 rules in 345 ms. Remains 1069 /1100 variables (removed 31) and now considering 1431/1476 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 346 ms. Remains : 1069/1100 places, 1431/1476 transitions.
[2024-05-20 18:31:45] [INFO ] Flatten gal took : 36 ms
[2024-05-20 18:31:45] [INFO ] Flatten gal took : 39 ms
[2024-05-20 18:31:45] [INFO ] Input system was already deterministic with 1431 transitions.
[2024-05-20 18:31:46] [INFO ] Flatten gal took : 39 ms
[2024-05-20 18:31:46] [INFO ] Flatten gal took : 41 ms
[2024-05-20 18:31:46] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-05-20 18:31:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1100 places, 1476 transitions and 4693 arcs took 11 ms.
Total runtime 153067 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ASLink-PT-02b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1100
TRANSITIONS: 1476
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.042s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.006s, Sys 0.002s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 719
MODEL NAME: /home/mcc/execution/412/model
1100 places, 1476 transitions.

No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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="ASLink-PT-02b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is ASLink-PT-02b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r003-smll-171620116800034"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02b.tgz
mv ASLink-PT-02b execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;