About the Execution of ITS-Tools for FamilyReunion-COL-L00050M0005C002P002G001
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16176.100 | 3600000.00 | 13317332.00 | 14806.30 | TFFF?F?TFFTFTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110600635.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FamilyReunion-COL-L00050M0005C002P002G001, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110600635
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 5.6K Apr 30 08:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Apr 30 08:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 30 08:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 30 08:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 9 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 24 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 137K May 10 09: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
here is the order used to build the result vector(from text file)
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-00
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-01
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-02
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-03
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-04
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-05
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-06
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-07
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-08
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-09
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-10
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-11
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-12
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-13
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-14
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652702259344
Running Version 202205111006
[2022-05-16 11:57:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 11:57:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 11:57:40] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-16 11:57:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 11:57:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1060 ms
[2022-05-16 11:57:41] [INFO ] Detected 5 constant HL places corresponding to 17 PT places.
[2022-05-16 11:57:41] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 12245 PT places and 10611.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-16 11:57:41] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 6 ms.
[2022-05-16 11:57:41] [INFO ] Skeletonized 15 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 104 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 12 properties that can be checked using skeleton over-approximation.
Reduce places removed 5 places and 0 transitions.
Computed a total of 99 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Finished random walk after 2983 steps, including 0 resets, run visited all 24 properties in 37 ms. (steps per millisecond=80 )
[2022-05-16 11:57:41] [INFO ] Flatten gal took : 25 ms
[2022-05-16 11:57:41] [INFO ] Flatten gal took : 7 ms
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 3
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 2
[2022-05-16 11:57:42] [INFO ] Unfolded HLPN to a Petri net with 11467 places and 9336 transitions 26832 arcs in 90 ms.
[2022-05-16 11:57:42] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Deduced a syphon composed of 51 places in 45 ms
Reduce places removed 64 places and 0 transitions.
Support contains 3893 out of 11403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11403/11403 places, 9336/9336 transitions.
Reduce places removed 161 places and 0 transitions.
Discarding 1428 places :
Implicit places reduction removed 1428 places
Iterating post reduction 0 with 1589 rules applied. Total rules applied 1589 place count 9814 transition count 9336
Discarding 407 places :
Symmetric choice reduction at 1 with 407 rule applications. Total rules 1996 place count 9407 transition count 8929
Iterating global reduction 1 with 407 rules applied. Total rules applied 2403 place count 9407 transition count 8929
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 2405 place count 9405 transition count 8827
Iterating global reduction 1 with 2 rules applied. Total rules applied 2407 place count 9405 transition count 8827
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2458 place count 9354 transition count 8827
Applied a total of 2458 rules in 2674 ms. Remains 9354 /11403 variables (removed 2049) and now considering 8827/9336 (removed 509) transitions.
// Phase 1: matrix 8827 rows 9354 cols
[2022-05-16 11:57:45] [INFO ] Computed 1180 place invariants in 605 ms
[2022-05-16 11:57:46] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 11:57:46] [INFO ] Implicit Places using invariants in 1970 ms returned []
// Phase 1: matrix 8827 rows 9354 cols
[2022-05-16 11:57:47] [INFO ] Computed 1180 place invariants in 162 ms
[2022-05-16 11:57:47] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 11:57:48] [INFO ] Implicit Places using invariants and state equation in 1061 ms returned []
Implicit Place search using SMT with State Equation took 3056 ms to find 0 implicit places.
// Phase 1: matrix 8827 rows 9354 cols
[2022-05-16 11:57:48] [INFO ] Computed 1180 place invariants in 138 ms
[2022-05-16 11:57:48] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 11:57:49] [INFO ] Dead Transitions using invariants and state equation in 1011 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9354/11403 places, 8827/9336 transitions.
Finished structural reductions, in 1 iterations. Remains : 9354/11403 places, 8827/9336 transitions.
Support contains 3893 out of 9354 places after structural reductions.
[2022-05-16 11:57:49] [INFO ] Flatten gal took : 403 ms
[2022-05-16 11:57:49] [INFO ] Flatten gal took : 265 ms
[2022-05-16 11:57:50] [INFO ] Input system was already deterministic with 8827 transitions.
Support contains 3791 out of 9354 places (down from 3893) after GAL structural reductions.
Finished random walk after 2578 steps, including 0 resets, run visited all 23 properties in 225 ms. (steps per millisecond=11 )
Computed a total of 9354 stabilizing places and 8827 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 9354 transition count 8827
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&p1)))'
Support contains 153 out of 9354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9354/9354 places, 8827/8827 transitions.
Reduce places removed 7 places and 0 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Iterating post reduction 0 with 619 rules applied. Total rules applied 619 place count 8735 transition count 8827
Discarding 716 places :
Symmetric choice reduction at 1 with 716 rule applications. Total rules 1335 place count 8019 transition count 8111
Iterating global reduction 1 with 716 rules applied. Total rules applied 2051 place count 8019 transition count 8111
Discarding 357 places :
Symmetric choice reduction at 1 with 357 rule applications. Total rules 2408 place count 7662 transition count 7754
Iterating global reduction 1 with 357 rules applied. Total rules applied 2765 place count 7662 transition count 7754
Discarding 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 2872 place count 7555 transition count 7397
Iterating global reduction 1 with 107 rules applied. Total rules applied 2979 place count 7555 transition count 7397
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 3030 place count 7504 transition count 7397
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3285 place count 7249 transition count 7142
Iterating global reduction 2 with 255 rules applied. Total rules applied 3540 place count 7249 transition count 7142
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3795 place count 6994 transition count 6887
Iterating global reduction 2 with 255 rules applied. Total rules applied 4050 place count 6994 transition count 6887
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4305 place count 6739 transition count 6632
Iterating global reduction 2 with 255 rules applied. Total rules applied 4560 place count 6739 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4815 place count 6484 transition count 6377
Iterating global reduction 2 with 255 rules applied. Total rules applied 5070 place count 6484 transition count 6377
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5325 place count 6229 transition count 6122
Iterating global reduction 2 with 255 rules applied. Total rules applied 5580 place count 6229 transition count 6122
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5835 place count 5974 transition count 5867
Iterating global reduction 2 with 255 rules applied. Total rules applied 6090 place count 5974 transition count 5867
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6345 place count 5719 transition count 5612
Iterating global reduction 2 with 255 rules applied. Total rules applied 6600 place count 5719 transition count 5612
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6855 place count 5464 transition count 5357
Iterating global reduction 2 with 255 rules applied. Total rules applied 7110 place count 5464 transition count 5357
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7365 place count 5209 transition count 5102
Iterating global reduction 2 with 255 rules applied. Total rules applied 7620 place count 5209 transition count 5102
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7875 place count 4954 transition count 4847
Iterating global reduction 2 with 255 rules applied. Total rules applied 8130 place count 4954 transition count 4847
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8385 place count 4699 transition count 4592
Iterating global reduction 2 with 255 rules applied. Total rules applied 8640 place count 4699 transition count 4592
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8895 place count 4444 transition count 4337
Iterating global reduction 2 with 255 rules applied. Total rules applied 9150 place count 4444 transition count 4337
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 9405 place count 4189 transition count 4082
Iterating global reduction 2 with 255 rules applied. Total rules applied 9660 place count 4189 transition count 4082
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 306 rules applied. Total rules applied 9966 place count 4138 transition count 3827
Applied a total of 9966 rules in 15188 ms. Remains 4138 /9354 variables (removed 5216) and now considering 3827/8827 (removed 5000) transitions.
// Phase 1: matrix 3827 rows 4138 cols
[2022-05-16 11:58:06] [INFO ] Computed 464 place invariants in 45 ms
[2022-05-16 11:58:07] [INFO ] Implicit Places using invariants in 997 ms returned [1711, 1717, 1723, 2536]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 1001 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4134/9354 places, 3827/8827 transitions.
Applied a total of 0 rules in 346 ms. Remains 4134 /4134 variables (removed 0) and now considering 3827/3827 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 4134/9354 places, 3827/8827 transitions.
Stuttering acceptance computed with spot in 255 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(LEQ 2 (ADD s1836 s1837 s1838 s1839 s1840 s1841 s1842 s1843 s1844 s1845 s1846 s1847 s1848 s1849 s1850 s1851 s1852 s1853 s1854 s1855 s1856 s1857 s1858 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-01 finished in 16869 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((p0 U p1))&&F((X(p1)&&p2)))))'
Support contains 510 out of 9354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9354/9354 places, 8827/8827 transitions.
Reduce places removed 7 places and 0 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Iterating post reduction 0 with 619 rules applied. Total rules applied 619 place count 8735 transition count 8827
Discarding 716 places :
Symmetric choice reduction at 1 with 716 rule applications. Total rules 1335 place count 8019 transition count 8111
Iterating global reduction 1 with 716 rules applied. Total rules applied 2051 place count 8019 transition count 8111
Discarding 357 places :
Symmetric choice reduction at 1 with 357 rule applications. Total rules 2408 place count 7662 transition count 7754
Iterating global reduction 1 with 357 rules applied. Total rules applied 2765 place count 7662 transition count 7754
Discarding 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 2872 place count 7555 transition count 7397
Iterating global reduction 1 with 107 rules applied. Total rules applied 2979 place count 7555 transition count 7397
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 3030 place count 7504 transition count 7397
Applied a total of 3030 rules in 5000 ms. Remains 7504 /9354 variables (removed 1850) and now considering 7397/8827 (removed 1430) transitions.
// Phase 1: matrix 7397 rows 7504 cols
[2022-05-16 11:58:13] [INFO ] Computed 515 place invariants in 114 ms
[2022-05-16 11:58:13] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 11:58:14] [INFO ] Implicit Places using invariants in 1817 ms returned [898]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1823 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7503/9354 places, 7397/8827 transitions.
Applied a total of 0 rules in 1107 ms. Remains 7503 /7503 variables (removed 0) and now considering 7397/7397 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7503/9354 places, 7397/8827 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p2) (NOT p1)), (NOT p1), true]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (OR (LEQ (ADD s3468 s3469 s3470 s3471 s3472 s3473 s3474 s3475 s3476 s3477 s3478 s3479 s3480 s3481 s3482 s3483 s3484 s3485 s3486 s3487 s3488 s3489 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 63 reset in 2362 ms.
Product exploration explored 100000 steps with 62 reset in 2318 ms.
Computed a total of 7503 stabilizing places and 7397 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7503 transition count 7397
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (AND (NOT p1) p0)), (X p2), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p1) p0))), true, (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 1230 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 7 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p2)), (NOT p1), true, false, false]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 7397 rows 7503 cols
[2022-05-16 11:58:24] [INFO ] Computed 514 place invariants in 103 ms
[2022-05-16 11:58:25] [INFO ] After 610ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (AND (NOT p1) p0)), (X p2), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p1) p0))), true, (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (G p0)), (G (NOT (AND p1 (NOT p0) p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0 p2))), (F (NOT p2)), (F (NOT (OR p1 p0))), (F (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p0 p2)), (F (NOT (AND (NOT p1) p2)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p1) (NOT p0)))
Knowledge based reduction with 16 factoid took 279 ms. Reduced automaton from 7 states, 18 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-02 finished in 18040 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 102 out of 9354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9354/9354 places, 8827/8827 transitions.
Reduce places removed 7 places and 0 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Iterating post reduction 0 with 619 rules applied. Total rules applied 619 place count 8735 transition count 8827
Discarding 716 places :
Symmetric choice reduction at 1 with 716 rule applications. Total rules 1335 place count 8019 transition count 8111
Iterating global reduction 1 with 716 rules applied. Total rules applied 2051 place count 8019 transition count 8111
Discarding 357 places :
Symmetric choice reduction at 1 with 357 rule applications. Total rules 2408 place count 7662 transition count 7754
Iterating global reduction 1 with 357 rules applied. Total rules applied 2765 place count 7662 transition count 7754
Discarding 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 2872 place count 7555 transition count 7397
Iterating global reduction 1 with 107 rules applied. Total rules applied 2979 place count 7555 transition count 7397
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 3030 place count 7504 transition count 7397
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3285 place count 7249 transition count 7142
Iterating global reduction 2 with 255 rules applied. Total rules applied 3540 place count 7249 transition count 7142
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3795 place count 6994 transition count 6887
Iterating global reduction 2 with 255 rules applied. Total rules applied 4050 place count 6994 transition count 6887
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4305 place count 6739 transition count 6632
Iterating global reduction 2 with 255 rules applied. Total rules applied 4560 place count 6739 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4815 place count 6484 transition count 6377
Iterating global reduction 2 with 255 rules applied. Total rules applied 5070 place count 6484 transition count 6377
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5325 place count 6229 transition count 6122
Iterating global reduction 2 with 255 rules applied. Total rules applied 5580 place count 6229 transition count 6122
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5835 place count 5974 transition count 5867
Iterating global reduction 2 with 255 rules applied. Total rules applied 6090 place count 5974 transition count 5867
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6345 place count 5719 transition count 5612
Iterating global reduction 2 with 255 rules applied. Total rules applied 6600 place count 5719 transition count 5612
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6855 place count 5464 transition count 5357
Iterating global reduction 2 with 255 rules applied. Total rules applied 7110 place count 5464 transition count 5357
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7365 place count 5209 transition count 5102
Iterating global reduction 2 with 255 rules applied. Total rules applied 7620 place count 5209 transition count 5102
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7875 place count 4954 transition count 4847
Iterating global reduction 2 with 255 rules applied. Total rules applied 8130 place count 4954 transition count 4847
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8385 place count 4699 transition count 4592
Iterating global reduction 2 with 255 rules applied. Total rules applied 8640 place count 4699 transition count 4592
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8895 place count 4444 transition count 4337
Iterating global reduction 2 with 255 rules applied. Total rules applied 9150 place count 4444 transition count 4337
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 9405 place count 4189 transition count 4082
Iterating global reduction 2 with 255 rules applied. Total rules applied 9660 place count 4189 transition count 4082
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 306 rules applied. Total rules applied 9966 place count 4138 transition count 3827
Applied a total of 9966 rules in 13989 ms. Remains 4138 /9354 variables (removed 5216) and now considering 3827/8827 (removed 5000) transitions.
// Phase 1: matrix 3827 rows 4138 cols
[2022-05-16 11:58:40] [INFO ] Computed 464 place invariants in 49 ms
[2022-05-16 11:58:41] [INFO ] Implicit Places using invariants in 1009 ms returned [1711, 1717, 1723, 2536]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 1012 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4134/9354 places, 3827/8827 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 4129 transition count 3822
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 4129 transition count 3822
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 4127 transition count 3818
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 4127 transition count 3818
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 4125 transition count 3816
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 4125 transition count 3816
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 4123 transition count 3814
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 4123 transition count 3814
Applied a total of 22 rules in 1682 ms. Remains 4123 /4134 variables (removed 11) and now considering 3814/3827 (removed 13) transitions.
// Phase 1: matrix 3814 rows 4123 cols
[2022-05-16 11:58:42] [INFO ] Computed 460 place invariants in 46 ms
[2022-05-16 11:58:43] [INFO ] Implicit Places using invariants in 992 ms returned [2526]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 995 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4122/9354 places, 3814/8827 transitions.
Applied a total of 0 rules in 338 ms. Remains 4122 /4122 variables (removed 0) and now considering 3814/3814 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 4122/9354 places, 3814/8827 transitions.
Stuttering acceptance computed with spot in 461 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s1379 s1380 s1381 s1382 s1383 s1384 s1385 s1386 s1387 s1388 s1389 s1390 s1391 s1392 s1393 s1394 s1395 s1396 s1397 s1398 s1399 s1400 s1401 s140...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-03 finished in 18509 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U !(G(p1) U (G(p2)&&p0))))'
Support contains 715 out of 9354 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9354/9354 places, 8827/8827 transitions.
Graph (complete) has 13005 edges and 9354 vertex of which 9089 are kept as prefixes of interest. Removing 265 places using SCC suffix rule.36 ms
Discarding 265 places :
Also discarding 208 output transitions
Drop transitions removed 208 transitions
Reduce places removed 51 places and 51 transitions.
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 306 places :
Implicit places reduction removed 306 places
Drop transitions removed 3621 transitions
Trivial Post-agglo rules discarded 3621 transitions
Performed 3621 trivial Post agglomeration. Transition count delta: 3621
Iterating post reduction 0 with 3978 rules applied. Total rules applied 3979 place count 8732 transition count 4896
Reduce places removed 3621 places and 0 transitions.
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 357
Iterating post reduction 1 with 3978 rules applied. Total rules applied 7957 place count 5111 transition count 4539
Reduce places removed 357 places and 0 transitions.
Iterating post reduction 2 with 357 rules applied. Total rules applied 8314 place count 4754 transition count 4539
Performed 1122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1122 Pre rules applied. Total rules applied 8314 place count 4754 transition count 3417
Deduced a syphon composed of 1122 places in 1 ms
Ensure Unique test removed 612 places
Reduce places removed 1734 places and 0 transitions.
Iterating global reduction 3 with 2856 rules applied. Total rules applied 11170 place count 3020 transition count 3417
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 3 with 204 rules applied. Total rules applied 11374 place count 3020 transition count 3213
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 4 with 204 rules applied. Total rules applied 11578 place count 2816 transition count 3213
Discarding 407 places :
Symmetric choice reduction at 5 with 407 rule applications. Total rules 11985 place count 2409 transition count 2806
Iterating global reduction 5 with 407 rules applied. Total rules applied 12392 place count 2409 transition count 2806
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 5 with 204 rules applied. Total rules applied 12596 place count 2358 transition count 2653
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 6 with 51 rules applied. Total rules applied 12647 place count 2307 transition count 2653
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 51 Pre rules applied. Total rules applied 12647 place count 2307 transition count 2602
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 12749 place count 2256 transition count 2602
Discarding 50 places :
Symmetric choice reduction at 7 with 50 rule applications. Total rules 12799 place count 2206 transition count 2552
Ensure Unique test removed 1 places
Iterating global reduction 7 with 51 rules applied. Total rules applied 12850 place count 2205 transition count 2552
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 12850 place count 2205 transition count 2551
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 12852 place count 2204 transition count 2551
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 12954 place count 2153 transition count 2500
Applied a total of 12954 rules in 858 ms. Remains 2153 /9354 variables (removed 7201) and now considering 2500/8827 (removed 6327) transitions.
// Phase 1: matrix 2500 rows 2153 cols
[2022-05-16 11:58:45] [INFO ] Computed 158 place invariants in 19 ms
[2022-05-16 11:58:46] [INFO ] Implicit Places using invariants in 723 ms returned [357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 561, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022, 2023, 2024, 2025, 2026, 2027, 2028, 2029, 2030, 2031, 2032, 2033, 2034, 2035, 2036, 2037, 2038, 2039, 2040, 2041, 2042, 2043, 2044, 2045, 2046, 2047, 2048, 2049, 2152]
Discarding 155 places :
Implicit Place search using SMT only with invariants took 726 ms to find 155 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1998/9354 places, 2500/8827 transitions.
Drop transitions removed 306 transitions
Trivial Post-agglo rules discarded 306 transitions
Performed 306 trivial Post agglomeration. Transition count delta: 306
Iterating post reduction 0 with 306 rules applied. Total rules applied 306 place count 1998 transition count 2194
Reduce places removed 306 places and 0 transitions.
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Iterating post reduction 1 with 408 rules applied. Total rules applied 714 place count 1692 transition count 2092
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 2 with 102 rules applied. Total rules applied 816 place count 1590 transition count 2092
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 866 place count 1540 transition count 2042
Iterating global reduction 3 with 50 rules applied. Total rules applied 916 place count 1540 transition count 2042
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 916 place count 1540 transition count 2041
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 918 place count 1539 transition count 2041
Applied a total of 918 rules in 102 ms. Remains 1539 /1998 variables (removed 459) and now considering 2041/2500 (removed 459) transitions.
// Phase 1: matrix 2041 rows 1539 cols
[2022-05-16 11:58:46] [INFO ] Computed 3 place invariants in 17 ms
[2022-05-16 11:58:46] [INFO ] Implicit Places using invariants in 220 ms returned []
// Phase 1: matrix 2041 rows 1539 cols
[2022-05-16 11:58:46] [INFO ] Computed 3 place invariants in 19 ms
[2022-05-16 11:58:47] [INFO ] Implicit Places using invariants and state equation in 1242 ms returned []
Implicit Place search using SMT with State Equation took 1470 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1539/9354 places, 2041/8827 transitions.
Finished structural reductions, in 2 iterations. Remains : 1539/9354 places, 2041/8827 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND p0 p2), (AND p0 p2), (AND p1 p0 p2), (AND p0 p2 p1)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0 p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 (ADD s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1769 reset in 2271 ms.
Product exploration explored 100000 steps with 1771 reset in 2274 ms.
Computed a total of 1539 stabilizing places and 2041 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1539 transition count 2041
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 p2)), (X (AND p1 p0 p2)), (X (NOT (AND p1 (NOT p0) p2))), (X p1), (X (X (AND p0 p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (F (G p0)), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 406 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 584 ms :[(AND p0 p2), (AND p0 p2), (AND p1 p0 p2), (AND p0 p2 p1)]
Finished random walk after 433 steps, including 0 resets, run visited all 4 properties in 11 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 p2)), (X (AND p1 p0 p2)), (X (NOT (AND p1 (NOT p0) p2))), (X p1), (X (X (AND p0 p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (F (G p0)), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p0 p1 p2))), (F (NOT (AND p0 p2))), (F (NOT p1)), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 10 factoid took 557 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 133 ms :[(AND p0 p2), (AND p0 p2), (AND p1 p0 p2), (AND p0 p2 p1)]
Stuttering acceptance computed with spot in 152 ms :[(AND p0 p2), (AND p0 p2), (AND p1 p0 p2), (AND p0 p2 p1)]
// Phase 1: matrix 2041 rows 1539 cols
[2022-05-16 11:58:55] [INFO ] Computed 3 place invariants in 40 ms
[2022-05-16 11:58:58] [INFO ] [Real]Absence check using 3 positive place invariants in 21 ms returned sat
[2022-05-16 11:58:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 11:58:59] [INFO ] [Real]Absence check using state equation in 1027 ms returned sat
[2022-05-16 11:58:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 11:59:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 65 ms returned sat
[2022-05-16 11:59:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 11:59:03] [INFO ] [Nat]Absence check using state equation in 1665 ms returned sat
[2022-05-16 11:59:03] [INFO ] Computed and/alt/rep : 1428/1683/1428 causal constraints (skipped 307 transitions) in 127 ms.
[2022-05-16 11:59:05] [INFO ] Added : 113 causal constraints over 23 iterations in 2428 ms. Result :sat
Could not prove EG (AND p0 p2)
Support contains 715 out of 1539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1539/1539 places, 2041/2041 transitions.
Applied a total of 0 rules in 20 ms. Remains 1539 /1539 variables (removed 0) and now considering 2041/2041 (removed 0) transitions.
// Phase 1: matrix 2041 rows 1539 cols
[2022-05-16 11:59:05] [INFO ] Computed 3 place invariants in 26 ms
[2022-05-16 11:59:05] [INFO ] Implicit Places using invariants in 220 ms returned []
// Phase 1: matrix 2041 rows 1539 cols
[2022-05-16 11:59:06] [INFO ] Computed 3 place invariants in 17 ms
[2022-05-16 11:59:07] [INFO ] Implicit Places using invariants and state equation in 1252 ms returned []
Implicit Place search using SMT with State Equation took 1474 ms to find 0 implicit places.
// Phase 1: matrix 2041 rows 1539 cols
[2022-05-16 11:59:07] [INFO ] Computed 3 place invariants in 25 ms
[2022-05-16 11:59:08] [INFO ] Dead Transitions using invariants and state equation in 835 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1539/1539 places, 2041/2041 transitions.
Computed a total of 1539 stabilizing places and 2041 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1539 transition count 2041
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (AND p0 p2)), (X p1), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 p2))), (F (G p0)), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 586 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 143 ms :[(AND p0 p2), (AND p0 p2), (AND p1 p0 p2), (AND p0 p2 p1)]
Finished random walk after 437 steps, including 0 resets, run visited all 4 properties in 8 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (AND p0 p2)), (X p1), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 p2))), (F (G p0)), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p0 p1 p2))), (F (NOT (AND p0 p2))), (F (NOT p1)), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 10 factoid took 1321 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 138 ms :[(AND p0 p2), (AND p0 p2), (AND p1 p0 p2), (AND p0 p2 p1)]
Stuttering acceptance computed with spot in 158 ms :[(AND p0 p2), (AND p0 p2), (AND p1 p0 p2), (AND p0 p2 p1)]
// Phase 1: matrix 2041 rows 1539 cols
[2022-05-16 11:59:11] [INFO ] Computed 3 place invariants in 24 ms
[2022-05-16 11:59:13] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-05-16 11:59:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 11:59:14] [INFO ] [Real]Absence check using state equation in 978 ms returned sat
[2022-05-16 11:59:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 11:59:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 64 ms returned sat
[2022-05-16 11:59:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 11:59:18] [INFO ] [Nat]Absence check using state equation in 1718 ms returned sat
[2022-05-16 11:59:19] [INFO ] Computed and/alt/rep : 1428/1683/1428 causal constraints (skipped 307 transitions) in 126 ms.
[2022-05-16 11:59:21] [INFO ] Added : 113 causal constraints over 23 iterations in 2390 ms. Result :sat
Could not prove EG (AND p0 p2)
Stuttering acceptance computed with spot in 234 ms :[(AND p0 p2), (AND p0 p2), (AND p1 p0 p2), (AND p0 p2 p1)]
Product exploration explored 100000 steps with 1785 reset in 1786 ms.
Product exploration explored 100000 steps with 1793 reset in 1802 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 160 ms :[(AND p0 p2), (AND p0 p2), (AND p1 p0 p2), (AND p0 p2 p1)]
Support contains 715 out of 1539 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1539/1539 places, 2041/2041 transitions.
Applied a total of 0 rules in 101 ms. Remains 1539 /1539 variables (removed 0) and now considering 2041/2041 (removed 0) transitions.
[2022-05-16 11:59:25] [INFO ] Redundant transitions in 177 ms returned []
// Phase 1: matrix 2041 rows 1539 cols
[2022-05-16 11:59:25] [INFO ] Computed 3 place invariants in 17 ms
[2022-05-16 11:59:26] [INFO ] Dead Transitions using invariants and state equation in 811 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1539/1539 places, 2041/2041 transitions.
Product exploration explored 100000 steps with 1835 reset in 2010 ms.
Product exploration explored 100000 steps with 1795 reset in 2020 ms.
Built C files in :
/tmp/ltsmin1378067097624084840
[2022-05-16 11:59:30] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1378067097624084840
Running compilation step : cd /tmp/ltsmin1378067097624084840;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1378067097624084840;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1378067097624084840;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 715 out of 1539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1539/1539 places, 2041/2041 transitions.
Applied a total of 0 rules in 23 ms. Remains 1539 /1539 variables (removed 0) and now considering 2041/2041 (removed 0) transitions.
// Phase 1: matrix 2041 rows 1539 cols
[2022-05-16 11:59:33] [INFO ] Computed 3 place invariants in 17 ms
[2022-05-16 11:59:33] [INFO ] Implicit Places using invariants in 195 ms returned []
// Phase 1: matrix 2041 rows 1539 cols
[2022-05-16 11:59:33] [INFO ] Computed 3 place invariants in 18 ms
[2022-05-16 11:59:35] [INFO ] Implicit Places using invariants and state equation in 1243 ms returned []
Implicit Place search using SMT with State Equation took 1441 ms to find 0 implicit places.
// Phase 1: matrix 2041 rows 1539 cols
[2022-05-16 11:59:35] [INFO ] Computed 3 place invariants in 26 ms
[2022-05-16 11:59:36] [INFO ] Dead Transitions using invariants and state equation in 820 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1539/1539 places, 2041/2041 transitions.
Built C files in :
/tmp/ltsmin12438345002875541213
[2022-05-16 11:59:36] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12438345002875541213
Running compilation step : cd /tmp/ltsmin12438345002875541213;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12438345002875541213;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12438345002875541213;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 11:59:39] [INFO ] Flatten gal took : 49 ms
[2022-05-16 11:59:39] [INFO ] Flatten gal took : 51 ms
[2022-05-16 11:59:39] [INFO ] Time to serialize gal into /tmp/LTL10198465302353585309.gal : 10 ms
[2022-05-16 11:59:39] [INFO ] Time to serialize properties into /tmp/LTL18275774246798014341.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10198465302353585309.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18275774246798014341.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1019846...268
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((l32_0+l32_1)+(l32_2+l32_3))+((l32_4+l32_5)+(l32_6+l32_7)))+(((l32_8+l32_9)+(l32_10+l32_11))+((l32_12+l32_13)+(l32_14+l32...7008
Formula 0 simplified : !(F"(((((((l32_0+l32_1)+(l32_2+l32_3))+((l32_4+l32_5)+(l32_6+l32_7)))+(((l32_8+l32_9)+(l32_10+l32_11))+((l32_12+l32_13)+(l32_14+l32_...6997
Detected timeout of ITS tools.
[2022-05-16 11:59:54] [INFO ] Flatten gal took : 47 ms
[2022-05-16 11:59:54] [INFO ] Applying decomposition
[2022-05-16 11:59:54] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13867247687645425902.txt' '-o' '/tmp/graph13867247687645425902.bin' '-w' '/tmp/graph13867247687645425902.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13867247687645425902.bin' '-l' '-1' '-v' '-w' '/tmp/graph13867247687645425902.weights' '-q' '0' '-e' '0.001'
[2022-05-16 11:59:55] [INFO ] Decomposing Gal with order
[2022-05-16 11:59:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 11:59:56] [INFO ] Removed a total of 842 redundant transitions.
[2022-05-16 11:59:56] [INFO ] Flatten gal took : 911 ms
[2022-05-16 11:59:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 158 labels/synchronizations in 32 ms.
[2022-05-16 11:59:56] [INFO ] Time to serialize gal into /tmp/LTL5048252323411578213.gal : 16 ms
[2022-05-16 11:59:56] [INFO ] Time to serialize properties into /tmp/LTL12324094437719601814.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5048252323411578213.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12324094437719601814.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5048252...267
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((gu46.l32_0+gu46.l32_1)+(gu46.l32_2+gu46.l32_3))+((gu46.l32_4+gu46.l32_5)+(gu46.l32_6+gu46.l32_7)))+(((gu46.l32_8+gu46.l3...10838
Formula 0 simplified : !(F"(((((((gu46.l32_0+gu46.l32_1)+(gu46.l32_2+gu46.l32_3))+((gu46.l32_4+gu46.l32_5)+(gu46.l32_6+gu46.l32_7)))+(((gu46.l32_8+gu46.l32...10827
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3618579890310529573
[2022-05-16 12:00:11] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3618579890310529573
Running compilation step : cd /tmp/ltsmin3618579890310529573;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3618579890310529573;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3618579890310529573;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-04 finished in 89946 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(F((F(G((F(G(p0))||p1)))&&!p1)))))'
Support contains 613 out of 9354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9354/9354 places, 8827/8827 transitions.
Reduce places removed 7 places and 0 transitions.
Discarding 306 places :
Implicit places reduction removed 306 places
Iterating post reduction 0 with 313 rules applied. Total rules applied 313 place count 9041 transition count 8827
Discarding 461 places :
Symmetric choice reduction at 1 with 461 rule applications. Total rules 774 place count 8580 transition count 8366
Iterating global reduction 1 with 461 rules applied. Total rules applied 1235 place count 8580 transition count 8366
Discarding 357 places :
Symmetric choice reduction at 1 with 357 rule applications. Total rules 1592 place count 8223 transition count 8009
Iterating global reduction 1 with 357 rules applied. Total rules applied 1949 place count 8223 transition count 8009
Discarding 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 2056 place count 8116 transition count 7652
Iterating global reduction 1 with 107 rules applied. Total rules applied 2163 place count 8116 transition count 7652
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2214 place count 8065 transition count 7652
Applied a total of 2214 rules in 5307 ms. Remains 8065 /9354 variables (removed 1289) and now considering 7652/8827 (removed 1175) transitions.
// Phase 1: matrix 7652 rows 8065 cols
[2022-05-16 12:00:19] [INFO ] Computed 821 place invariants in 119 ms
[2022-05-16 12:00:20] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:00:21] [INFO ] Implicit Places using invariants in 2190 ms returned [898]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2197 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 8064/9354 places, 7652/8827 transitions.
Applied a total of 0 rules in 1210 ms. Remains 8064 /8064 variables (removed 0) and now considering 7652/7652 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 8064/9354 places, 7652/8827 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p1:(GT 2 (ADD s5255 s5256 s5257 s5258 s5259 s5260 s5261 s5262 s5263 s5264 s5265 s5266 s5267 s5268 s5269 s5270 s5271 s5272 s5273 s5274 s5275 s5276 s5277 s5...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 59 reset in 3328 ms.
Product exploration explored 100000 steps with 60 reset in 3356 ms.
Computed a total of 8064 stabilizing places and 7652 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8064 transition count 7652
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 345 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[p1, p1]
Finished random walk after 467 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=58 )
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 9 factoid took 303 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[p1]
Stuttering acceptance computed with spot in 24 ms :[p1]
// Phase 1: matrix 7652 rows 8064 cols
[2022-05-16 12:00:33] [INFO ] Computed 820 place invariants in 115 ms
Proved EG p1
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (G p1)]
Property proved to be false thanks to negative knowledge :(G p1)
Knowledge based reduction with 9 factoid took 650 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-05 finished in 30957 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 312 out of 9354 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9354/9354 places, 8827/8827 transitions.
Graph (complete) has 13005 edges and 9354 vertex of which 5826 are kept as prefixes of interest. Removing 3528 places using SCC suffix rule.10 ms
Discarding 3528 places :
Also discarding 3166 output transitions
Drop transitions removed 3166 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 306 places :
Implicit places reduction removed 306 places
Drop transitions removed 2805 transitions
Trivial Post-agglo rules discarded 2805 transitions
Performed 2805 trivial Post agglomeration. Transition count delta: 2805
Iterating post reduction 0 with 3111 rules applied. Total rules applied 3112 place count 5469 transition count 2805
Reduce places removed 2805 places and 0 transitions.
Performed 306 Post agglomeration using F-continuation condition.Transition count delta: 306
Iterating post reduction 1 with 3111 rules applied. Total rules applied 6223 place count 2664 transition count 2499
Reduce places removed 306 places and 0 transitions.
Iterating post reduction 2 with 306 rules applied. Total rules applied 6529 place count 2358 transition count 2499
Performed 357 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 357 Pre rules applied. Total rules applied 6529 place count 2358 transition count 2142
Deduced a syphon composed of 357 places in 0 ms
Ensure Unique test removed 306 places
Reduce places removed 663 places and 0 transitions.
Iterating global reduction 3 with 1020 rules applied. Total rules applied 7549 place count 1695 transition count 2142
Discarding 555 places :
Symmetric choice reduction at 3 with 555 rule applications. Total rules 8104 place count 1140 transition count 1587
Iterating global reduction 3 with 555 rules applied. Total rules applied 8659 place count 1140 transition count 1587
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 8659 place count 1140 transition count 1536
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 8761 place count 1089 transition count 1536
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 8811 place count 1039 transition count 1236
Iterating global reduction 3 with 50 rules applied. Total rules applied 8861 place count 1039 transition count 1236
Applied a total of 8861 rules in 274 ms. Remains 1039 /9354 variables (removed 8315) and now considering 1236/8827 (removed 7591) transitions.
// Phase 1: matrix 1236 rows 1039 cols
[2022-05-16 12:00:45] [INFO ] Computed 53 place invariants in 9 ms
[2022-05-16 12:00:46] [INFO ] Implicit Places using invariants in 332 ms returned [357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 1020]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 335 ms to find 52 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 987/9354 places, 1236/8827 transitions.
Drop transitions removed 306 transitions
Trivial Post-agglo rules discarded 306 transitions
Performed 306 trivial Post agglomeration. Transition count delta: 306
Iterating post reduction 0 with 306 rules applied. Total rules applied 306 place count 987 transition count 930
Reduce places removed 306 places and 0 transitions.
Iterating post reduction 1 with 306 rules applied. Total rules applied 612 place count 681 transition count 930
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 612 place count 681 transition count 924
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 624 place count 675 transition count 924
Applied a total of 624 rules in 20 ms. Remains 675 /987 variables (removed 312) and now considering 924/1236 (removed 312) transitions.
// Phase 1: matrix 924 rows 675 cols
[2022-05-16 12:00:46] [INFO ] Computed 1 place invariants in 9 ms
[2022-05-16 12:00:46] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 924 rows 675 cols
[2022-05-16 12:00:46] [INFO ] Computed 1 place invariants in 10 ms
[2022-05-16 12:00:46] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 675/9354 places, 924/8827 transitions.
Finished structural reductions, in 2 iterations. Remains : 675/9354 places, 924/8827 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s669 s670 s671 s672 s673 s674) (ADD s357 s358 s359 s360 s361 s362 s363 s364 s365 s366 s367 s368 s369 s370 s371 s372 s373 s374 s375 s376 s377 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 487 reset in 1389 ms.
Product exploration explored 100000 steps with 487 reset in 1420 ms.
Computed a total of 675 stabilizing places and 924 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 924
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 133 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=26 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
// Phase 1: matrix 924 rows 675 cols
[2022-05-16 12:00:50] [INFO ] Computed 1 place invariants in 16 ms
[2022-05-16 12:00:51] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-05-16 12:00:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 12:00:51] [INFO ] [Real]Absence check using state equation in 493 ms returned sat
[2022-05-16 12:00:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 12:00:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 23 ms returned sat
[2022-05-16 12:00:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 12:00:53] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2022-05-16 12:00:53] [INFO ] Computed and/alt/rep : 612/612/612 causal constraints (skipped 6 transitions) in 39 ms.
[2022-05-16 12:00:54] [INFO ] Added : 95 causal constraints over 19 iterations in 907 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 312 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 924/924 transitions.
Applied a total of 0 rules in 9 ms. Remains 675 /675 variables (removed 0) and now considering 924/924 (removed 0) transitions.
// Phase 1: matrix 924 rows 675 cols
[2022-05-16 12:00:54] [INFO ] Computed 1 place invariants in 9 ms
[2022-05-16 12:00:54] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 924 rows 675 cols
[2022-05-16 12:00:54] [INFO ] Computed 1 place invariants in 15 ms
[2022-05-16 12:00:54] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2022-05-16 12:00:54] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 924 rows 675 cols
[2022-05-16 12:00:54] [INFO ] Computed 1 place invariants in 7 ms
[2022-05-16 12:00:54] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 675/675 places, 924/924 transitions.
Computed a total of 675 stabilizing places and 924 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 924
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 143 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=23 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
// Phase 1: matrix 924 rows 675 cols
[2022-05-16 12:00:56] [INFO ] Computed 1 place invariants in 14 ms
[2022-05-16 12:00:57] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-05-16 12:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 12:00:57] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2022-05-16 12:00:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 12:00:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 23 ms returned sat
[2022-05-16 12:00:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 12:00:59] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2022-05-16 12:00:59] [INFO ] Computed and/alt/rep : 612/612/612 causal constraints (skipped 6 transitions) in 53 ms.
[2022-05-16 12:00:59] [INFO ] Added : 95 causal constraints over 19 iterations in 918 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 487 reset in 1365 ms.
Product exploration explored 100000 steps with 487 reset in 1411 ms.
Built C files in :
/tmp/ltsmin13686031532388484762
[2022-05-16 12:01:02] [INFO ] Computing symmetric may disable matrix : 924 transitions.
[2022-05-16 12:01:02] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 12:01:02] [INFO ] Computing symmetric may enable matrix : 924 transitions.
[2022-05-16 12:01:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 12:01:02] [INFO ] Computing Do-Not-Accords matrix : 924 transitions.
[2022-05-16 12:01:02] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 12:01:02] [INFO ] Built C files in 135ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13686031532388484762
Running compilation step : cd /tmp/ltsmin13686031532388484762;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2251 ms.
Running link step : cd /tmp/ltsmin13686031532388484762;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin13686031532388484762;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10262865511560123478.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 312 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 924/924 transitions.
Applied a total of 0 rules in 15 ms. Remains 675 /675 variables (removed 0) and now considering 924/924 (removed 0) transitions.
// Phase 1: matrix 924 rows 675 cols
[2022-05-16 12:01:17] [INFO ] Computed 1 place invariants in 15 ms
[2022-05-16 12:01:17] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 924 rows 675 cols
[2022-05-16 12:01:17] [INFO ] Computed 1 place invariants in 8 ms
[2022-05-16 12:01:18] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2022-05-16 12:01:18] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 924 rows 675 cols
[2022-05-16 12:01:18] [INFO ] Computed 1 place invariants in 10 ms
[2022-05-16 12:01:18] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 675/675 places, 924/924 transitions.
Built C files in :
/tmp/ltsmin8598981161604889954
[2022-05-16 12:01:18] [INFO ] Computing symmetric may disable matrix : 924 transitions.
[2022-05-16 12:01:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 12:01:18] [INFO ] Computing symmetric may enable matrix : 924 transitions.
[2022-05-16 12:01:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 12:01:18] [INFO ] Computing Do-Not-Accords matrix : 924 transitions.
[2022-05-16 12:01:18] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 12:01:18] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8598981161604889954
Running compilation step : cd /tmp/ltsmin8598981161604889954;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2317 ms.
Running link step : cd /tmp/ltsmin8598981161604889954;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin8598981161604889954;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13497372017496569680.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 12:01:33] [INFO ] Flatten gal took : 18 ms
[2022-05-16 12:01:33] [INFO ] Flatten gal took : 17 ms
[2022-05-16 12:01:33] [INFO ] Time to serialize gal into /tmp/LTL10170683568277610592.gal : 3 ms
[2022-05-16 12:01:33] [INFO ] Time to serialize properties into /tmp/LTL12638950559200089727.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10170683568277610592.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12638950559200089727.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1017068...268
Read 1 LTL properties
Checking formula 0 : !((F(G("((((m11_0+m11_1)+(m11_2+m11_3))+(m11_4+m11_5))>(((((((((m6_0+m6_1)+(m6_2+m6_3))+((m6_4+m6_5)+(m6_6+m6_7)))+(((m6_8+m6_9)+(m6_1...2723
Formula 0 simplified : !FG"((((m11_0+m11_1)+(m11_2+m11_3))+(m11_4+m11_5))>(((((((((m6_0+m6_1)+(m6_2+m6_3))+((m6_4+m6_5)+(m6_6+m6_7)))+(((m6_8+m6_9)+(m6_10+...2717
Detected timeout of ITS tools.
[2022-05-16 12:01:48] [INFO ] Flatten gal took : 20 ms
[2022-05-16 12:01:48] [INFO ] Applying decomposition
[2022-05-16 12:01:48] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18060631509368502003.txt' '-o' '/tmp/graph18060631509368502003.bin' '-w' '/tmp/graph18060631509368502003.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18060631509368502003.bin' '-l' '-1' '-v' '-w' '/tmp/graph18060631509368502003.weights' '-q' '0' '-e' '0.001'
[2022-05-16 12:01:49] [INFO ] Decomposing Gal with order
[2022-05-16 12:01:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 12:01:49] [INFO ] Removed a total of 200 redundant transitions.
[2022-05-16 12:01:49] [INFO ] Flatten gal took : 207 ms
[2022-05-16 12:01:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 204 labels/synchronizations in 13 ms.
[2022-05-16 12:01:49] [INFO ] Time to serialize gal into /tmp/LTL14615380997584346214.gal : 3 ms
[2022-05-16 12:01:49] [INFO ] Time to serialize properties into /tmp/LTL3867259648568122667.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14615380997584346214.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3867259648568122667.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1461538...267
Read 1 LTL properties
Checking formula 0 : !((F(G("((((gu51.m11_0+gu51.m11_1)+(gu51.m11_2+gu51.m11_3))+(gu51.m11_4+gu51.m11_5))>(((((((((gu51.m6_0+gu51.m6_1)+(gu51.m6_2+gu51.m6_...4283
Formula 0 simplified : !FG"((((gu51.m11_0+gu51.m11_1)+(gu51.m11_2+gu51.m11_3))+(gu51.m11_4+gu51.m11_5))>(((((((((gu51.m6_0+gu51.m6_1)+(gu51.m6_2+gu51.m6_3)...4277
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12512154009219282207
[2022-05-16 12:02:04] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12512154009219282207
Running compilation step : cd /tmp/ltsmin12512154009219282207;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1270 ms.
Running link step : cd /tmp/ltsmin12512154009219282207;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12512154009219282207;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-06 finished in 94051 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 54 out of 9354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9354/9354 places, 8827/8827 transitions.
Reduce places removed 7 places and 0 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Iterating post reduction 0 with 619 rules applied. Total rules applied 619 place count 8735 transition count 8827
Discarding 713 places :
Symmetric choice reduction at 1 with 713 rule applications. Total rules 1332 place count 8022 transition count 8114
Iterating global reduction 1 with 713 rules applied. Total rules applied 2045 place count 8022 transition count 8114
Discarding 357 places :
Symmetric choice reduction at 1 with 357 rule applications. Total rules 2402 place count 7665 transition count 7757
Iterating global reduction 1 with 357 rules applied. Total rules applied 2759 place count 7665 transition count 7757
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 2764 place count 7660 transition count 7502
Iterating global reduction 1 with 5 rules applied. Total rules applied 2769 place count 7660 transition count 7502
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2820 place count 7609 transition count 7502
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3075 place count 7354 transition count 7247
Iterating global reduction 2 with 255 rules applied. Total rules applied 3330 place count 7354 transition count 7247
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3585 place count 7099 transition count 6992
Iterating global reduction 2 with 255 rules applied. Total rules applied 3840 place count 7099 transition count 6992
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4095 place count 6844 transition count 6737
Iterating global reduction 2 with 255 rules applied. Total rules applied 4350 place count 6844 transition count 6737
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4605 place count 6589 transition count 6482
Iterating global reduction 2 with 255 rules applied. Total rules applied 4860 place count 6589 transition count 6482
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5115 place count 6334 transition count 6227
Iterating global reduction 2 with 255 rules applied. Total rules applied 5370 place count 6334 transition count 6227
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5625 place count 6079 transition count 5972
Iterating global reduction 2 with 255 rules applied. Total rules applied 5880 place count 6079 transition count 5972
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6135 place count 5824 transition count 5717
Iterating global reduction 2 with 255 rules applied. Total rules applied 6390 place count 5824 transition count 5717
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6645 place count 5569 transition count 5462
Iterating global reduction 2 with 255 rules applied. Total rules applied 6900 place count 5569 transition count 5462
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7155 place count 5314 transition count 5207
Iterating global reduction 2 with 255 rules applied. Total rules applied 7410 place count 5314 transition count 5207
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7665 place count 5059 transition count 4952
Iterating global reduction 2 with 255 rules applied. Total rules applied 7920 place count 5059 transition count 4952
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8175 place count 4804 transition count 4697
Iterating global reduction 2 with 255 rules applied. Total rules applied 8430 place count 4804 transition count 4697
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8685 place count 4549 transition count 4442
Iterating global reduction 2 with 255 rules applied. Total rules applied 8940 place count 4549 transition count 4442
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 9195 place count 4294 transition count 4187
Iterating global reduction 2 with 255 rules applied. Total rules applied 9450 place count 4294 transition count 4187
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 306 rules applied. Total rules applied 9756 place count 4243 transition count 3932
Applied a total of 9756 rules in 14784 ms. Remains 4243 /9354 variables (removed 5111) and now considering 3932/8827 (removed 4895) transitions.
// Phase 1: matrix 3932 rows 4243 cols
[2022-05-16 12:02:34] [INFO ] Computed 464 place invariants in 43 ms
[2022-05-16 12:02:35] [INFO ] Implicit Places using invariants in 1003 ms returned [1711, 1717, 1723, 2553]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 1009 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4239/9354 places, 3932/8827 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 4234 transition count 3927
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 4234 transition count 3927
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 4232 transition count 3923
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 4232 transition count 3923
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 4230 transition count 3921
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 4230 transition count 3921
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 4228 transition count 3919
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 4228 transition count 3919
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 4226 transition count 3917
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 4226 transition count 3917
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 4224 transition count 3915
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 4224 transition count 3915
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 4222 transition count 3913
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 4222 transition count 3913
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 4220 transition count 3911
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 4220 transition count 3911
Applied a total of 38 rules in 3360 ms. Remains 4220 /4239 variables (removed 19) and now considering 3911/3932 (removed 21) transitions.
// Phase 1: matrix 3911 rows 4220 cols
[2022-05-16 12:02:38] [INFO ] Computed 460 place invariants in 44 ms
[2022-05-16 12:02:39] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:02:39] [INFO ] Implicit Places using invariants in 1026 ms returned [2515, 2516]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1029 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4218/9354 places, 3911/8827 transitions.
Applied a total of 0 rules in 362 ms. Remains 4218 /4218 variables (removed 0) and now considering 3911/3911 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 4218/9354 places, 3911/8827 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s766 s767 s768 s769 s770 s771 s772 s773 s774 s775 s776 s777 s778 s779 s780 s781 s782 s783 s784 s785 s786 s787 s788 s789 s790 s791 s792 s793 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2976 ms.
Product exploration explored 100000 steps with 50000 reset in 3015 ms.
Computed a total of 4218 stabilizing places and 3911 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4218 transition count 3911
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 79 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-07 finished in 27645 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(F(p0)))))'
Support contains 204 out of 9354 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9354/9354 places, 8827/8827 transitions.
Graph (complete) has 13005 edges and 9354 vertex of which 8269 are kept as prefixes of interest. Removing 1085 places using SCC suffix rule.10 ms
Discarding 1085 places :
Also discarding 1024 output transitions
Drop transitions removed 1024 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Drop transitions removed 5151 transitions
Trivial Post-agglo rules discarded 5151 transitions
Performed 5151 trivial Post agglomeration. Transition count delta: 5151
Iterating post reduction 0 with 5763 rules applied. Total rules applied 5764 place count 7606 transition count 2601
Reduce places removed 5151 places and 0 transitions.
Iterating post reduction 1 with 5151 rules applied. Total rules applied 10915 place count 2455 transition count 2601
Performed 408 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 408 Pre rules applied. Total rules applied 10915 place count 2455 transition count 2193
Deduced a syphon composed of 408 places in 1 ms
Ensure Unique test removed 102 places
Reduce places removed 510 places and 0 transitions.
Iterating global reduction 2 with 918 rules applied. Total rules applied 11833 place count 1945 transition count 2193
Discarding 204 places :
Implicit places reduction removed 204 places
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Iterating post reduction 2 with 357 rules applied. Total rules applied 12190 place count 1741 transition count 2040
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 3 with 153 rules applied. Total rules applied 12343 place count 1588 transition count 2040
Discarding 362 places :
Symmetric choice reduction at 4 with 362 rule applications. Total rules 12705 place count 1226 transition count 1428
Iterating global reduction 4 with 362 rules applied. Total rules applied 13067 place count 1226 transition count 1428
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 4 with 102 rules applied. Total rules applied 13169 place count 1175 transition count 1377
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 5 with 51 rules applied. Total rules applied 13220 place count 1124 transition count 1377
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 102 Pre rules applied. Total rules applied 13220 place count 1124 transition count 1275
Deduced a syphon composed of 102 places in 0 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 6 with 204 rules applied. Total rules applied 13424 place count 1022 transition count 1275
Discarding 255 places :
Symmetric choice reduction at 6 with 255 rule applications. Total rules 13679 place count 767 transition count 1020
Iterating global reduction 6 with 255 rules applied. Total rules applied 13934 place count 767 transition count 1020
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 6 with 255 rules applied. Total rules applied 14189 place count 767 transition count 765
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 51 Pre rules applied. Total rules applied 14189 place count 767 transition count 714
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 7 with 153 rules applied. Total rules applied 14342 place count 665 transition count 714
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 14444 place count 614 transition count 663
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 7 with 51 rules applied. Total rules applied 14495 place count 563 transition count 612
Applied a total of 14495 rules in 262 ms. Remains 563 /9354 variables (removed 8791) and now considering 612/8827 (removed 8215) transitions.
// Phase 1: matrix 612 rows 563 cols
[2022-05-16 12:02:47] [INFO ] Computed 53 place invariants in 7 ms
[2022-05-16 12:02:47] [INFO ] Implicit Places using invariants in 192 ms returned [51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 460]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 194 ms to find 53 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 510/9354 places, 612/8827 transitions.
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 51 Pre rules applied. Total rules applied 0 place count 510 transition count 561
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 0 with 102 rules applied. Total rules applied 102 place count 459 transition count 561
Applied a total of 102 rules in 7 ms. Remains 459 /510 variables (removed 51) and now considering 561/612 (removed 51) transitions.
// Phase 1: matrix 561 rows 459 cols
[2022-05-16 12:02:47] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 12:02:47] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 561 rows 459 cols
[2022-05-16 12:02:47] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 12:02:47] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 459/9354 places, 561/8827 transitions.
Finished structural reductions, in 2 iterations. Remains : 459/9354 places, 561/8827 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s228 s229 s230 s231 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1432 steps with 65 reset in 15 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-08 finished in 787 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((!(p0 U X(p0))||X((F(p1)||p2))) U p3))'
Support contains 1020 out of 9354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9354/9354 places, 8827/8827 transitions.
Reduce places removed 7 places and 0 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Iterating post reduction 0 with 619 rules applied. Total rules applied 619 place count 8735 transition count 8827
Discarding 614 places :
Symmetric choice reduction at 1 with 614 rule applications. Total rules 1233 place count 8121 transition count 8213
Iterating global reduction 1 with 614 rules applied. Total rules applied 1847 place count 8121 transition count 8213
Discarding 255 places :
Symmetric choice reduction at 1 with 255 rule applications. Total rules 2102 place count 7866 transition count 7958
Iterating global reduction 1 with 255 rules applied. Total rules applied 2357 place count 7866 transition count 7958
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 2362 place count 7861 transition count 7703
Iterating global reduction 1 with 5 rules applied. Total rules applied 2367 place count 7861 transition count 7703
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2418 place count 7810 transition count 7703
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 2673 place count 7555 transition count 7448
Iterating global reduction 2 with 255 rules applied. Total rules applied 2928 place count 7555 transition count 7448
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3183 place count 7300 transition count 7193
Iterating global reduction 2 with 255 rules applied. Total rules applied 3438 place count 7300 transition count 7193
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3693 place count 7045 transition count 6938
Iterating global reduction 2 with 255 rules applied. Total rules applied 3948 place count 7045 transition count 6938
Applied a total of 3948 rules in 6724 ms. Remains 7045 /9354 variables (removed 2309) and now considering 6938/8827 (removed 1889) transitions.
// Phase 1: matrix 6938 rows 7045 cols
[2022-05-16 12:02:54] [INFO ] Computed 515 place invariants in 94 ms
[2022-05-16 12:02:55] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:02:56] [INFO ] Implicit Places using invariants in 1723 ms returned [898, 5133]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1728 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7043/9354 places, 6938/8827 transitions.
Applied a total of 0 rules in 765 ms. Remains 7043 /7043 variables (removed 0) and now considering 6938/6938 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7043/9354 places, 6938/8827 transitions.
Stuttering acceptance computed with spot in 309 ms :[true, p3, (OR (AND (NOT p0) p3) (AND p1 p3)), p1, (OR (AND (NOT p0) p3) (AND p1 p3) (AND p2 p3)), (OR (AND (NOT p0) p3) (AND p2 p3) (AND p1 p3)), (AND p1 p3), (OR (NOT p0) p1)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p3, acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND (NOT p0) p3) (AND p3 p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p3 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p3) p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND p3 p2) (AND p3 p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p3 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(OR (AND p0 (NOT p3) p2) (AND p0 (NOT p3) p1)), acceptance={} source=4 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p0) (NOT p3) p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) p3 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(OR (AND (NOT p0) p3) (AND p3 p2) (AND p3 p1)), acceptance={} source=5 dest: 0}, { cond=(AND p0 p3 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(OR (AND p0 (NOT p3) p2) (AND p0 (NOT p3) p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND p3 p1), acceptance={} source=6 dest: 0}, { cond=(AND p3 (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p3) p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=6 dest: 6}], [{ cond=(OR (NOT p0) p1), acceptance={} source=7 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 3}]], initial=1, aps=[p3:(GT (ADD s3520 s3521 s3522 s3523 s3524 s3525 s3526 s3527 s3528 s3529 s3530 s3531 s3532 s3533 s3534 s3535 s3536 s3537 s3538 s3539 s3540 s3541 s3542 s354...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 230 steps with 0 reset in 17 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-09 finished in 9583 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 306 out of 9354 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9354/9354 places, 8827/8827 transitions.
Graph (complete) has 13005 edges and 9354 vertex of which 1683 are kept as prefixes of interest. Removing 7671 places using SCC suffix rule.9 ms
Discarding 7671 places :
Also discarding 6940 output transitions
Drop transitions removed 6940 transitions
Reduce places removed 51 places and 51 transitions.
Drop transitions removed 612 transitions
Trivial Post-agglo rules discarded 612 transitions
Performed 612 trivial Post agglomeration. Transition count delta: 612
Iterating post reduction 0 with 612 rules applied. Total rules applied 613 place count 1632 transition count 1224
Reduce places removed 612 places and 0 transitions.
Iterating post reduction 1 with 612 rules applied. Total rules applied 1225 place count 1020 transition count 1224
Applied a total of 1225 rules in 44 ms. Remains 1020 /9354 variables (removed 8334) and now considering 1224/8827 (removed 7603) transitions.
// Phase 1: matrix 1224 rows 1020 cols
[2022-05-16 12:02:57] [INFO ] Computed 51 place invariants in 5 ms
[2022-05-16 12:02:57] [INFO ] Implicit Places using invariants in 301 ms returned [357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407]
Discarding 51 places :
Implicit Place search using SMT only with invariants took 303 ms to find 51 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 969/9354 places, 1224/8827 transitions.
Drop transitions removed 306 transitions
Trivial Post-agglo rules discarded 306 transitions
Performed 306 trivial Post agglomeration. Transition count delta: 306
Iterating post reduction 0 with 306 rules applied. Total rules applied 306 place count 969 transition count 918
Reduce places removed 306 places and 0 transitions.
Iterating post reduction 1 with 306 rules applied. Total rules applied 612 place count 663 transition count 918
Applied a total of 612 rules in 12 ms. Remains 663 /969 variables (removed 306) and now considering 918/1224 (removed 306) transitions.
// Phase 1: matrix 918 rows 663 cols
[2022-05-16 12:02:57] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 12:02:57] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 918 rows 663 cols
[2022-05-16 12:02:57] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 12:02:58] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 663/9354 places, 918/8827 transitions.
Finished structural reductions, in 2 iterations. Remains : 663/9354 places, 918/8827 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s357 s358 s359 s360 s361 s362 s363 s364 s365 s366 s367 s368 s369 s370 s371 s372 s373 s374 s375 s376 s377 s378 s379 s380 s381 s382 s383 s384...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2811 reset in 1699 ms.
Product exploration explored 100000 steps with 2814 reset in 1702 ms.
Computed a total of 663 stabilizing places and 918 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 663 transition count 918
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 39 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 132 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
// Phase 1: matrix 918 rows 663 cols
[2022-05-16 12:03:02] [INFO ] Computed 0 place invariants in 1 ms
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-11 finished in 6333 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))&&F(X(p1))))'
Support contains 408 out of 9354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9354/9354 places, 8827/8827 transitions.
Reduce places removed 7 places and 0 transitions.
Discarding 306 places :
Implicit places reduction removed 306 places
Iterating post reduction 0 with 313 rules applied. Total rules applied 313 place count 9041 transition count 8827
Discarding 716 places :
Symmetric choice reduction at 1 with 716 rule applications. Total rules 1029 place count 8325 transition count 8111
Iterating global reduction 1 with 716 rules applied. Total rules applied 1745 place count 8325 transition count 8111
Discarding 357 places :
Symmetric choice reduction at 1 with 357 rule applications. Total rules 2102 place count 7968 transition count 7754
Iterating global reduction 1 with 357 rules applied. Total rules applied 2459 place count 7968 transition count 7754
Discarding 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 2566 place count 7861 transition count 7397
Iterating global reduction 1 with 107 rules applied. Total rules applied 2673 place count 7861 transition count 7397
Discarding 255 places :
Symmetric choice reduction at 1 with 255 rule applications. Total rules 2928 place count 7606 transition count 7142
Iterating global reduction 1 with 255 rules applied. Total rules applied 3183 place count 7606 transition count 7142
Applied a total of 3183 rules in 6373 ms. Remains 7606 /9354 variables (removed 1748) and now considering 7142/8827 (removed 1685) transitions.
// Phase 1: matrix 7142 rows 7606 cols
[2022-05-16 12:03:10] [INFO ] Computed 872 place invariants in 105 ms
[2022-05-16 12:03:10] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:03:12] [INFO ] Implicit Places using invariants in 2011 ms returned [5977, 5984, 6010]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 2015 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7603/9354 places, 7142/8827 transitions.
Applied a total of 0 rules in 1129 ms. Remains 7603 /7603 variables (removed 0) and now considering 7142/7142 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7603/9354 places, 7142/8827 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s5565 s5566 s5567 s5568 s5569 s5570 s5571 s5572 s5573 s5574 s5575 s5576 s5577 s5578 s5579 s5580 s5581 s5582 s5583 s5584 s5585 s5586 s5587 s55...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 4444 ms.
Product exploration explored 100000 steps with 33333 reset in 4453 ms.
Computed a total of 7603 stabilizing places and 7142 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7603 transition count 7142
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 6 factoid took 127 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-12 finished in 21006 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(p1)) U p1))'
Support contains 51 out of 9354 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 9354/9354 places, 8827/8827 transitions.
Graph (complete) has 13005 edges and 9354 vertex of which 8934 are kept as prefixes of interest. Removing 420 places using SCC suffix rule.12 ms
Discarding 420 places :
Also discarding 412 output transitions
Drop transitions removed 412 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Drop transitions removed 4794 transitions
Trivial Post-agglo rules discarded 4794 transitions
Performed 4794 trivial Post agglomeration. Transition count delta: 4794
Iterating post reduction 0 with 5406 rules applied. Total rules applied 5407 place count 8271 transition count 3570
Reduce places removed 4794 places and 0 transitions.
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 357
Iterating post reduction 1 with 5151 rules applied. Total rules applied 10558 place count 3477 transition count 3213
Reduce places removed 357 places and 0 transitions.
Iterating post reduction 2 with 357 rules applied. Total rules applied 10915 place count 3120 transition count 3213
Performed 765 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 765 Pre rules applied. Total rules applied 10915 place count 3120 transition count 2448
Deduced a syphon composed of 765 places in 1 ms
Ensure Unique test removed 306 places
Reduce places removed 1071 places and 0 transitions.
Iterating global reduction 3 with 1836 rules applied. Total rules applied 12751 place count 2049 transition count 2448
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 3 with 204 rules applied. Total rules applied 12955 place count 2049 transition count 2244
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 4 with 204 rules applied. Total rules applied 13159 place count 1845 transition count 2244
Discarding 357 places :
Symmetric choice reduction at 5 with 357 rule applications. Total rules 13516 place count 1488 transition count 1887
Iterating global reduction 5 with 357 rules applied. Total rules applied 13873 place count 1488 transition count 1887
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 5 with 204 rules applied. Total rules applied 14077 place count 1437 transition count 1734
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 6 with 51 rules applied. Total rules applied 14128 place count 1386 transition count 1734
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 51 Pre rules applied. Total rules applied 14128 place count 1386 transition count 1683
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 14230 place count 1335 transition count 1683
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 7 with 204 rules applied. Total rules applied 14434 place count 1233 transition count 1581
Applied a total of 14434 rules in 366 ms. Remains 1233 /9354 variables (removed 8121) and now considering 1581/8827 (removed 7246) transitions.
// Phase 1: matrix 1581 rows 1233 cols
[2022-05-16 12:03:25] [INFO ] Computed 157 place invariants in 17 ms
[2022-05-16 12:03:25] [INFO ] Implicit Places using invariants in 548 ms returned [357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 459, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 1079, 1080, 1081, 1082, 1083, 1084, 1085, 1086, 1087, 1088, 1089, 1090, 1091, 1092, 1093, 1094, 1095, 1096, 1097, 1098, 1099, 1100, 1101, 1102, 1103, 1104, 1105, 1106, 1107, 1108, 1109, 1110, 1111, 1112, 1113, 1114, 1115, 1116, 1117, 1118, 1119, 1120, 1121, 1122, 1123, 1124, 1125, 1126, 1127, 1128, 1129, 1232]
Discarding 155 places :
Implicit Place search using SMT only with invariants took 550 ms to find 155 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1078/9354 places, 1581/8827 transitions.
Drop transitions removed 357 transitions
Trivial Post-agglo rules discarded 357 transitions
Performed 357 trivial Post agglomeration. Transition count delta: 357
Iterating post reduction 0 with 357 rules applied. Total rules applied 357 place count 1078 transition count 1224
Reduce places removed 357 places and 0 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 1 with 408 rules applied. Total rules applied 765 place count 721 transition count 1173
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 2 with 51 rules applied. Total rules applied 816 place count 670 transition count 1173
Applied a total of 816 rules in 23 ms. Remains 670 /1078 variables (removed 408) and now considering 1173/1581 (removed 408) transitions.
// Phase 1: matrix 1173 rows 670 cols
[2022-05-16 12:03:25] [INFO ] Computed 2 place invariants in 14 ms
[2022-05-16 12:03:25] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 1173 rows 670 cols
[2022-05-16 12:03:25] [INFO ] Computed 2 place invariants in 7 ms
[2022-05-16 12:03:26] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 670/9354 places, 1173/8827 transitions.
Finished structural reductions, in 2 iterations. Remains : 670/9354 places, 1173/8827 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(LEQ 2 (ADD s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 604 steps with 2 reset in 9 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-13 finished in 1525 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U !(G(p1) U (G(p2)&&p0))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2022-05-16 12:03:26] [INFO ] Flatten gal took : 220 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5174717927292414195
[2022-05-16 12:03:26] [INFO ] Too many transitions (8827) to apply POR reductions. Disabling POR matrices.
[2022-05-16 12:03:26] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5174717927292414195
Running compilation step : cd /tmp/ltsmin5174717927292414195;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 12:03:27] [INFO ] Applying decomposition
[2022-05-16 12:03:27] [INFO ] Flatten gal took : 225 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3735459037244211008.txt' '-o' '/tmp/graph3735459037244211008.bin' '-w' '/tmp/graph3735459037244211008.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3735459037244211008.bin' '-l' '-1' '-v' '-w' '/tmp/graph3735459037244211008.weights' '-q' '0' '-e' '0.001'
[2022-05-16 12:03:28] [INFO ] Decomposing Gal with order
[2022-05-16 12:03:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 12:03:33] [INFO ] Removed a total of 2143 redundant transitions.
[2022-05-16 12:03:33] [INFO ] Flatten gal took : 1295 ms
[2022-05-16 12:03:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 1059 labels/synchronizations in 246 ms.
[2022-05-16 12:03:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality13052576600955764047.gal : 62 ms
[2022-05-16 12:03:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality4507086970821802149.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13052576600955764047.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4507086970821802149.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 2 LTL properties
Checking formula 0 : !(((F("(((((((gi24.gi1.gi3.gi13.gu743.l32_0+gi24.gi1.gi3.gi13.gu743.l32_1)+(gi24.gi1.gi3.gi13.gu743.l32_2+gi24.gi1.gi3.gi13.gu743.l32_...15639
Formula 0 simplified : !(F"(((((((gi24.gi1.gi3.gi13.gu743.l32_0+gi24.gi1.gi3.gi13.gu743.l32_1)+(gi24.gi1.gi3.gi13.gu743.l32_2+gi24.gi1.gi3.gi13.gu743.l32_3...15628
Compilation finished in 50495 ms.
Running link step : cd /tmp/ltsmin5174717927292414195;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 83 ms.
Running LTSmin : cd /tmp/ltsmin5174717927292414195;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>((LTLAPp0==true)) U !([]((LTLAPp1==true)) U ([]((LTLAPp2==true))&&(LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-16 12:25:32] [INFO ] Applying decomposition
[2022-05-16 12:25:33] [INFO ] Flatten gal took : 443 ms
[2022-05-16 12:25:33] [INFO ] Decomposing Gal with order
[2022-05-16 12:25:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 12:25:40] [INFO ] Removed a total of 3182 redundant transitions.
[2022-05-16 12:25:40] [INFO ] Flatten gal took : 1141 ms
[2022-05-16 12:25:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 72 ms.
[2022-05-16 12:25:42] [INFO ] Time to serialize gal into /tmp/LTLCardinality13874665577352185643.gal : 989 ms
[2022-05-16 12:25:42] [INFO ] Time to serialize properties into /tmp/LTLCardinality6420490495344850394.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13874665577352185643.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6420490495344850394.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 2 LTL properties
Checking formula 0 : !(((F("(((((((gLegalResident0.l32_0+gLegalResident1.l32_1)+(gLegalResident2.l32_2+gLegalResident3.l32_3))+((gLegalResident4.l32_4+gLeg...26295
Formula 0 simplified : !(F"(((((((gLegalResident0.l32_0+gLegalResident1.l32_1)+(gLegalResident2.l32_2+gLegalResident3.l32_3))+((gLegalResident4.l32_4+gLega...26284
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin5174717927292414195;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>((LTLAPp0==true)) U !([]((LTLAPp1==true)) U ([]((LTLAPp2==true))&&(LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5174717927292414195;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-16 12:47:40] [INFO ] Flatten gal took : 1093 ms
[2022-05-16 12:47:41] [INFO ] Input system was already deterministic with 8827 transitions.
[2022-05-16 12:47:41] [INFO ] Transformed 9354 places.
[2022-05-16 12:47:41] [INFO ] Transformed 8827 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 12:48:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality14426829659583651846.gal : 37 ms
[2022-05-16 12:48:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality4516890429587944447.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14426829659583651846.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4516890429587944447.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...334
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F("(((((((l32_0+l32_1)+(l32_2+l32_3))+((l32_4+l32_5)+(l32_6+l32_7)))+(((l32_8+l32_9)+(l32_10+l32_11))+((l32_12+l32_13)+(l32_14+l32...7008
Formula 0 simplified : !(F"(((((((l32_0+l32_1)+(l32_2+l32_3))+((l32_4+l32_5)+(l32_6+l32_7)))+(((l32_8+l32_9)+(l32_10+l32_11))+((l32_12+l32_13)+(l32_14+l32_...6997
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="FamilyReunion-COL-L00050M0005C002P002G001"
export BK_EXAMINATION="LTLCardinality"
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-4028"
echo " Executing tool itstools"
echo " Input is FamilyReunion-COL-L00050M0005C002P002G001, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-165260110600635"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00050M0005C002P002G001.tgz
mv FamilyReunion-COL-L00050M0005C002P002G001 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;