About the Execution of ITS-Tools for StigmergyElection-PT-07a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 212118.00 | 0.00 | 0.00 | FTTTFFFFFTFFFTFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r226-smll-174903491000241.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is StigmergyElection-PT-07a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903491000241
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.8M May 29 14:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2023-12
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2023-13
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2023-14
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2023-15
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2025-00
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2025-01
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2025-02
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2025-03
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2025-04
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2025-05
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2025-06
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2025-07
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2025-08
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2025-09
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2025-10
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2025-11
=== Now, execution of the tool begins
BK_START 1749154169249
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-07a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-05 20:09:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 20:09:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 20:09:32] [INFO ] Load time of PNML (sax parser for PT used): 486 ms
[2025-06-05 20:09:32] [INFO ] Transformed 100 places.
[2025-06-05 20:09:32] [INFO ] Transformed 2618 transitions.
[2025-06-05 20:09:32] [INFO ] Found NUPN structural information;
[2025-06-05 20:09:32] [INFO ] Parsed PT model containing 100 places and 2618 transitions and 34799 arcs in 776 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 27 ms.
Ensure Unique test removed 2229 transitions
Reduce redundant transitions removed 2229 transitions.
FORMULA StigmergyElection-PT-07a-CTLCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 64 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 389/389 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 97 transition count 385
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 97 transition count 385
Applied a total of 6 rules in 32 ms. Remains 97 /100 variables (removed 3) and now considering 385/389 (removed 4) transitions.
[2025-06-05 20:09:32] [INFO ] Flow matrix only has 367 transitions (discarded 18 similar events)
// Phase 1: matrix 367 rows 97 cols
[2025-06-05 20:09:32] [INFO ] Computed 6 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:09:32] [INFO ] Implicit Places using invariants in 351 ms returned []
[2025-06-05 20:09:32] [INFO ] Flow matrix only has 367 transitions (discarded 18 similar events)
[2025-06-05 20:09:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:09:33] [INFO ] State equation strengthened by 288 read => feed constraints.
[2025-06-05 20:09:33] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
Running 384 sub problems to find dead transitions.
[2025-06-05 20:09:33] [INFO ] Flow matrix only has 367 transitions (discarded 18 similar events)
[2025-06-05 20:09:33] [INFO ] Invariant cache hit.
[2025-06-05 20:09:33] [INFO ] State equation strengthened by 288 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:39] [INFO ] Deduced a trap composed of 12 places in 202 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:39] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:39] [INFO ] Deduced a trap composed of 12 places in 202 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:39] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:39] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:40] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:40] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:40] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:40] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:40] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:40] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:40] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:40] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:40] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:41] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:41] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:41] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:41] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:41] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:41] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:42] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:42] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:42] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:42] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:42] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:42] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:42] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:42] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:42] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:42] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:42] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:42] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:43] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:43] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:43] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:43] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:43] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:43] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:43] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:43] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:44] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:45] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:45] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:45] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:45] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:45] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:45] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:45] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:45] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:45] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:45] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:46] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:46] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:46] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:46] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:46] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:46] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:46] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:46] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:46] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:47] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:47] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:47] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:47] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:47] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:47] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:47] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:47] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:48] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:48] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:48] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:49] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 12/78 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:49] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:49] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:49] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:49] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:50] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:50] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:50] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:50] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:50] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:50] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:50] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:51] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:51] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 13/91 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:53] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:54] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:55] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:09:55] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 10 (OVERLAPS) 366/463 variables, 97/192 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/463 variables, 287/479 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:10:04] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:10:04] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:10:04] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:10:04] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/464 variables, and 483 constraints, problems are : Problem set: 0 solved, 384 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 97/97 constraints, ReadFeed: 287/288 constraints, PredecessorRefiner: 384/122 constraints, Known Traps: 93/93 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 93/99 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:10:07] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:10:10] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:10:10] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:10:13] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:10:15] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:10:16] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:10:16] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 8 (OVERLAPS) 366/463 variables, 97/203 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 287/490 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 122/612 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/464 variables, and 612 constraints, problems are : Problem set: 0 solved, 384 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 97/97 constraints, ReadFeed: 287/288 constraints, PredecessorRefiner: 384/122 constraints, Known Traps: 100/100 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61426ms problems are : Problem set: 0 solved, 384 unsolved
Search for dead transitions found 0 dead transitions in 61489ms
Starting structural reductions in LTL mode, iteration 1 : 97/100 places, 385/389 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62483 ms. Remains : 97/100 places, 385/389 transitions.
Support contains 64 out of 97 places after structural reductions.
[2025-06-05 20:10:35] [INFO ] Flatten gal took : 113 ms
[2025-06-05 20:10:35] [INFO ] Flatten gal took : 82 ms
[2025-06-05 20:10:35] [INFO ] Input system was already deterministic with 385 transitions.
Support contains 61 out of 97 places (down from 64) after GAL structural reductions.
FORMULA StigmergyElection-PT-07a-CTLCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (50 resets) in 3970 ms. (10 steps per ms) remains 3/53 properties
BEST_FIRST walk for 40003 steps (8 resets) in 293 ms. (136 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (10 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
[2025-06-05 20:10:37] [INFO ] Flow matrix only has 367 transitions (discarded 18 similar events)
[2025-06-05 20:10:37] [INFO ] Invariant cache hit.
[2025-06-05 20:10:37] [INFO ] State equation strengthened by 288 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp46 is UNSAT
At refinement iteration 1 (OVERLAPS) 76/83 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:10:38] [INFO ] Deduced a trap composed of 12 places in 583 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:10:38] [INFO ] Deduced a trap composed of 12 places in 413 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:10:38] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:10:39] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:10:39] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:10:39] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:10:39] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:10:39] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:10:39] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 3 ms to minimize.
Problem AtomicPropp31 is UNSAT
After SMT solving in domain Real declared 83/464 variables, and 13 constraints, problems are : Problem set: 3 solved, 0 unsolved in 2016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/6 constraints, State Equation: 0/97 constraints, ReadFeed: 0/288 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2034ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
[2025-06-05 20:10:39] [INFO ] Flatten gal took : 35 ms
[2025-06-05 20:10:39] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA StigmergyElection-PT-07a-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 20:10:39] [INFO ] Flatten gal took : 43 ms
[2025-06-05 20:10:39] [INFO ] Input system was already deterministic with 385 transitions.
Support contains 51 out of 97 places (down from 56) after GAL structural reductions.
Computed a total of 16 stabilizing places and 15 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 385/385 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 90 transition count 374
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 90 transition count 374
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 88 transition count 370
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 88 transition count 370
Applied a total of 18 rules in 14 ms. Remains 88 /97 variables (removed 9) and now considering 370/385 (removed 15) transitions.
[2025-06-05 20:10:39] [INFO ] Flow matrix only has 359 transitions (discarded 11 similar events)
// Phase 1: matrix 359 rows 88 cols
[2025-06-05 20:10:39] [INFO ] Computed 3 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:10:39] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-05 20:10:39] [INFO ] Flow matrix only has 359 transitions (discarded 11 similar events)
[2025-06-05 20:10:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:10:39] [INFO ] State equation strengthened by 288 read => feed constraints.
[2025-06-05 20:10:40] [INFO ] Implicit Places using invariants and state equation in 422 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 531 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 87/97 places, 370/385 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 80 transition count 363
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 80 transition count 363
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 75 transition count 358
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 75 transition count 358
Applied a total of 24 rules in 12 ms. Remains 75 /87 variables (removed 12) and now considering 358/370 (removed 12) transitions.
[2025-06-05 20:10:40] [INFO ] Flow matrix only has 347 transitions (discarded 11 similar events)
// Phase 1: matrix 347 rows 75 cols
[2025-06-05 20:10:40] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:10:40] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-06-05 20:10:40] [INFO ] Flow matrix only has 347 transitions (discarded 11 similar events)
[2025-06-05 20:10:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:10:40] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-05 20:10:40] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 75/97 places, 358/385 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 997 ms. Remains : 75/97 places, 358/385 transitions.
[2025-06-05 20:10:40] [INFO ] Flatten gal took : 44 ms
[2025-06-05 20:10:40] [INFO ] Flatten gal took : 46 ms
[2025-06-05 20:10:40] [INFO ] Input system was already deterministic with 358 transitions.
[2025-06-05 20:10:40] [INFO ] Flatten gal took : 29 ms
[2025-06-05 20:10:40] [INFO ] Flatten gal took : 22 ms
[2025-06-05 20:10:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality14602444076700014577.gal : 20 ms
[2025-06-05 20:10:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality15673255921318482639.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14602444076700014577.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15673255921318482639.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,96586,0.693044,19836,2,2613,5,32842,6,0,645,19142,0
Converting to forward existential form...Done !
original formula: (AX(((((p26==1)||((p41==1)&&(p43==1)))||((p23==1)||((p29==0)&&(p76==1)))) * ((p16==1) + AX((((p82==0)&&(p31==1))&&(p36==0)))))) + EF(AG((...165
=> equivalent forward existential formula: ([(EY((Init * !(E(TRUE U !(E(TRUE U !((p90==1)))))))) * !((((p26==1)||((p41==1)&&(p43==1)))||((p23==1)||((p29==0...304
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t8, t9, t10, t11, t12, t13, t15, t17, t18, t20, t22, t23, t25, t26, t...406
(forward)formula 0,0,2.99534,67708,1,0,477,156017,730,106,11110,106468,721
FORMULA StigmergyElection-PT-07a-CTLCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 385/385 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 87 transition count 368
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 87 transition count 368
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 81 transition count 356
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 81 transition count 356
Applied a total of 32 rules in 13 ms. Remains 81 /97 variables (removed 16) and now considering 356/385 (removed 29) transitions.
[2025-06-05 20:10:44] [INFO ] Flow matrix only has 347 transitions (discarded 9 similar events)
// Phase 1: matrix 347 rows 81 cols
[2025-06-05 20:10:44] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:10:44] [INFO ] Implicit Places using invariants in 286 ms returned []
[2025-06-05 20:10:44] [INFO ] Flow matrix only has 347 transitions (discarded 9 similar events)
[2025-06-05 20:10:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:10:44] [INFO ] State equation strengthened by 288 read => feed constraints.
[2025-06-05 20:10:45] [INFO ] Implicit Places using invariants and state equation in 1131 ms returned [80]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1428 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/97 places, 356/385 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 67 transition count 343
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 67 transition count 343
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 62 transition count 338
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 62 transition count 338
Applied a total of 36 rules in 11 ms. Remains 62 /80 variables (removed 18) and now considering 338/356 (removed 18) transitions.
[2025-06-05 20:10:45] [INFO ] Flow matrix only has 329 transitions (discarded 9 similar events)
// Phase 1: matrix 329 rows 62 cols
[2025-06-05 20:10:45] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:10:45] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-05 20:10:45] [INFO ] Flow matrix only has 329 transitions (discarded 9 similar events)
[2025-06-05 20:10:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:10:45] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-05 20:10:46] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 62/97 places, 338/385 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1966 ms. Remains : 62/97 places, 338/385 transitions.
[2025-06-05 20:10:46] [INFO ] Flatten gal took : 18 ms
[2025-06-05 20:10:46] [INFO ] Flatten gal took : 19 ms
[2025-06-05 20:10:46] [INFO ] Input system was already deterministic with 338 transitions.
[2025-06-05 20:10:46] [INFO ] Flatten gal took : 18 ms
[2025-06-05 20:10:46] [INFO ] Flatten gal took : 21 ms
[2025-06-05 20:10:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality15280838256267427325.gal : 15 ms
[2025-06-05 20:10:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality3384246276921345779.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15280838256267427325.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3384246276921345779.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,80329,0.873319,21688,2,2285,5,29104,6,0,575,18718,0
Converting to forward existential form...Done !
original formula: (EG(AX(FALSE)) * EF(((p28==0) * AG(EF(((p50==0)||(p55==1)))))))
=> equivalent forward existential formula: [((FwdU((Init * EG(!(EX(!(FALSE))))),TRUE) * (p28==0)) * !(E(TRUE U !(E(TRUE U ((p50==0)||(p55==1)))))))] != FAL...157
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33, t34,...333
(forward)formula 0,0,5.68573,117944,1,0,462,217183,695,100,10610,134934,737
FORMULA StigmergyElection-PT-07a-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 385/385 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 86 transition count 367
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 86 transition count 367
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 81 transition count 357
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 81 transition count 357
Applied a total of 32 rules in 14 ms. Remains 81 /97 variables (removed 16) and now considering 357/385 (removed 28) transitions.
[2025-06-05 20:10:51] [INFO ] Flow matrix only has 349 transitions (discarded 8 similar events)
// Phase 1: matrix 349 rows 81 cols
[2025-06-05 20:10:51] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:10:52] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-05 20:10:52] [INFO ] Flow matrix only has 349 transitions (discarded 8 similar events)
[2025-06-05 20:10:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:10:52] [INFO ] State equation strengthened by 288 read => feed constraints.
[2025-06-05 20:10:52] [INFO ] Implicit Places using invariants and state equation in 750 ms returned [80]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 876 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/97 places, 357/385 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 69 transition count 346
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 69 transition count 346
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 63 transition count 340
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 63 transition count 340
Applied a total of 34 rules in 10 ms. Remains 63 /80 variables (removed 17) and now considering 340/357 (removed 17) transitions.
[2025-06-05 20:10:52] [INFO ] Flow matrix only has 332 transitions (discarded 8 similar events)
// Phase 1: matrix 332 rows 63 cols
[2025-06-05 20:10:52] [INFO ] Computed 1 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:10:52] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-05 20:10:52] [INFO ] Flow matrix only has 332 transitions (discarded 8 similar events)
[2025-06-05 20:10:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:10:53] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-05 20:10:53] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 63/97 places, 340/385 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1170 ms. Remains : 63/97 places, 340/385 transitions.
[2025-06-05 20:10:53] [INFO ] Flatten gal took : 17 ms
[2025-06-05 20:10:53] [INFO ] Flatten gal took : 18 ms
[2025-06-05 20:10:53] [INFO ] Input system was already deterministic with 340 transitions.
[2025-06-05 20:10:53] [INFO ] Flatten gal took : 17 ms
[2025-06-05 20:10:53] [INFO ] Flatten gal took : 17 ms
[2025-06-05 20:10:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality17414917463303063120.gal : 4 ms
[2025-06-05 20:10:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality771137572048655062.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17414917463303063120.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality771137572048655062.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,90568,0.831999,21704,2,2529,5,36446,6,0,584,22677,0
Converting to forward existential form...Done !
original formula: AF(((AX((AX((p26==0)) * (p73==1))) * (p44==0)) * (p27==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((!(EX(!((!(EX(!((p26==0)))) * (p73==1))))) * (p44==0)) * (p27==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t10, t11, t13, t14, t16, t17, t18, t19, t20, t21, t23, t25, t26, t28,...388
(forward)formula 0,0,4.06988,80456,1,0,467,188013,695,89,10520,135675,705
FORMULA StigmergyElection-PT-07a-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 385/385 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 87 transition count 369
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 87 transition count 369
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 82 transition count 359
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 82 transition count 359
Applied a total of 30 rules in 7 ms. Remains 82 /97 variables (removed 15) and now considering 359/385 (removed 26) transitions.
[2025-06-05 20:10:57] [INFO ] Flow matrix only has 350 transitions (discarded 9 similar events)
// Phase 1: matrix 350 rows 82 cols
[2025-06-05 20:10:57] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:10:57] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-06-05 20:10:57] [INFO ] Flow matrix only has 350 transitions (discarded 9 similar events)
[2025-06-05 20:10:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:10:57] [INFO ] State equation strengthened by 288 read => feed constraints.
[2025-06-05 20:10:58] [INFO ] Implicit Places using invariants and state equation in 759 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 876 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/97 places, 359/385 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 68 transition count 346
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 68 transition count 346
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 61 transition count 339
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 61 transition count 339
Applied a total of 40 rules in 6 ms. Remains 61 /81 variables (removed 20) and now considering 339/359 (removed 20) transitions.
[2025-06-05 20:10:58] [INFO ] Flow matrix only has 330 transitions (discarded 9 similar events)
// Phase 1: matrix 330 rows 61 cols
[2025-06-05 20:10:58] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:10:58] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-05 20:10:58] [INFO ] Flow matrix only has 330 transitions (discarded 9 similar events)
[2025-06-05 20:10:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:10:58] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-05 20:10:58] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 61/97 places, 339/385 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1191 ms. Remains : 61/97 places, 339/385 transitions.
[2025-06-05 20:10:58] [INFO ] Flatten gal took : 17 ms
[2025-06-05 20:10:58] [INFO ] Flatten gal took : 18 ms
[2025-06-05 20:10:58] [INFO ] Input system was already deterministic with 339 transitions.
[2025-06-05 20:10:58] [INFO ] Flatten gal took : 18 ms
[2025-06-05 20:10:58] [INFO ] Flatten gal took : 18 ms
[2025-06-05 20:10:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality3713581662041943277.gal : 4 ms
[2025-06-05 20:10:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality7930983547406234606.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3713581662041943277.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7930983547406234606.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,92614,0.757528,20292,2,2083,5,30123,6,0,574,18248,0
Converting to forward existential form...Done !
original formula: EF(AG(EX(EG((p85==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(EG((p85==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t9, t11, t12, t14, t16, t17, t19, t21, t22, t24, t26, t27, t29, t31, t32,...378
(forward)formula 0,0,2.48941,51524,1,0,453,123204,695,87,10807,85876,704
FORMULA StigmergyElection-PT-07a-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 97/97 places, 385/385 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 95 transition count 358
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 69 transition count 358
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 53 place count 69 transition count 344
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 81 place count 55 transition count 344
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 91 place count 45 transition count 328
Iterating global reduction 2 with 10 rules applied. Total rules applied 101 place count 45 transition count 328
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 45 transition count 327
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 107 place count 40 transition count 317
Iterating global reduction 3 with 5 rules applied. Total rules applied 112 place count 40 transition count 317
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 3 with 62 rules applied. Total rules applied 174 place count 40 transition count 255
Drop transitions (Redundant composition of simpler transitions.) removed 193 transitions
Redundant transition composition rules discarded 193 transitions
Iterating global reduction 4 with 193 rules applied. Total rules applied 367 place count 40 transition count 62
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 381 place count 33 transition count 55
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 388 place count 26 transition count 48
Applied a total of 388 rules in 108 ms. Remains 26 /97 variables (removed 71) and now considering 48/385 (removed 337) transitions.
[2025-06-05 20:11:01] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
// Phase 1: matrix 40 rows 26 cols
[2025-06-05 20:11:01] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:11:01] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-05 20:11:01] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
[2025-06-05 20:11:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:11:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 20:11:01] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:11:01] [INFO ] Redundant transitions in 1 ms returned []
Running 35 sub problems to find dead transitions.
[2025-06-05 20:11:01] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
[2025-06-05 20:11:01] [INFO ] Invariant cache hit.
[2025-06-05 20:11:01] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 7/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:01] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:01] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:01] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:01] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:01] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:01] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:01] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:01] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:01] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:02] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:02] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:02] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:02] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:02] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:02] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:02] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:02] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:02] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 39/65 variables, 26/56 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:02] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:02] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:03] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:03] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:03] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:03] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 11/67 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:03] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:03] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 1/66 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 0/66 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 70 constraints, problems are : Problem set: 0 solved, 35 unsolved in 2776 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 7/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:04] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:04] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 39/65 variables, 26/71 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 35/106 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 1/66 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 0/66 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 107 constraints, problems are : Problem set: 0 solved, 35 unsolved in 1513 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4298ms problems are : Problem set: 0 solved, 35 unsolved
Search for dead transitions found 0 dead transitions in 4299ms
Starting structural reductions in SI_CTL mode, iteration 1 : 26/97 places, 48/385 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4501 ms. Remains : 26/97 places, 48/385 transitions.
[2025-06-05 20:11:05] [INFO ] Flatten gal took : 4 ms
[2025-06-05 20:11:05] [INFO ] Flatten gal took : 2 ms
[2025-06-05 20:11:05] [INFO ] Input system was already deterministic with 48 transitions.
[2025-06-05 20:11:05] [INFO ] Flatten gal took : 2 ms
[2025-06-05 20:11:05] [INFO ] Flatten gal took : 2 ms
[2025-06-05 20:11:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality2800690536337285141.gal : 1 ms
[2025-06-05 20:11:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality10826851364919371282.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2800690536337285141.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10826851364919371282.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,272,0.013992,4164,2,127,5,864,6,0,144,580,0
Converting to forward existential form...Done !
original formula: EF(EG(((p61==1)||(p37==0))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p61==1)||(p37==0)))] != FALSE
Hit Full ! (commute/partial/dont) 43/0/5
(forward)formula 0,1,0.027209,4420,1,0,7,2360,19,1,944,1384,8
FORMULA StigmergyElection-PT-07a-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 385/385 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 87 transition count 369
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 87 transition count 369
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 82 transition count 359
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 82 transition count 359
Applied a total of 30 rules in 6 ms. Remains 82 /97 variables (removed 15) and now considering 359/385 (removed 26) transitions.
[2025-06-05 20:11:05] [INFO ] Flow matrix only has 350 transitions (discarded 9 similar events)
// Phase 1: matrix 350 rows 82 cols
[2025-06-05 20:11:05] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:11:05] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-05 20:11:05] [INFO ] Flow matrix only has 350 transitions (discarded 9 similar events)
[2025-06-05 20:11:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:11:06] [INFO ] State equation strengthened by 288 read => feed constraints.
[2025-06-05 20:11:06] [INFO ] Implicit Places using invariants and state equation in 474 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 595 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/97 places, 359/385 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 71 transition count 349
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 71 transition count 349
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 67 transition count 345
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 67 transition count 345
Applied a total of 28 rules in 7 ms. Remains 67 /81 variables (removed 14) and now considering 345/359 (removed 14) transitions.
[2025-06-05 20:11:06] [INFO ] Flow matrix only has 336 transitions (discarded 9 similar events)
// Phase 1: matrix 336 rows 67 cols
[2025-06-05 20:11:06] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:11:06] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-05 20:11:06] [INFO ] Flow matrix only has 336 transitions (discarded 9 similar events)
[2025-06-05 20:11:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:11:06] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-05 20:11:06] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 67/97 places, 345/385 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 941 ms. Remains : 67/97 places, 345/385 transitions.
[2025-06-05 20:11:06] [INFO ] Flatten gal took : 14 ms
[2025-06-05 20:11:06] [INFO ] Flatten gal took : 16 ms
[2025-06-05 20:11:06] [INFO ] Input system was already deterministic with 345 transitions.
[2025-06-05 20:11:06] [INFO ] Flatten gal took : 15 ms
[2025-06-05 20:11:06] [INFO ] Flatten gal took : 16 ms
[2025-06-05 20:11:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality14821657243633602557.gal : 3 ms
[2025-06-05 20:11:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality7379956686377604868.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14821657243633602557.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7379956686377604868.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,93643,1.0116,25048,2,2963,5,41795,6,0,604,26825,0
Converting to forward existential form...Done !
original formula: AF(((!(E(!(((p97==0)||(p37==1))) U AX((p97==0)))) * EF((p31==1))) * (AG(EX((p80==1))) * AF((p1==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(!(((p97==0)||(p37==1))) U !(EX(!((p97==0)))))) * E(TRUE U (p31==1))) * (!(E(TRUE U !(EX((p80=...195
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t25, t26, t28, t29, t31,...383
(forward)formula 0,0,4.67969,89688,1,0,462,207439,715,94,10954,144413,722
FORMULA StigmergyElection-PT-07a-CTLCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 385/385 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 88 transition count 371
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 88 transition count 371
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 85 transition count 365
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 85 transition count 365
Applied a total of 24 rules in 5 ms. Remains 85 /97 variables (removed 12) and now considering 365/385 (removed 20) transitions.
[2025-06-05 20:11:11] [INFO ] Flow matrix only has 355 transitions (discarded 10 similar events)
// Phase 1: matrix 355 rows 85 cols
[2025-06-05 20:11:11] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:11:11] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-05 20:11:11] [INFO ] Flow matrix only has 355 transitions (discarded 10 similar events)
[2025-06-05 20:11:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:11:11] [INFO ] State equation strengthened by 288 read => feed constraints.
[2025-06-05 20:11:12] [INFO ] Implicit Places using invariants and state equation in 624 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 762 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/97 places, 365/385 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 73 transition count 354
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 73 transition count 354
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 67 transition count 348
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 67 transition count 348
Applied a total of 34 rules in 5 ms. Remains 67 /84 variables (removed 17) and now considering 348/365 (removed 17) transitions.
[2025-06-05 20:11:12] [INFO ] Flow matrix only has 338 transitions (discarded 10 similar events)
// Phase 1: matrix 338 rows 67 cols
[2025-06-05 20:11:12] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:11:12] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-05 20:11:12] [INFO ] Flow matrix only has 338 transitions (discarded 10 similar events)
[2025-06-05 20:11:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:11:12] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-05 20:11:12] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 67/97 places, 348/385 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1103 ms. Remains : 67/97 places, 348/385 transitions.
[2025-06-05 20:11:12] [INFO ] Flatten gal took : 13 ms
[2025-06-05 20:11:12] [INFO ] Flatten gal took : 14 ms
[2025-06-05 20:11:12] [INFO ] Input system was already deterministic with 348 transitions.
[2025-06-05 20:11:12] [INFO ] Flatten gal took : 13 ms
[2025-06-05 20:11:12] [INFO ] Flatten gal took : 14 ms
[2025-06-05 20:11:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality10790997398298324288.gal : 5 ms
[2025-06-05 20:11:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality9091401211284473063.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10790997398298324288.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9091401211284473063.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,96199,0.767203,21168,2,2601,5,39982,6,0,606,23538,0
Converting to forward existential form...Done !
original formula: EF(AX(((p16==1)&&((((p29==0)&&(p32==1))||((p42==0)&&(p67==1)))||((p57==0)&&(p32==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((p16==1)&&((((p29==0)&&(p32==1))||((p42==0)&&(p67==1)))||((p57==0)&&(p32==1))))))))]...164
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t17, t19, t21, t22, t24, t26, t27, t29, t30, t32,...393
(forward)formula 0,0,2.60821,55472,1,0,452,168088,702,90,11346,110451,692
FORMULA StigmergyElection-PT-07a-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 385/385 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 86 transition count 367
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 86 transition count 367
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 81 transition count 357
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 81 transition count 357
Applied a total of 32 rules in 5 ms. Remains 81 /97 variables (removed 16) and now considering 357/385 (removed 28) transitions.
[2025-06-05 20:11:15] [INFO ] Flow matrix only has 349 transitions (discarded 8 similar events)
// Phase 1: matrix 349 rows 81 cols
[2025-06-05 20:11:15] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:11:15] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-06-05 20:11:15] [INFO ] Flow matrix only has 349 transitions (discarded 8 similar events)
[2025-06-05 20:11:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:11:15] [INFO ] State equation strengthened by 288 read => feed constraints.
[2025-06-05 20:11:16] [INFO ] Implicit Places using invariants and state equation in 645 ms returned [80]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 766 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/97 places, 357/385 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 69 transition count 346
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 69 transition count 346
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 63 transition count 340
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 63 transition count 340
Applied a total of 34 rules in 4 ms. Remains 63 /80 variables (removed 17) and now considering 340/357 (removed 17) transitions.
[2025-06-05 20:11:16] [INFO ] Flow matrix only has 332 transitions (discarded 8 similar events)
// Phase 1: matrix 332 rows 63 cols
[2025-06-05 20:11:16] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:11:16] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-05 20:11:16] [INFO ] Flow matrix only has 332 transitions (discarded 8 similar events)
[2025-06-05 20:11:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:11:16] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-05 20:11:16] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 63/97 places, 340/385 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1059 ms. Remains : 63/97 places, 340/385 transitions.
[2025-06-05 20:11:16] [INFO ] Flatten gal took : 11 ms
[2025-06-05 20:11:16] [INFO ] Flatten gal took : 13 ms
[2025-06-05 20:11:16] [INFO ] Input system was already deterministic with 340 transitions.
[2025-06-05 20:11:16] [INFO ] Flatten gal took : 13 ms
[2025-06-05 20:11:16] [INFO ] Flatten gal took : 14 ms
[2025-06-05 20:11:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality16751276449414545876.gal : 3 ms
[2025-06-05 20:11:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality13267483832716242604.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16751276449414545876.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13267483832716242604.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,90568,0.877574,21576,2,2614,5,34323,6,0,584,22066,0
Converting to forward existential form...Done !
original formula: EX(AX(A((!(AX((p58==1))) * EF((p4==0))) U !(((p51==0)||(p3==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(!((E(!(!(((p51==0)||(p3==1)))) U (!((!(!(EX(!((p58==1))))) * E(TRUE U (p4==0)))) * !(!(((p51...221
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t12, t13, t14, t15, t16, t18, t20, t21, t23, t25, t26, t28, t30,...388
(forward)formula 0,0,7.96015,151504,1,0,575,434582,701,157,10816,292820,849
FORMULA StigmergyElection-PT-07a-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 385/385 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 87 transition count 368
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 87 transition count 368
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 81 transition count 356
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 81 transition count 356
Applied a total of 32 rules in 6 ms. Remains 81 /97 variables (removed 16) and now considering 356/385 (removed 29) transitions.
[2025-06-05 20:11:24] [INFO ] Flow matrix only has 347 transitions (discarded 9 similar events)
// Phase 1: matrix 347 rows 81 cols
[2025-06-05 20:11:24] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:11:24] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-06-05 20:11:24] [INFO ] Flow matrix only has 347 transitions (discarded 9 similar events)
[2025-06-05 20:11:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:11:24] [INFO ] State equation strengthened by 288 read => feed constraints.
[2025-06-05 20:11:25] [INFO ] Implicit Places using invariants and state equation in 696 ms returned [80]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 796 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/97 places, 356/385 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 67 transition count 343
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 67 transition count 343
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 62 transition count 338
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 62 transition count 338
Applied a total of 36 rules in 3 ms. Remains 62 /80 variables (removed 18) and now considering 338/356 (removed 18) transitions.
[2025-06-05 20:11:25] [INFO ] Flow matrix only has 329 transitions (discarded 9 similar events)
// Phase 1: matrix 329 rows 62 cols
[2025-06-05 20:11:25] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:11:25] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-05 20:11:25] [INFO ] Flow matrix only has 329 transitions (discarded 9 similar events)
[2025-06-05 20:11:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:11:25] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-05 20:11:25] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 62/97 places, 338/385 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1091 ms. Remains : 62/97 places, 338/385 transitions.
[2025-06-05 20:11:25] [INFO ] Flatten gal took : 12 ms
[2025-06-05 20:11:25] [INFO ] Flatten gal took : 14 ms
[2025-06-05 20:11:25] [INFO ] Input system was already deterministic with 338 transitions.
[2025-06-05 20:11:25] [INFO ] Flatten gal took : 13 ms
[2025-06-05 20:11:25] [INFO ] Flatten gal took : 14 ms
[2025-06-05 20:11:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality2693788388838036339.gal : 4 ms
[2025-06-05 20:11:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality4082762040987100349.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2693788388838036339.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4082762040987100349.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,84424,0.921189,23356,2,2642,5,38634,6,0,575,24882,0
Converting to forward existential form...Done !
original formula: EX((AF(AG(((p84==0)&&(p46==1)))) + (AG(((p11==0)&&(p98==1))) * EG(((EG((p22!=1)) * (p12==0)) * (p45==1))))))
=> equivalent forward existential formula: ([(EY(Init) * !(EG(!(!(E(TRUE U !(((p84==0)&&(p46==1)))))))))] != FALSE + [FwdG((EY(Init) * !(E(TRUE U !(((p11==...223
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t28, t29, t31, t33, t34,...368
(forward)formula 0,0,3.21046,63932,1,0,451,150434,704,86,11135,112187,708
FORMULA StigmergyElection-PT-07a-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 385/385 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 89 transition count 372
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 89 transition count 372
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 88 transition count 370
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 88 transition count 370
Applied a total of 18 rules in 4 ms. Remains 88 /97 variables (removed 9) and now considering 370/385 (removed 15) transitions.
[2025-06-05 20:11:29] [INFO ] Flow matrix only has 359 transitions (discarded 11 similar events)
// Phase 1: matrix 359 rows 88 cols
[2025-06-05 20:11:29] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:11:29] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-05 20:11:29] [INFO ] Flow matrix only has 359 transitions (discarded 11 similar events)
[2025-06-05 20:11:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:11:29] [INFO ] State equation strengthened by 288 read => feed constraints.
[2025-06-05 20:11:29] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2025-06-05 20:11:29] [INFO ] Flow matrix only has 359 transitions (discarded 11 similar events)
[2025-06-05 20:11:29] [INFO ] Invariant cache hit.
[2025-06-05 20:11:29] [INFO ] State equation strengthened by 288 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:33] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:33] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:33] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:33] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:33] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:33] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:33] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:33] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:34] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:34] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:34] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:34] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:34] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:34] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:34] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:34] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:35] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:35] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:35] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:35] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:35] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:35] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:35] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:35] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:35] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:36] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:36] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:36] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:36] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:36] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:36] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:36] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:36] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:36] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:36] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:36] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:37] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:37] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:37] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:37] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:38] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:38] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:38] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:39] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:39] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:39] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:39] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:39] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:39] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:39] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:40] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:40] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:40] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:40] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:40] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:40] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:40] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:41] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:41] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:41] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:42] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:42] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:42] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:42] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:42] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:43] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:43] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:43] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:43] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:43] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:43] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:43] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:43] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:43] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:44] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:45] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:45] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:45] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:45] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:45] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:45] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:45] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:45] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:45] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:46] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:46] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:46] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:46] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:46] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:46] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:46] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:46] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:47] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:48] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 14/97 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 8 (OVERLAPS) 358/446 variables, 88/185 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 287/472 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:58] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:59] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:11:59] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/447 variables, and 475 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 287/288 constraints, PredecessorRefiner: 369/107 constraints, Known Traps: 97/97 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 97/100 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:02] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:05] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:05] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:05] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:06] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:06] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 5/106 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:09] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:11] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:12] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:15] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 9 (OVERLAPS) 358/446 variables, 88/198 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 287/485 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/447 variables, and 592 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 287/288 constraints, PredecessorRefiner: 369/107 constraints, Known Traps: 107/107 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60748ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 60751ms
Starting structural reductions in LTL mode, iteration 1 : 88/97 places, 370/385 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61195 ms. Remains : 88/97 places, 370/385 transitions.
[2025-06-05 20:12:30] [INFO ] Flatten gal took : 12 ms
[2025-06-05 20:12:30] [INFO ] Flatten gal took : 14 ms
[2025-06-05 20:12:30] [INFO ] Input system was already deterministic with 370 transitions.
[2025-06-05 20:12:30] [INFO ] Flatten gal took : 13 ms
[2025-06-05 20:12:30] [INFO ] Flatten gal took : 13 ms
[2025-06-05 20:12:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality2401787497502350346.gal : 3 ms
[2025-06-05 20:12:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality7313271646374507715.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2401787497502350346.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7313271646374507715.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,96652,1.17093,30244,2,3153,5,52566,6,0,707,27006,0
Converting to forward existential form...Done !
original formula: A(EG((((p30==0)||(p68==1))&&((p85==0)||(p60==1)))) U A((E(EF((p36==0)) U AX((p31==1))) * (EF(((p99==0)||(p53==1))) + ((EF(((p74==0)||(p80...220
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(E(TRUE U ((p79==1) + EG((p61==1))))) U (!((E(E(TRUE U (p36==0)) U !(EX(!((p31==1))))) * ...980
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t9, t11, t12, t13, t14, t16, t17, t19, t20, t22, t24, t25, t26, t28, t29,...418
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,12.8314,270920,1,0,663,933850,777,251,11770,579296,998
FORMULA StigmergyElection-PT-07a-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 97/97 places, 385/385 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 95 transition count 357
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 68 transition count 356
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 67 transition count 356
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 57 place count 67 transition count 344
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 81 place count 55 transition count 344
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 92 place count 44 transition count 326
Iterating global reduction 3 with 11 rules applied. Total rules applied 103 place count 44 transition count 326
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 109 place count 38 transition count 314
Iterating global reduction 3 with 6 rules applied. Total rules applied 115 place count 38 transition count 314
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 146 place count 38 transition count 283
Drop transitions (Redundant composition of simpler transitions.) removed 221 transitions
Redundant transition composition rules discarded 221 transitions
Iterating global reduction 4 with 221 rules applied. Total rules applied 367 place count 38 transition count 62
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 381 place count 31 transition count 55
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 388 place count 24 transition count 48
Applied a total of 388 rules in 83 ms. Remains 24 /97 variables (removed 73) and now considering 48/385 (removed 337) transitions.
[2025-06-05 20:12:43] [INFO ] Flow matrix only has 41 transitions (discarded 7 similar events)
// Phase 1: matrix 41 rows 24 cols
[2025-06-05 20:12:43] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:12:43] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-05 20:12:43] [INFO ] Flow matrix only has 41 transitions (discarded 7 similar events)
[2025-06-05 20:12:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:12:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 20:12:43] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:12:43] [INFO ] Redundant transitions in 0 ms returned []
Running 31 sub problems to find dead transitions.
[2025-06-05 20:12:43] [INFO ] Flow matrix only has 41 transitions (discarded 7 similar events)
[2025-06-05 20:12:43] [INFO ] Invariant cache hit.
[2025-06-05 20:12:43] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 7/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:43] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:44] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:44] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:44] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:44] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:44] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:44] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:44] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:44] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:44] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:44] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:44] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:44] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:44] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:44] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:44] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:44] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:44] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:44] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:44] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:44] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:45] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:45] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:45] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:45] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:45] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:45] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 40/64 variables, 24/53 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:45] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:45] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:45] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:45] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:45] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:45] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:45] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:45] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 1/65 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:46] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:12:46] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/65 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (OVERLAPS) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 67 constraints, problems are : Problem set: 0 solved, 31 unsolved in 3206 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 7/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 40/64 variables, 24/66 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 31/97 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 1/65 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 0/65 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 98 constraints, problems are : Problem set: 0 solved, 31 unsolved in 1287 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4526ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 4543ms
Starting structural reductions in SI_CTL mode, iteration 1 : 24/97 places, 48/385 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4909 ms. Remains : 24/97 places, 48/385 transitions.
[2025-06-05 20:12:48] [INFO ] Flatten gal took : 3 ms
[2025-06-05 20:12:48] [INFO ] Flatten gal took : 2 ms
[2025-06-05 20:12:48] [INFO ] Input system was already deterministic with 48 transitions.
[2025-06-05 20:12:48] [INFO ] Flatten gal took : 2 ms
[2025-06-05 20:12:48] [INFO ] Flatten gal took : 2 ms
[2025-06-05 20:12:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality14525415989934275768.gal : 1 ms
[2025-06-05 20:12:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality722796673895755275.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14525415989934275768.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality722796673895755275.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,302,0.016457,4296,2,148,5,947,6,0,137,661,0
Converting to forward existential form...Done !
original formula: E(AF((p77==1)) U !(((p63==0)||(p11==1))))
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!((p77==1))))) * !(((p63==0)||(p11==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t19, t20, t35...255
(forward)formula 0,0,0.061975,4680,1,0,96,3999,117,40,1297,3603,103
FORMULA StigmergyElection-PT-07a-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 385/385 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 87 transition count 369
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 87 transition count 369
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 83 transition count 361
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 83 transition count 361
Applied a total of 28 rules in 4 ms. Remains 83 /97 variables (removed 14) and now considering 361/385 (removed 24) transitions.
[2025-06-05 20:12:48] [INFO ] Flow matrix only has 352 transitions (discarded 9 similar events)
// Phase 1: matrix 352 rows 83 cols
[2025-06-05 20:12:48] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:12:48] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-05 20:12:48] [INFO ] Flow matrix only has 352 transitions (discarded 9 similar events)
[2025-06-05 20:12:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:12:48] [INFO ] State equation strengthened by 288 read => feed constraints.
[2025-06-05 20:12:49] [INFO ] Implicit Places using invariants and state equation in 577 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 715 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/97 places, 361/385 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 350
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 350
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 65 transition count 344
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 65 transition count 344
Applied a total of 34 rules in 5 ms. Remains 65 /82 variables (removed 17) and now considering 344/361 (removed 17) transitions.
[2025-06-05 20:12:49] [INFO ] Flow matrix only has 335 transitions (discarded 9 similar events)
// Phase 1: matrix 335 rows 65 cols
[2025-06-05 20:12:49] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:12:49] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-05 20:12:49] [INFO ] Flow matrix only has 335 transitions (discarded 9 similar events)
[2025-06-05 20:12:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:12:49] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-05 20:12:49] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 65/97 places, 344/385 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1071 ms. Remains : 65/97 places, 344/385 transitions.
[2025-06-05 20:12:49] [INFO ] Flatten gal took : 11 ms
[2025-06-05 20:12:49] [INFO ] Flatten gal took : 13 ms
[2025-06-05 20:12:49] [INFO ] Input system was already deterministic with 344 transitions.
[2025-06-05 20:12:49] [INFO ] Flatten gal took : 19 ms
[2025-06-05 20:12:49] [INFO ] Flatten gal took : 12 ms
[2025-06-05 20:12:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality13304633901578232508.gal : 3 ms
[2025-06-05 20:12:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality3337591027041440885.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13304633901578232508.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3337591027041440885.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,95175,0.70674,20444,2,2455,5,37246,6,0,595,21691,0
Converting to forward existential form...Done !
original formula: EX(((p49==1) + EG(((EX((p16==1)) + (p30==0)) + ((p42==0)&&(p15==1))))))
=> equivalent forward existential formula: ([(EY(Init) * (p49==1))] != FALSE + [FwdG(EY(Init),((EX((p16==1)) + (p30==0)) + ((p42==0)&&(p15==1))))] != FALSE...156
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t20, t21, t22, t23, t24, t25, t26, t28,...393
(forward)formula 0,1,5.54543,121372,1,0,562,305873,703,164,10831,286809,781
FORMULA StigmergyElection-PT-07a-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 385/385 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 86 transition count 367
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 86 transition count 367
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 80 transition count 355
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 80 transition count 355
Applied a total of 34 rules in 4 ms. Remains 80 /97 variables (removed 17) and now considering 355/385 (removed 30) transitions.
[2025-06-05 20:12:55] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
// Phase 1: matrix 347 rows 80 cols
[2025-06-05 20:12:55] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:12:55] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-05 20:12:55] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
[2025-06-05 20:12:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:12:55] [INFO ] State equation strengthened by 288 read => feed constraints.
[2025-06-05 20:12:55] [INFO ] Implicit Places using invariants and state equation in 453 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 580 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/97 places, 355/385 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 66 transition count 342
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 66 transition count 342
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 59 transition count 335
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 59 transition count 335
Applied a total of 40 rules in 4 ms. Remains 59 /79 variables (removed 20) and now considering 335/355 (removed 20) transitions.
[2025-06-05 20:12:55] [INFO ] Flow matrix only has 327 transitions (discarded 8 similar events)
// Phase 1: matrix 327 rows 59 cols
[2025-06-05 20:12:55] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:12:55] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-05 20:12:55] [INFO ] Flow matrix only has 327 transitions (discarded 8 similar events)
[2025-06-05 20:12:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:12:55] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-05 20:12:55] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 59/97 places, 335/385 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 884 ms. Remains : 59/97 places, 335/385 transitions.
[2025-06-05 20:12:55] [INFO ] Flatten gal took : 11 ms
[2025-06-05 20:12:55] [INFO ] Flatten gal took : 12 ms
[2025-06-05 20:12:55] [INFO ] Input system was already deterministic with 335 transitions.
[2025-06-05 20:12:56] [INFO ] Flatten gal took : 12 ms
[2025-06-05 20:12:56] [INFO ] Flatten gal took : 13 ms
[2025-06-05 20:12:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality5457029947861022904.gal : 3 ms
[2025-06-05 20:12:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality5716943471240996034.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5457029947861022904.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5716943471240996034.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,84422,0.897411,23212,2,2567,5,38049,6,0,563,24394,0
Converting to forward existential form...Done !
original formula: AX(EX(E((p96!=1) U EF(EG((p45==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(E((p96!=1) U E(TRUE U EG((p45==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...373
(forward)formula 0,1,5.15824,104748,1,0,494,252462,692,111,10298,168438,770
FORMULA StigmergyElection-PT-07a-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2025-06-05 20:13:01] [INFO ] Flatten gal took : 13 ms
[2025-06-05 20:13:01] [INFO ] Flatten gal took : 13 ms
Total runtime 209710 ms.
BK_STOP 1749154381367
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-07a"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-07a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r226-smll-174903491000241"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-07a.tgz
mv StigmergyElection-PT-07a execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;