About the Execution of ITS-Tools for HirschbergSinclair-PT-40
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12038.123 | 3600000.00 | 12601655.00 | 2516.80 | TFFTFF?FFFF???TF | 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.r114-smll-165264477500324.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 HirschbergSinclair-PT-40, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477500324
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 8.6K Apr 29 16:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 29 16:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 29 16:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 16:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K May 9 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 9 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 9 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 580K May 10 09:34 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 HirschbergSinclair-PT-40-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652764219017
Running Version 202205111006
[2022-05-17 05:10:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-17 05:10:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 05:10:21] [INFO ] Load time of PNML (sax parser for PT used): 250 ms
[2022-05-17 05:10:21] [INFO ] Transformed 1068 places.
[2022-05-17 05:10:21] [INFO ] Transformed 982 transitions.
[2022-05-17 05:10:21] [INFO ] Parsed PT model containing 1068 places and 982 transitions in 436 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HirschbergSinclair-PT-40-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-40-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-40-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 982/982 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 1028 transition count 982
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 80 place count 988 transition count 942
Iterating global reduction 1 with 40 rules applied. Total rules applied 120 place count 988 transition count 942
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 159 place count 949 transition count 903
Iterating global reduction 1 with 39 rules applied. Total rules applied 198 place count 949 transition count 903
Applied a total of 198 rules in 437 ms. Remains 949 /1068 variables (removed 119) and now considering 903/982 (removed 79) transitions.
// Phase 1: matrix 903 rows 949 cols
[2022-05-17 05:10:22] [INFO ] Computed 46 place invariants in 76 ms
[2022-05-17 05:10:23] [INFO ] Implicit Places using invariants in 1070 ms returned []
// Phase 1: matrix 903 rows 949 cols
[2022-05-17 05:10:23] [INFO ] Computed 46 place invariants in 10 ms
[2022-05-17 05:10:26] [INFO ] Implicit Places using invariants and state equation in 3217 ms returned []
Implicit Place search using SMT with State Equation took 4345 ms to find 0 implicit places.
// Phase 1: matrix 903 rows 949 cols
[2022-05-17 05:10:26] [INFO ] Computed 46 place invariants in 16 ms
[2022-05-17 05:10:27] [INFO ] Dead Transitions using invariants and state equation in 899 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 949/1068 places, 903/982 transitions.
Finished structural reductions, in 1 iterations. Remains : 949/1068 places, 903/982 transitions.
Support contains 38 out of 949 places after structural reductions.
[2022-05-17 05:10:27] [INFO ] Flatten gal took : 165 ms
[2022-05-17 05:10:27] [INFO ] Flatten gal took : 95 ms
[2022-05-17 05:10:27] [INFO ] Input system was already deterministic with 903 transitions.
Incomplete random walk after 10000 steps, including 10 resets, run finished after 533 ms. (steps per millisecond=18 ) properties (out of 28) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 903 rows 949 cols
[2022-05-17 05:10:28] [INFO ] Computed 46 place invariants in 8 ms
[2022-05-17 05:10:29] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 211 ms returned sat
[2022-05-17 05:10:30] [INFO ] After 1521ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 05:10:30] [INFO ] [Nat]Absence check using 0 positive and 46 generalized place invariants in 196 ms returned sat
[2022-05-17 05:10:31] [INFO ] After 902ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 05:10:31] [INFO ] After 1249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 270 ms.
[2022-05-17 05:10:32] [INFO ] After 2007ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 41 ms.
Support contains 6 out of 949 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 949/949 places, 903/903 transitions.
Graph (complete) has 1816 edges and 949 vertex of which 925 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.10 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 382 transitions
Trivial Post-agglo rules discarded 382 transitions
Performed 382 trivial Post agglomeration. Transition count delta: 382
Iterating post reduction 0 with 406 rules applied. Total rules applied 407 place count 925 transition count 497
Reduce places removed 382 places and 0 transitions.
Graph (complete) has 968 edges and 543 vertex of which 473 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.1 ms
Discarding 70 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 383 rules applied. Total rules applied 790 place count 473 transition count 497
Drop transitions removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 860 place count 473 transition count 427
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 862 place count 471 transition count 425
Iterating global reduction 3 with 2 rules applied. Total rules applied 864 place count 471 transition count 425
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 865 place count 471 transition count 424
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 822 edges and 470 vertex of which 469 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 867 place count 469 transition count 424
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 868 place count 469 transition count 423
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 6 with 14 rules applied. Total rules applied 882 place count 469 transition count 409
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 896 place count 455 transition count 409
Reduce places removed 37 places and 37 transitions.
Iterating global reduction 7 with 37 rules applied. Total rules applied 933 place count 418 transition count 372
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 7 with 183 rules applied. Total rules applied 1116 place count 395 transition count 212
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 8 with 160 rules applied. Total rules applied 1276 place count 235 transition count 212
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 24 Pre rules applied. Total rules applied 1276 place count 235 transition count 188
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 9 with 48 rules applied. Total rules applied 1324 place count 211 transition count 188
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1328 place count 209 transition count 186
Applied a total of 1328 rules in 236 ms. Remains 209 /949 variables (removed 740) and now considering 186/903 (removed 717) transitions.
Finished structural reductions, in 1 iterations. Remains : 209/949 places, 186/903 transitions.
Incomplete random walk after 10000 steps, including 52 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :1
Finished Best-First random walk after 594 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=297 )
FORMULA HirschbergSinclair-PT-40-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 949 stabilizing places and 903 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 949 transition count 903
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((F(X(X(p0)))||G(p1))))'
Support contains 4 out of 949 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 949/949 places, 903/903 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 948 transition count 902
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 948 transition count 902
Applied a total of 2 rules in 233 ms. Remains 948 /949 variables (removed 1) and now considering 902/903 (removed 1) transitions.
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:10:33] [INFO ] Computed 46 place invariants in 8 ms
[2022-05-17 05:10:34] [INFO ] Implicit Places using invariants in 756 ms returned []
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:10:34] [INFO ] Computed 46 place invariants in 7 ms
[2022-05-17 05:10:38] [INFO ] Implicit Places using invariants and state equation in 3773 ms returned []
Implicit Place search using SMT with State Equation took 4558 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:10:38] [INFO ] Computed 46 place invariants in 7 ms
[2022-05-17 05:10:39] [INFO ] Dead Transitions using invariants and state equation in 1099 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 948/949 places, 902/903 transitions.
Finished structural reductions, in 1 iterations. Remains : 948/949 places, 902/903 transitions.
Stuttering acceptance computed with spot in 375 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s946 1)), p1:(AND (GEQ s5 1) (GEQ s625 1))], 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, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 1109 ms.
Product exploration explored 100000 steps with 25000 reset in 910 ms.
Computed a total of 948 stabilizing places and 902 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 948 transition count 902
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 (NOT p1)), (X (NOT p1)), true, (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 6 factoid took 162 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA HirschbergSinclair-PT-40-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-40-LTLFireability-00 finished in 8940 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(G(X(G(p0)))))||((p0 U p1)&&p2))))'
Support contains 4 out of 949 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 949/949 places, 903/903 transitions.
Applied a total of 0 rules in 44 ms. Remains 949 /949 variables (removed 0) and now considering 903/903 (removed 0) transitions.
// Phase 1: matrix 903 rows 949 cols
[2022-05-17 05:10:42] [INFO ] Computed 46 place invariants in 6 ms
[2022-05-17 05:10:43] [INFO ] Implicit Places using invariants in 705 ms returned []
// Phase 1: matrix 903 rows 949 cols
[2022-05-17 05:10:43] [INFO ] Computed 46 place invariants in 7 ms
[2022-05-17 05:10:46] [INFO ] Implicit Places using invariants and state equation in 3553 ms returned []
Implicit Place search using SMT with State Equation took 4277 ms to find 0 implicit places.
// Phase 1: matrix 903 rows 949 cols
[2022-05-17 05:10:46] [INFO ] Computed 46 place invariants in 5 ms
[2022-05-17 05:10:47] [INFO ] Dead Transitions using invariants and state equation in 1199 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 949/949 places, 903/903 transitions.
Stuttering acceptance computed with spot in 471 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p2) (AND (NOT p1) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(GEQ s261 1), p1:(AND (GEQ s31 1) (GEQ s138 1)), p0:(GEQ s633 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, 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 3 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-LTLFireability-01 finished in 6037 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(X(X(p0)))))'
Support contains 1 out of 949 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 949/949 places, 903/903 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 948 transition count 902
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 948 transition count 902
Applied a total of 2 rules in 110 ms. Remains 948 /949 variables (removed 1) and now considering 902/903 (removed 1) transitions.
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:10:48] [INFO ] Computed 46 place invariants in 9 ms
[2022-05-17 05:10:49] [INFO ] Implicit Places using invariants in 841 ms returned []
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:10:49] [INFO ] Computed 46 place invariants in 6 ms
[2022-05-17 05:10:53] [INFO ] Implicit Places using invariants and state equation in 3955 ms returned []
Implicit Place search using SMT with State Equation took 4798 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:10:53] [INFO ] Computed 46 place invariants in 9 ms
[2022-05-17 05:10:54] [INFO ] Dead Transitions using invariants and state equation in 1157 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 948/949 places, 902/903 transitions.
Finished structural reductions, in 1 iterations. Remains : 948/949 places, 902/903 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LT s775 1)], 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, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 802 ms.
Product exploration explored 100000 steps with 33333 reset in 805 ms.
Computed a total of 948 stabilizing places and 902 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 948 transition count 902
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 (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA HirschbergSinclair-PT-40-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-40-LTLFireability-03 finished in 8230 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U F((G(X(X(X(p0))))&&p1))))'
Support contains 4 out of 949 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 949/949 places, 903/903 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 948 transition count 902
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 948 transition count 902
Applied a total of 2 rules in 108 ms. Remains 948 /949 variables (removed 1) and now considering 902/903 (removed 1) transitions.
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:10:56] [INFO ] Computed 46 place invariants in 5 ms
[2022-05-17 05:10:57] [INFO ] Implicit Places using invariants in 761 ms returned []
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:10:57] [INFO ] Computed 46 place invariants in 6 ms
[2022-05-17 05:11:01] [INFO ] Implicit Places using invariants and state equation in 3572 ms returned []
Implicit Place search using SMT with State Equation took 4354 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:11:01] [INFO ] Computed 46 place invariants in 5 ms
[2022-05-17 05:11:02] [INFO ] Dead Transitions using invariants and state equation in 1109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 948/949 places, 902/903 transitions.
Finished structural reductions, in 1 iterations. Remains : 948/949 places, 902/903 transitions.
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 4}, { cond=p1, acceptance={0} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 6}, { cond=p1, acceptance={0} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 6}, { cond=(AND p1 p0), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 4}, { cond=(AND p1 p0), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={0} source=6 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 6}, { cond=(AND p1 p0), acceptance={} source=7 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s21 1) (GEQ s548 1)), p0:(AND (GEQ s25 1) (GEQ s721 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 978 steps with 0 reset in 6 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-LTLFireability-04 finished in 5963 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U ((F(p3) U X(!p4))&&p2)))'
Support contains 6 out of 949 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 949/949 places, 903/903 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 948 transition count 902
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 948 transition count 902
Applied a total of 2 rules in 113 ms. Remains 948 /949 variables (removed 1) and now considering 902/903 (removed 1) transitions.
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:11:02] [INFO ] Computed 46 place invariants in 4 ms
[2022-05-17 05:11:03] [INFO ] Implicit Places using invariants in 824 ms returned []
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:11:03] [INFO ] Computed 46 place invariants in 6 ms
[2022-05-17 05:11:07] [INFO ] Implicit Places using invariants and state equation in 3651 ms returned []
Implicit Place search using SMT with State Equation took 4477 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:11:07] [INFO ] Computed 46 place invariants in 5 ms
[2022-05-17 05:11:08] [INFO ] Dead Transitions using invariants and state equation in 1057 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 948/949 places, 902/903 transitions.
Finished structural reductions, in 1 iterations. Remains : 948/949 places, 902/903 transitions.
Stuttering acceptance computed with spot in 529 ms :[(OR (NOT p2) p4), true, (NOT p1), (AND (NOT p3) p4), p4, (AND (NOT p1) p2 (NOT p3) p4), (AND (NOT p3) p4), p4, (NOT p3), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p3) p4))]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND p2 (NOT p3) (NOT p1) p0), acceptance={} source=0 dest: 5}, { cond=(OR (AND p2 (NOT p3) p1) (AND p2 (NOT p3) p0)), acceptance={} source=0 dest: 6}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) p4), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p3) p4), acceptance={} source=4 dest: 3}, { cond=p4, acceptance={} source=4 dest: 4}], [{ cond=(AND p2 (NOT p3) (NOT p1) (NOT p0) p4), acceptance={} source=5 dest: 8}, { cond=(AND p2 (NOT p3) (NOT p1) p0 p4), acceptance={} source=5 dest: 9}], [{ cond=(AND p2 (NOT p3) (NOT p1) (NOT p0) p4), acceptance={} source=6 dest: 3}, { cond=(AND p2 (NOT p3) (NOT p1) p0 p4), acceptance={} source=6 dest: 5}, { cond=(OR (AND p2 (NOT p3) p1 p4) (AND p2 (NOT p3) p0 p4)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0) p4), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0 p4), acceptance={} source=6 dest: 9}, { cond=(OR (AND (NOT p2) (NOT p3) p1 p4) (AND (NOT p2) (NOT p3) p0 p4)), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0) p4), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p4), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p3) (NOT p1) p0 p4), acceptance={} source=7 dest: 5}, { cond=(OR (AND (NOT p3) p1 p4) (AND (NOT p3) p0 p4)), acceptance={} source=7 dest: 6}, { cond=(OR (AND p1 p4) (AND p0 p4)), acceptance={} source=7 dest: 7}], [{ cond=(NOT p3), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=9 dest: 9}], [{ cond=(AND p2 (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=10 dest: 3}, { cond=(AND p2 (NOT p3) (NOT p1) p0), acceptance={} source=10 dest: 5}, { cond=(OR (AND p2 (NOT p3) p1) (AND p2 (NOT p3) p0)), acceptance={} source=10 dest: 6}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={} source=10 dest: 9}, { cond=(OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p3) p0)), acceptance={} source=10 dest: 10}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s84 1)), p1:(LT s823 1), p0:(GEQ s141 1), p3:(AND (GEQ s1 1) (GEQ s84 1)), p4:(AND (GEQ s141 1) (GEQ s77 1) (GEQ s262 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1592 reset in 873 ms.
Product exploration explored 100000 steps with 1627 reset in 895 ms.
Computed a total of 948 stabilizing places and 902 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 948 transition count 902
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 (NOT p2) p1 (NOT p0) (NOT p3) (NOT p4)), (X (NOT (AND (NOT p3) (NOT p1) p0 p4))), (X (NOT p4)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0) p4))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) p4))), (X (NOT (AND p2 (NOT p3) (NOT p1) p0 p4))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0 p4))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0) p4))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (OR (AND p1 p4) (AND p0 p4)))), (X (NOT (AND p2 (NOT p3) (NOT p1) p0))), (X (NOT (AND p2 (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (OR (AND p2 (NOT p3) p1) (AND p2 (NOT p3) p0)))), (X (NOT (OR (AND p2 (NOT p3) p1 p4) (AND p2 (NOT p3) p0 p4)))), (X (NOT (AND (NOT p1) (NOT p0) p4))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p3) p1 p4) (AND (NOT p3) p0 p4)))), (X (NOT (OR (AND p2 p1) (AND p2 p0)))), (X (NOT (AND p2 (NOT p3) (NOT p1) (NOT p0) p4))), (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0))), (X (NOT (OR (AND (NOT p2) (NOT p3) p1 p4) (AND (NOT p2) (NOT p3) p0 p4)))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0) p4)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p3) p4)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0) p4)))), (X (X (NOT (OR (AND p1 p4) (AND p0 p4))))), true, (X (X (NOT (AND (NOT p1) (NOT p0) p4)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) (NOT p3) p1 p4) (AND (NOT p2) (NOT p3) p0 p4))))), (X (X (NOT (AND (NOT p3) (NOT p1) p0 p4)))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1) p0 p4)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0 p4)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p3) p1) (AND p2 (NOT p3) p0))))), (X (X (NOT (OR (AND p2 (NOT p3) p1 p4) (AND p2 (NOT p3) p0 p4))))), (X (X (NOT (OR (AND (NOT p3) p1 p4) (AND (NOT p3) p0 p4))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1) (NOT p0) p4)))), (F (G (NOT p2))), (F (G p1)), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p4)))]
False Knowledge obtained : [(X (X (OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p3) p0))))), (X (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0))))), (X (X (NOT p3))), (X (X p3)), (X (X (OR (AND p2 p1) (AND p2 p0)))), (X (X (NOT (OR (AND p2 p1) (AND p2 p0)))))]
Knowledge based reduction with 55 factoid took 4172 ms. Reduced automaton from 11 states, 36 edges and 5 AP to 11 states, 36 edges and 5 AP.
Stuttering acceptance computed with spot in 468 ms :[(OR (NOT p2) p4), true, (NOT p1), (AND (NOT p3) p4), p4, (AND (NOT p1) p2 (NOT p3) p4), (AND (NOT p3) p4), p4, (NOT p3), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p3) p4))]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 589 ms. (steps per millisecond=16 ) properties (out of 29) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:11:16] [INFO ] Computed 46 place invariants in 8 ms
[2022-05-17 05:11:17] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 225 ms returned sat
[2022-05-17 05:11:17] [INFO ] After 680ms SMT Verify possible using all constraints in real domain returned unsat :9 sat :0 real:12
[2022-05-17 05:11:17] [INFO ] [Nat]Absence check using 0 positive and 46 generalized place invariants in 210 ms returned sat
[2022-05-17 05:11:20] [INFO ] After 2307ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :10
[2022-05-17 05:11:22] [INFO ] After 4049ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :10
Attempting to minimize the solution found.
Minimization took 980 ms.
[2022-05-17 05:11:22] [INFO ] After 5900ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :10
Fused 21 Parikh solutions to 8 different solutions.
Parikh walk visited 5 properties in 258 ms.
Support contains 4 out of 948 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 948/948 places, 902/902 transitions.
Graph (complete) has 1815 edges and 948 vertex of which 947 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 0 with 393 rules applied. Total rules applied 394 place count 947 transition count 509
Reduce places removed 392 places and 0 transitions.
Graph (complete) has 990 edges and 555 vertex of which 480 are kept as prefixes of interest. Removing 75 places using SCC suffix rule.1 ms
Discarding 75 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 393 rules applied. Total rules applied 787 place count 480 transition count 509
Drop transitions removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 2 with 75 rules applied. Total rules applied 862 place count 480 transition count 434
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 863 place count 479 transition count 433
Iterating global reduction 3 with 1 rules applied. Total rules applied 864 place count 479 transition count 433
Free-agglomeration rule (complex) applied 38 times.
Iterating global reduction 3 with 38 rules applied. Total rules applied 902 place count 479 transition count 395
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 940 place count 441 transition count 395
Reduce places removed 38 places and 38 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 978 place count 403 transition count 357
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 979 place count 402 transition count 357
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 979 place count 402 transition count 344
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 1005 place count 389 transition count 344
Applied a total of 1005 rules in 132 ms. Remains 389 /948 variables (removed 559) and now considering 344/902 (removed 558) transitions.
Finished structural reductions, in 1 iterations. Remains : 389/948 places, 344/902 transitions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 344 rows 389 cols
[2022-05-17 05:11:24] [INFO ] Computed 45 place invariants in 5 ms
[2022-05-17 05:11:24] [INFO ] [Real]Absence check using 0 positive and 45 generalized place invariants in 109 ms returned sat
[2022-05-17 05:11:24] [INFO ] After 437ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2022-05-17 05:11:24] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-17 05:11:25] [INFO ] After 77ms SMT Verify possible using 11 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 05:11:25] [INFO ] After 788ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 05:11:25] [INFO ] [Nat]Absence check using 0 positive and 45 generalized place invariants in 109 ms returned sat
[2022-05-17 05:11:25] [INFO ] After 429ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 05:11:26] [INFO ] After 322ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-17 05:11:26] [INFO ] After 634ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 318 ms.
[2022-05-17 05:11:26] [INFO ] After 1634ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 4 out of 389 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 389/389 places, 344/344 transitions.
Applied a total of 0 rules in 29 ms. Remains 389 /389 variables (removed 0) and now considering 344/344 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 389/389 places, 344/344 transitions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 4) seen :0
Finished probabilistic random walk after 52464 steps, run visited all 4 properties in 1056 ms. (steps per millisecond=49 )
Probabilistic random walk after 52464 steps, saw 16161 distinct states, run finished after 1056 ms. (steps per millisecond=49 ) properties seen :4
Found 11 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0) (NOT p3) (NOT p4)), (X (NOT (AND (NOT p3) (NOT p1) p0 p4))), (X (NOT p4)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0) p4))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) p4))), (X (NOT (AND p2 (NOT p3) (NOT p1) p0 p4))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0 p4))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0) p4))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (OR (AND p1 p4) (AND p0 p4)))), (X (NOT (AND p2 (NOT p3) (NOT p1) p0))), (X (NOT (AND p2 (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (OR (AND p2 (NOT p3) p1) (AND p2 (NOT p3) p0)))), (X (NOT (OR (AND p2 (NOT p3) p1 p4) (AND p2 (NOT p3) p0 p4)))), (X (NOT (AND (NOT p1) (NOT p0) p4))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p3) p1 p4) (AND (NOT p3) p0 p4)))), (X (NOT (OR (AND p2 p1) (AND p2 p0)))), (X (NOT (AND p2 (NOT p3) (NOT p1) (NOT p0) p4))), (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0))), (X (NOT (OR (AND (NOT p2) (NOT p3) p1 p4) (AND (NOT p2) (NOT p3) p0 p4)))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0) p4)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p3) p4)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0) p4)))), (X (X (NOT (OR (AND p1 p4) (AND p0 p4))))), true, (X (X (NOT (AND (NOT p1) (NOT p0) p4)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) (NOT p3) p1 p4) (AND (NOT p2) (NOT p3) p0 p4))))), (X (X (NOT (AND (NOT p3) (NOT p1) p0 p4)))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1) p0 p4)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0 p4)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p3) p1) (AND p2 (NOT p3) p0))))), (X (X (NOT (OR (AND p2 (NOT p3) p1 p4) (AND p2 (NOT p3) p0 p4))))), (X (X (NOT (OR (AND (NOT p3) p1 p4) (AND (NOT p3) p0 p4))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1) (NOT p0) p4)))), (F (G (NOT p2))), (F (G p1)), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p4))), (G (NOT (AND p2 (NOT p0) (NOT p1) (NOT p3)))), (G (NOT (OR (AND p2 p0 (NOT p3)) (AND p2 p1 (NOT p3))))), (G (NOT (AND p2 p0 (NOT p1) (NOT p3)))), (G (NOT (AND p4 p0 (NOT p1) (NOT p3)))), (G (NOT (AND (NOT p2) p4 (NOT p0) (NOT p1) (NOT p3)))), (G (NOT (OR (AND p2 p4 p0 (NOT p3)) (AND p2 p4 p1 (NOT p3))))), (G (NOT (AND p2 p4 p0 (NOT p1) (NOT p3)))), (G (NOT (AND p2 p4 (NOT p0) (NOT p1) (NOT p3)))), (G (NOT (AND p4 (NOT p0) (NOT p1)))), (G (NOT (AND p4 (NOT p0) (NOT p1) (NOT p3)))), (G (NOT (AND (NOT p2) p4 p0 (NOT p1) (NOT p3))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p3) p0))))), (X (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0))))), (X (X (NOT p3))), (X (X p3)), (X (X (OR (AND p2 p1) (AND p2 p0)))), (X (X (NOT (OR (AND p2 p1) (AND p2 p0))))), (F (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))), (F (AND p2 (NOT p0) (NOT p1))), (F (AND p0 (NOT p1) (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F p3), (F (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (F (NOT (OR (AND (NOT p2) p0 (NOT p3)) (AND (NOT p2) p1 (NOT p3))))), (F (AND (NOT p2) p0 (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND (NOT p2) p0 (NOT p1) (NOT p3))), (F (OR (AND p4 p0) (AND p4 p1))), (F (OR (AND p4 p0 (NOT p3)) (AND p4 p1 (NOT p3)))), (F (AND (NOT p0) (NOT p1))), (F (OR (AND p2 p0) (AND p2 p1))), (F (AND p0 (NOT p1))), (F (OR (AND (NOT p2) p4 p0 (NOT p3)) (AND (NOT p2) p4 p1 (NOT p3)))), (F p4), (F (AND p4 (NOT p3)))]
Knowledge based reduction with 66 factoid took 5257 ms. Reduced automaton from 11 states, 36 edges and 5 AP to 6 states, 11 edges and 5 AP.
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p2) (AND p0 (NOT p3)) (AND p3 p4) (AND p1 p4)), (OR (NOT p2) p4 p1 p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p4) (AND (NOT p1) p3) (AND p0 (NOT p1))), (AND p1 (NOT p3) p4), p4, (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p2) (AND p0 (NOT p3)) (AND p3 p4) (AND p1 p4)), (OR (NOT p2) p4 p1 p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p4) (AND (NOT p1) p3) (AND p0 (NOT p1))), (AND p1 (NOT p3) p4), p4, (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND p1 (NOT p3)))]
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:11:34] [INFO ] Computed 46 place invariants in 6 ms
[2022-05-17 05:11:35] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 217 ms returned sat
[2022-05-17 05:11:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 05:11:38] [INFO ] [Real]Absence check using state equation in 2906 ms returned sat
[2022-05-17 05:11:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 05:11:39] [INFO ] [Nat]Absence check using 0 positive and 46 generalized place invariants in 280 ms returned sat
[2022-05-17 05:11:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 05:11:53] [INFO ] [Nat]Absence check using state equation in 13787 ms returned unknown
Could not prove EG (NOT p2)
Support contains 6 out of 948 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 948/948 places, 902/902 transitions.
Applied a total of 0 rules in 40 ms. Remains 948 /948 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:11:53] [INFO ] Computed 46 place invariants in 5 ms
[2022-05-17 05:11:54] [INFO ] Implicit Places using invariants in 719 ms returned []
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:11:54] [INFO ] Computed 46 place invariants in 6 ms
[2022-05-17 05:11:58] [INFO ] Implicit Places using invariants and state equation in 3811 ms returned []
Implicit Place search using SMT with State Equation took 4532 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:11:58] [INFO ] Computed 46 place invariants in 6 ms
[2022-05-17 05:11:59] [INFO ] Dead Transitions using invariants and state equation in 1202 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 948/948 places, 902/902 transitions.
Computed a total of 948 stabilizing places and 902 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 948 transition count 902
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 p2) (NOT p0) (NOT p3) (NOT p4)), (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p3))))), (X (NOT p4)), (X (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)) (AND p0 (NOT p3)))), (X (OR p1 (NOT p2) p3 p4)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (OR (AND p1 p2) (AND p0 p2) (AND p2 p3)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p3) p4))), (X (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p3)))))), (X (X (NOT p4))), (X (X (OR p1 (NOT p2) p3 p4))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p3) p4)))), (F (G p1)), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p4)))]
False Knowledge obtained : [(X (X (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)) (AND p0 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)) (AND p0 (NOT p3)))))), (X (X (OR (AND p1 p2) (AND p0 p2) (AND p2 p3)))), (X (X (NOT (OR (AND p1 p2) (AND p0 p2) (AND p2 p3)))))]
Knowledge based reduction with 22 factoid took 1628 ms. Reduced automaton from 6 states, 11 edges and 5 AP to 6 states, 11 edges and 5 AP.
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p2) (AND p0 (NOT p3)) (AND p3 p4) (AND p1 p4)), (OR (NOT p2) p4 p1 p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p4) (AND (NOT p1) p3) (AND p0 (NOT p1))), (AND p1 (NOT p3) p4), p4, (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND p1 (NOT p3)))]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 352 ms. (steps per millisecond=28 ) properties (out of 10) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:12:02] [INFO ] Computed 46 place invariants in 4 ms
[2022-05-17 05:12:02] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 227 ms returned sat
[2022-05-17 05:12:03] [INFO ] After 1466ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2022-05-17 05:12:04] [INFO ] [Nat]Absence check using 0 positive and 46 generalized place invariants in 206 ms returned sat
[2022-05-17 05:12:05] [INFO ] After 1229ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2022-05-17 05:12:06] [INFO ] After 1948ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 569 ms.
[2022-05-17 05:12:06] [INFO ] After 3039ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 65 ms.
Support contains 6 out of 948 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 948/948 places, 902/902 transitions.
Graph (complete) has 1815 edges and 948 vertex of which 947 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 378 transitions
Trivial Post-agglo rules discarded 378 transitions
Performed 378 trivial Post agglomeration. Transition count delta: 378
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 947 transition count 523
Reduce places removed 378 places and 0 transitions.
Graph (complete) has 1019 edges and 569 vertex of which 496 are kept as prefixes of interest. Removing 73 places using SCC suffix rule.1 ms
Discarding 73 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 379 rules applied. Total rules applied 759 place count 496 transition count 523
Drop transitions removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 2 with 73 rules applied. Total rules applied 832 place count 496 transition count 450
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 833 place count 495 transition count 449
Iterating global reduction 3 with 1 rules applied. Total rules applied 834 place count 495 transition count 449
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 3 with 37 rules applied. Total rules applied 871 place count 495 transition count 412
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 3 with 37 rules applied. Total rules applied 908 place count 458 transition count 412
Reduce places removed 37 places and 37 transitions.
Iterating global reduction 4 with 37 rules applied. Total rules applied 945 place count 421 transition count 375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 946 place count 420 transition count 375
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 946 place count 420 transition count 362
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 972 place count 407 transition count 362
Applied a total of 972 rules in 102 ms. Remains 407 /948 variables (removed 541) and now considering 362/902 (removed 540) transitions.
Finished structural reductions, in 1 iterations. Remains : 407/948 places, 362/902 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 362 rows 407 cols
[2022-05-17 05:12:07] [INFO ] Computed 45 place invariants in 2 ms
[2022-05-17 05:12:07] [INFO ] [Real]Absence check using 0 positive and 45 generalized place invariants in 111 ms returned sat
[2022-05-17 05:12:07] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 05:12:07] [INFO ] [Nat]Absence check using 0 positive and 45 generalized place invariants in 107 ms returned sat
[2022-05-17 05:12:07] [INFO ] After 340ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 05:12:07] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-17 05:12:08] [INFO ] After 58ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-17 05:12:08] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 67 ms.
[2022-05-17 05:12:08] [INFO ] After 785ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 407 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 407/407 places, 362/362 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 407 transition count 348
Reduce places removed 14 places and 0 transitions.
Graph (complete) has 702 edges and 393 vertex of which 391 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 391 transition count 348
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 391 transition count 346
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 391 transition count 345
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 33 place count 390 transition count 345
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 34 place count 389 transition count 344
Applied a total of 34 rules in 55 ms. Remains 389 /407 variables (removed 18) and now considering 344/362 (removed 18) transitions.
Finished structural reductions, in 1 iterations. Remains : 389/407 places, 344/362 transitions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Finished probabilistic random walk after 52464 steps, run visited all 2 properties in 616 ms. (steps per millisecond=85 )
Probabilistic random walk after 52464 steps, saw 16161 distinct states, run finished after 616 ms. (steps per millisecond=85 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0) (NOT p3) (NOT p4)), (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p3))))), (X (NOT p4)), (X (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)) (AND p0 (NOT p3)))), (X (OR p1 (NOT p2) p3 p4)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (OR (AND p1 p2) (AND p0 p2) (AND p2 p3)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p3) p4))), (X (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p3)))))), (X (X (NOT p4))), (X (X (OR p1 (NOT p2) p3 p4))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p3) p4)))), (F (G p1)), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p4))), (G (OR p1 p4 (NOT p2) p3))]
False Knowledge obtained : [(X (X (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)) (AND p0 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)) (AND p0 (NOT p3)))))), (X (X (OR (AND p1 p2) (AND p0 p2) (AND p2 p3)))), (X (X (NOT (OR (AND p1 p2) (AND p0 p2) (AND p2 p3))))), (F (OR (AND p1 p2) (AND p2 p3) (AND p2 p0))), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) p0) (AND (NOT p3) p0)))), (F (OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p1) (NOT p3) p0))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F p4), (F (AND p1 p4 (NOT p3))), (F (NOT (OR (AND p1 (NOT p3)) (AND (NOT p4) (NOT p2) (NOT p3)))))]
Knowledge based reduction with 23 factoid took 1975 ms. Reduced automaton from 6 states, 11 edges and 5 AP to 6 states, 11 edges and 5 AP.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p2) (AND p0 (NOT p3)) (AND p3 p4) (AND p1 p4)), true, (NOT p1), (AND p1 (NOT p3) p4), p4, (OR (AND (NOT p3) (NOT p4)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p2) (AND p0 (NOT p3)) (AND p3 p4) (AND p1 p4)), true, (NOT p1), (AND p1 (NOT p3) p4), p4, (OR (AND (NOT p3) (NOT p4)) (AND p1 (NOT p3)))]
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:12:11] [INFO ] Computed 46 place invariants in 4 ms
[2022-05-17 05:12:12] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 225 ms returned sat
[2022-05-17 05:12:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 05:12:15] [INFO ] [Real]Absence check using state equation in 3038 ms returned sat
[2022-05-17 05:12:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 05:12:17] [INFO ] [Nat]Absence check using 0 positive and 46 generalized place invariants in 283 ms returned sat
[2022-05-17 05:12:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 05:12:30] [INFO ] [Nat]Absence check using state equation in 13721 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p2) (AND p0 (NOT p3)) (AND p3 p4) (AND p1 p4)), true, (NOT p1), (AND p1 (NOT p3) p4), p4, (OR (AND (NOT p3) (NOT p4)) (AND p1 (NOT p3)))]
Product exploration explored 100000 steps with 1547 reset in 788 ms.
Product exploration explored 100000 steps with 1567 reset in 850 ms.
Applying partial POR strategy [false, true, true, true, false, true]
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p2) (AND p0 (NOT p3)) (AND p3 p4) (AND p1 p4)), true, (NOT p1), (AND p1 (NOT p3) p4), p4, (OR (AND (NOT p3) (NOT p4)) (AND p1 (NOT p3)))]
Support contains 6 out of 948 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 948/948 places, 902/902 transitions.
Performed 378 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 378 rules applied. Total rules applied 378 place count 948 transition count 902
Deduced a syphon composed of 378 places in 5 ms
Applied a total of 378 rules in 130 ms. Remains 948 /948 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2022-05-17 05:12:33] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:12:33] [INFO ] Computed 46 place invariants in 4 ms
[2022-05-17 05:12:34] [INFO ] Dead Transitions using invariants and state equation in 890 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 948/948 places, 902/902 transitions.
Finished structural reductions, in 1 iterations. Remains : 948/948 places, 902/902 transitions.
Product exploration explored 100000 steps with 1604 reset in 834 ms.
Product exploration explored 100000 steps with 1658 reset in 878 ms.
Built C files in :
/tmp/ltsmin2604562873796621011
[2022-05-17 05:12:36] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2604562873796621011
Running compilation step : cd /tmp/ltsmin2604562873796621011;'/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 2713 ms.
Running link step : cd /tmp/ltsmin2604562873796621011;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin2604562873796621011;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17856438405775002974.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 948 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 948/948 places, 902/902 transitions.
Applied a total of 0 rules in 47 ms. Remains 948 /948 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:12:51] [INFO ] Computed 46 place invariants in 4 ms
[2022-05-17 05:12:52] [INFO ] Implicit Places using invariants in 907 ms returned []
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:12:52] [INFO ] Computed 46 place invariants in 4 ms
[2022-05-17 05:12:55] [INFO ] Implicit Places using invariants and state equation in 3602 ms returned []
Implicit Place search using SMT with State Equation took 4520 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:12:55] [INFO ] Computed 46 place invariants in 6 ms
[2022-05-17 05:12:56] [INFO ] Dead Transitions using invariants and state equation in 1070 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 948/948 places, 902/902 transitions.
Built C files in :
/tmp/ltsmin9599357858905030798
[2022-05-17 05:12:56] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9599357858905030798
Running compilation step : cd /tmp/ltsmin9599357858905030798;'/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 2552 ms.
Running link step : cd /tmp/ltsmin9599357858905030798;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9599357858905030798;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2608821136108079272.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 05:13:12] [INFO ] Flatten gal took : 63 ms
[2022-05-17 05:13:12] [INFO ] Flatten gal took : 61 ms
[2022-05-17 05:13:12] [INFO ] Time to serialize gal into /tmp/LTL8352415196832244839.gal : 16 ms
[2022-05-17 05:13:12] [INFO ] Time to serialize properties into /tmp/LTL11877862174224496477.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/LTL8352415196832244839.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11877862174224496477.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/LTL8352415...267
Read 1 LTL properties
Checking formula 0 : !(((("(rcv_right_election_16_0_1_15>=1)")U("(rcv_right_election_40_6_37_3<1)"))U((((F("((newmsg1>=1)&&(election_2_0_1_to_left_2>=1))")...310
Formula 0 simplified : !(("(rcv_right_election_16_0_1_15>=1)" U "(rcv_right_election_40_6_37_3<1)") U ("(election_2_0_1_to_left_2>=1)" & "(newmsg1>=1)" & (...298
Detected timeout of ITS tools.
[2022-05-17 05:13:27] [INFO ] Flatten gal took : 50 ms
[2022-05-17 05:13:27] [INFO ] Applying decomposition
[2022-05-17 05:13:27] [INFO ] Flatten gal took : 48 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/graph6449500032914357614.txt' '-o' '/tmp/graph6449500032914357614.bin' '-w' '/tmp/graph6449500032914357614.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6449500032914357614.bin' '-l' '-1' '-v' '-w' '/tmp/graph6449500032914357614.weights' '-q' '0' '-e' '0.001'
[2022-05-17 05:13:27] [INFO ] Decomposing Gal with order
[2022-05-17 05:13:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 05:13:27] [INFO ] Removed a total of 103 redundant transitions.
[2022-05-17 05:13:27] [INFO ] Flatten gal took : 180 ms
[2022-05-17 05:13:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2022-05-17 05:13:28] [INFO ] Time to serialize gal into /tmp/LTL16785688065546788574.gal : 22 ms
[2022-05-17 05:13:28] [INFO ] Time to serialize properties into /tmp/LTL1928857090828443017.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/LTL16785688065546788574.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1928857090828443017.ltl' '-c' '-stutter-deadlock'
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/LTL1678568...246
Read 1 LTL properties
Checking formula 0 : !(((("(i5.u38.rcv_right_election_16_0_1_15>=1)")U("(i1.i0.u2.rcv_right_election_40_6_37_3<1)"))U((((F("((i0.u0.newmsg1>=1)&&(i0.u0.ele...373
Formula 0 simplified : !(("(i5.u38.rcv_right_election_16_0_1_15>=1)" U "(i1.i0.u2.rcv_right_election_40_6_37_3<1)") U ("(i0.u0.election_2_0_1_to_left_2>=1)...361
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15452794125869088361
[2022-05-17 05:13:43] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15452794125869088361
Running compilation step : cd /tmp/ltsmin15452794125869088361;'/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 2482 ms.
Running link step : cd /tmp/ltsmin15452794125869088361;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15452794125869088361;'/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) U (LTLAPp1==true)) U ((<>((LTLAPp3==true)) U X(!(LTLAPp4==true)))&&(LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-40-LTLFireability-06 finished in 175651 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 4 out of 949 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 949/949 places, 903/903 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 948 transition count 902
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 948 transition count 902
Applied a total of 2 rules in 84 ms. Remains 948 /949 variables (removed 1) and now considering 902/903 (removed 1) transitions.
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:13:58] [INFO ] Computed 46 place invariants in 4 ms
[2022-05-17 05:13:59] [INFO ] Implicit Places using invariants in 700 ms returned []
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:13:59] [INFO ] Computed 46 place invariants in 4 ms
[2022-05-17 05:14:02] [INFO ] Implicit Places using invariants and state equation in 3655 ms returned []
Implicit Place search using SMT with State Equation took 4367 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:14:02] [INFO ] Computed 46 place invariants in 5 ms
[2022-05-17 05:14:03] [INFO ] Dead Transitions using invariants and state equation in 1079 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 948/949 places, 902/903 transitions.
Finished structural reductions, in 1 iterations. Remains : 948/949 places, 902/903 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s69 1) (GEQ s758 1)), p0:(AND (GEQ s13 1) (GEQ s108 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 0 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-LTLFireability-07 finished in 5688 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 949 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 949/949 places, 903/903 transitions.
Reduce places removed 40 places and 40 transitions.
Drop transitions removed 406 transitions
Trivial Post-agglo rules discarded 406 transitions
Performed 406 trivial Post agglomeration. Transition count delta: 406
Iterating post reduction 0 with 406 rules applied. Total rules applied 406 place count 909 transition count 457
Reduce places removed 406 places and 0 transitions.
Iterating post reduction 1 with 406 rules applied. Total rules applied 812 place count 503 transition count 457
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 813 place count 502 transition count 456
Iterating global reduction 2 with 1 rules applied. Total rules applied 814 place count 502 transition count 456
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 815 place count 502 transition count 455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 816 place count 501 transition count 455
Applied a total of 816 rules in 72 ms. Remains 501 /949 variables (removed 448) and now considering 455/903 (removed 448) transitions.
// Phase 1: matrix 455 rows 501 cols
[2022-05-17 05:14:03] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-17 05:14:04] [INFO ] Implicit Places using invariants in 665 ms returned []
// Phase 1: matrix 455 rows 501 cols
[2022-05-17 05:14:04] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-17 05:14:07] [INFO ] Implicit Places using invariants and state equation in 2375 ms returned []
Implicit Place search using SMT with State Equation took 3061 ms to find 0 implicit places.
[2022-05-17 05:14:07] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 455 rows 501 cols
[2022-05-17 05:14:07] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:14:07] [INFO ] Dead Transitions using invariants and state equation in 704 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/949 places, 455/903 transitions.
Finished structural reductions, in 1 iterations. Remains : 501/949 places, 455/903 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-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:(GEQ s130 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 829 reset in 634 ms.
Product exploration explored 100000 steps with 829 reset in 773 ms.
Computed a total of 501 stabilizing places and 455 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 501 transition count 455
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 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 150 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=37 )
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 155 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 455 rows 501 cols
[2022-05-17 05:14:09] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:14:10] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 179 ms returned sat
[2022-05-17 05:14:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 05:14:12] [INFO ] [Real]Absence check using state equation in 2124 ms returned sat
[2022-05-17 05:14:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 05:14:13] [INFO ] [Nat]Absence check using 0 positive and 46 generalized place invariants in 319 ms returned sat
[2022-05-17 05:14:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 05:14:14] [INFO ] [Nat]Absence check using state equation in 751 ms returned sat
[2022-05-17 05:14:14] [INFO ] Computed and/alt/rep : 376/383/376 causal constraints (skipped 0 transitions) in 90 ms.
[2022-05-17 05:14:14] [INFO ] Added : 8 causal constraints over 2 iterations in 248 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 455/455 transitions.
Applied a total of 0 rules in 21 ms. Remains 501 /501 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 501 cols
[2022-05-17 05:14:14] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:14:15] [INFO ] Implicit Places using invariants in 763 ms returned []
// Phase 1: matrix 455 rows 501 cols
[2022-05-17 05:14:15] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:14:17] [INFO ] Implicit Places using invariants and state equation in 2407 ms returned []
Implicit Place search using SMT with State Equation took 3173 ms to find 0 implicit places.
[2022-05-17 05:14:17] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 455 rows 501 cols
[2022-05-17 05:14:17] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:14:18] [INFO ] Dead Transitions using invariants and state equation in 644 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 501/501 places, 455/455 transitions.
Computed a total of 501 stabilizing places and 455 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 501 transition count 455
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 151 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 143 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=71 )
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 175 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 455 rows 501 cols
[2022-05-17 05:14:19] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:14:19] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 183 ms returned sat
[2022-05-17 05:14:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 05:14:21] [INFO ] [Real]Absence check using state equation in 2034 ms returned sat
[2022-05-17 05:14:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 05:14:22] [INFO ] [Nat]Absence check using 0 positive and 46 generalized place invariants in 326 ms returned sat
[2022-05-17 05:14:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 05:14:23] [INFO ] [Nat]Absence check using state equation in 807 ms returned sat
[2022-05-17 05:14:23] [INFO ] Computed and/alt/rep : 376/383/376 causal constraints (skipped 0 transitions) in 40 ms.
[2022-05-17 05:14:23] [INFO ] Added : 8 causal constraints over 2 iterations in 157 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 828 reset in 694 ms.
Product exploration explored 100000 steps with 828 reset in 711 ms.
Built C files in :
/tmp/ltsmin10069330442314815737
[2022-05-17 05:14:25] [INFO ] Computing symmetric may disable matrix : 455 transitions.
[2022-05-17 05:14:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 05:14:25] [INFO ] Computing symmetric may enable matrix : 455 transitions.
[2022-05-17 05:14:25] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 05:14:25] [INFO ] Computing Do-Not-Accords matrix : 455 transitions.
[2022-05-17 05:14:25] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 05:14:25] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10069330442314815737
Running compilation step : cd /tmp/ltsmin10069330442314815737;'/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 1539 ms.
Running link step : cd /tmp/ltsmin10069330442314815737;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin10069330442314815737;'/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/stateBased11690189881178779542.hoa' '--buchi-type=spotba'
LTSmin run took 1866 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-40-LTLFireability-08 finished in 24903 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!X(((!F(G(p0)) U p0)||p0))) U X(p1)))'
Support contains 3 out of 949 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 949/949 places, 903/903 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 948 transition count 902
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 948 transition count 902
Applied a total of 2 rules in 82 ms. Remains 948 /949 variables (removed 1) and now considering 902/903 (removed 1) transitions.
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:14:28] [INFO ] Computed 46 place invariants in 4 ms
[2022-05-17 05:14:29] [INFO ] Implicit Places using invariants in 872 ms returned []
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:14:29] [INFO ] Computed 46 place invariants in 5 ms
[2022-05-17 05:14:33] [INFO ] Implicit Places using invariants and state equation in 3756 ms returned []
Implicit Place search using SMT with State Equation took 4632 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:14:33] [INFO ] Computed 46 place invariants in 5 ms
[2022-05-17 05:14:34] [INFO ] Dead Transitions using invariants and state equation in 1193 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 948/949 places, 902/903 transitions.
Finished structural reductions, in 1 iterations. Remains : 948/949 places, 902/903 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), true, p0]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s79 1) (GEQ s241 1)), p0:(GEQ s891 1)], nbAcceptance=1, 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]]
Entered a terminal (fully accepting) state of product in 915 steps with 0 reset in 4 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-LTLFireability-09 finished in 6062 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 949 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 949/949 places, 903/903 transitions.
Reduce places removed 39 places and 39 transitions.
Drop transitions removed 396 transitions
Trivial Post-agglo rules discarded 396 transitions
Performed 396 trivial Post agglomeration. Transition count delta: 396
Iterating post reduction 0 with 396 rules applied. Total rules applied 396 place count 910 transition count 468
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 792 place count 514 transition count 468
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 793 place count 513 transition count 467
Iterating global reduction 2 with 1 rules applied. Total rules applied 794 place count 513 transition count 467
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 795 place count 513 transition count 466
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 796 place count 512 transition count 466
Applied a total of 796 rules in 49 ms. Remains 512 /949 variables (removed 437) and now considering 466/903 (removed 437) transitions.
// Phase 1: matrix 466 rows 512 cols
[2022-05-17 05:14:34] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-17 05:14:35] [INFO ] Implicit Places using invariants in 638 ms returned []
// Phase 1: matrix 466 rows 512 cols
[2022-05-17 05:14:35] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:14:38] [INFO ] Implicit Places using invariants and state equation in 2485 ms returned []
Implicit Place search using SMT with State Equation took 3147 ms to find 0 implicit places.
[2022-05-17 05:14:38] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 466 rows 512 cols
[2022-05-17 05:14:38] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:14:38] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 512/949 places, 466/903 transitions.
Finished structural reductions, in 1 iterations. Remains : 512/949 places, 466/903 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s12 1) (GEQ s335 1))], 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 362 reset in 396 ms.
Product exploration explored 100000 steps with 362 reset in 451 ms.
Computed a total of 512 stabilizing places and 466 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 512 transition count 466
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 145 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 34 ms :[(NOT p0)]
Finished random walk after 291 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=145 )
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 160 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
// Phase 1: matrix 466 rows 512 cols
[2022-05-17 05:14:40] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:14:41] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 379 ms returned sat
[2022-05-17 05:14:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 05:14:44] [INFO ] [Real]Absence check using state equation in 3385 ms returned sat
[2022-05-17 05:14:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 05:14:45] [INFO ] [Nat]Absence check using 0 positive and 46 generalized place invariants in 357 ms returned sat
[2022-05-17 05:14:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 05:14:50] [INFO ] [Nat]Absence check using state equation in 4764 ms returned sat
[2022-05-17 05:14:50] [INFO ] Computed and/alt/rep : 379/387/379 causal constraints (skipped 11 transitions) in 38 ms.
[2022-05-17 05:14:53] [INFO ] Added : 166 causal constraints over 34 iterations in 3135 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 512/512 places, 466/466 transitions.
Applied a total of 0 rules in 21 ms. Remains 512 /512 variables (removed 0) and now considering 466/466 (removed 0) transitions.
// Phase 1: matrix 466 rows 512 cols
[2022-05-17 05:14:53] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:14:54] [INFO ] Implicit Places using invariants in 790 ms returned []
// Phase 1: matrix 466 rows 512 cols
[2022-05-17 05:14:54] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:14:56] [INFO ] Implicit Places using invariants and state equation in 2659 ms returned []
Implicit Place search using SMT with State Equation took 3450 ms to find 0 implicit places.
[2022-05-17 05:14:56] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 466 rows 512 cols
[2022-05-17 05:14:57] [INFO ] Computed 46 place invariants in 3 ms
[2022-05-17 05:14:57] [INFO ] Dead Transitions using invariants and state equation in 707 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 512/512 places, 466/466 transitions.
Computed a total of 512 stabilizing places and 466 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 512 transition count 466
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 136 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 33 ms :[(NOT p0)]
Finished random walk after 295 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=147 )
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 155 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 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
// Phase 1: matrix 466 rows 512 cols
[2022-05-17 05:14:58] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:14:59] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 380 ms returned sat
[2022-05-17 05:14:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 05:15:02] [INFO ] [Real]Absence check using state equation in 3352 ms returned sat
[2022-05-17 05:15:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 05:15:03] [INFO ] [Nat]Absence check using 0 positive and 46 generalized place invariants in 353 ms returned sat
[2022-05-17 05:15:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 05:15:08] [INFO ] [Nat]Absence check using state equation in 4747 ms returned sat
[2022-05-17 05:15:08] [INFO ] Computed and/alt/rep : 379/387/379 causal constraints (skipped 11 transitions) in 48 ms.
[2022-05-17 05:15:11] [INFO ] Added : 166 causal constraints over 34 iterations in 3067 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 362 reset in 397 ms.
Product exploration explored 100000 steps with 362 reset in 456 ms.
Built C files in :
/tmp/ltsmin12344961161692646706
[2022-05-17 05:15:12] [INFO ] Computing symmetric may disable matrix : 466 transitions.
[2022-05-17 05:15:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 05:15:12] [INFO ] Computing symmetric may enable matrix : 466 transitions.
[2022-05-17 05:15:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 05:15:12] [INFO ] Computing Do-Not-Accords matrix : 466 transitions.
[2022-05-17 05:15:12] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 05:15:12] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12344961161692646706
Running compilation step : cd /tmp/ltsmin12344961161692646706;'/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 1602 ms.
Running link step : cd /tmp/ltsmin12344961161692646706;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin12344961161692646706;'/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/stateBased17919500214370106487.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 512/512 places, 466/466 transitions.
Applied a total of 0 rules in 21 ms. Remains 512 /512 variables (removed 0) and now considering 466/466 (removed 0) transitions.
// Phase 1: matrix 466 rows 512 cols
[2022-05-17 05:15:27] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:15:28] [INFO ] Implicit Places using invariants in 793 ms returned []
// Phase 1: matrix 466 rows 512 cols
[2022-05-17 05:15:28] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:15:30] [INFO ] Implicit Places using invariants and state equation in 2533 ms returned []
Implicit Place search using SMT with State Equation took 3330 ms to find 0 implicit places.
[2022-05-17 05:15:30] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 466 rows 512 cols
[2022-05-17 05:15:30] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:15:31] [INFO ] Dead Transitions using invariants and state equation in 698 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 512/512 places, 466/466 transitions.
Built C files in :
/tmp/ltsmin13865560368812591799
[2022-05-17 05:15:31] [INFO ] Computing symmetric may disable matrix : 466 transitions.
[2022-05-17 05:15:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 05:15:31] [INFO ] Computing symmetric may enable matrix : 466 transitions.
[2022-05-17 05:15:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 05:15:31] [INFO ] Computing Do-Not-Accords matrix : 466 transitions.
[2022-05-17 05:15:31] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 05:15:31] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13865560368812591799
Running compilation step : cd /tmp/ltsmin13865560368812591799;'/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 1578 ms.
Running link step : cd /tmp/ltsmin13865560368812591799;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13865560368812591799;'/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/stateBased6971973769368533065.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 05:15:46] [INFO ] Flatten gal took : 21 ms
[2022-05-17 05:15:46] [INFO ] Flatten gal took : 20 ms
[2022-05-17 05:15:46] [INFO ] Time to serialize gal into /tmp/LTL6273390799192351006.gal : 4 ms
[2022-05-17 05:15:46] [INFO ] Time to serialize properties into /tmp/LTL6525737341464162464.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/LTL6273390799192351006.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6525737341464162464.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/LTL6273390...266
Read 1 LTL properties
Checking formula 0 : !((F("((newmsg12>=1)&&(election_40_5_12_to_right_11>=1))")))
Formula 0 simplified : !F"((newmsg12>=1)&&(election_40_5_12_to_right_11>=1))"
Detected timeout of ITS tools.
[2022-05-17 05:16:01] [INFO ] Flatten gal took : 20 ms
[2022-05-17 05:16:01] [INFO ] Applying decomposition
[2022-05-17 05:16:01] [INFO ] Flatten gal took : 19 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/graph8104251266432779682.txt' '-o' '/tmp/graph8104251266432779682.bin' '-w' '/tmp/graph8104251266432779682.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8104251266432779682.bin' '-l' '-1' '-v' '-w' '/tmp/graph8104251266432779682.weights' '-q' '0' '-e' '0.001'
[2022-05-17 05:16:01] [INFO ] Decomposing Gal with order
[2022-05-17 05:16:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 05:16:01] [INFO ] Removed a total of 317 redundant transitions.
[2022-05-17 05:16:01] [INFO ] Flatten gal took : 52 ms
[2022-05-17 05:16:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 16 ms.
[2022-05-17 05:16:01] [INFO ] Time to serialize gal into /tmp/LTL12395057925675591973.gal : 8 ms
[2022-05-17 05:16:01] [INFO ] Time to serialize properties into /tmp/LTL12237168867407199427.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/LTL12395057925675591973.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12237168867407199427.ltl' '-c' '-stutter-deadlock'
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/LTL1239505...247
Read 1 LTL properties
Checking formula 0 : !((F("((i1.u11.newmsg12>=1)&&(i1.u125.election_40_5_12_to_right_11>=1))")))
Formula 0 simplified : !F"((i1.u11.newmsg12>=1)&&(i1.u125.election_40_5_12_to_right_11>=1))"
Reverse transition relation is NOT exact ! Due to transitions t70_t71, t86_t87, t127_t128, t155_t156, t179_t180, t584_t585, t747_t748, t781_t782, i1.t84_t8...741
Computing Next relation with stutter on 8.73115e+28 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1136196670551600848
[2022-05-17 05:16:16] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1136196670551600848
Running compilation step : cd /tmp/ltsmin1136196670551600848;'/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 1244 ms.
Running link step : cd /tmp/ltsmin1136196670551600848;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1136196670551600848;'/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 HirschbergSinclair-PT-40-LTLFireability-11 finished in 117127 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(!((p1 U (p2 U p3)) U X(p4))))))'
Support contains 8 out of 949 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 949/949 places, 903/903 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 948 transition count 902
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 948 transition count 902
Applied a total of 2 rules in 81 ms. Remains 948 /949 variables (removed 1) and now considering 902/903 (removed 1) transitions.
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:16:32] [INFO ] Computed 46 place invariants in 4 ms
[2022-05-17 05:16:32] [INFO ] Implicit Places using invariants in 824 ms returned []
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:16:32] [INFO ] Computed 46 place invariants in 4 ms
[2022-05-17 05:16:36] [INFO ] Implicit Places using invariants and state equation in 3913 ms returned []
Implicit Place search using SMT with State Equation took 4763 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:16:36] [INFO ] Computed 46 place invariants in 4 ms
[2022-05-17 05:16:38] [INFO ] Dead Transitions using invariants and state equation in 1124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 948/949 places, 902/903 transitions.
Finished structural reductions, in 1 iterations. Remains : 948/949 places, 902/903 transitions.
Stuttering acceptance computed with spot in 819 ms :[p4, p4, p4, p4, (AND p3 p4), (AND p3 p4), true, p4, p4, (AND p3 p4), (AND p3 p4), (AND p3 p4), (AND p3 p4), (AND p3 p4), (AND p3 p4), (AND p3 (NOT p4)), (AND p3 (NOT p4))]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p3, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) p3), acceptance={} source=2 dest: 1}, { cond=(AND p0 p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 7}, { cond=p0, acceptance={0, 1} source=2 dest: 8}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 9}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=2 dest: 10}], [{ cond=p4, acceptance={} source=3 dest: 6}], [{ cond=p3, acceptance={} source=4 dest: 1}, { cond=p3, acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 11}], [{ cond=p3, acceptance={} source=5 dest: 1}, { cond=p3, acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=5 dest: 11}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 12}], [{ cond=true, acceptance={0, 1} source=6 dest: 6}], [{ cond=(AND p3 p4), acceptance={} source=7 dest: 1}, { cond=p4, acceptance={} source=7 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3) p4), acceptance={} source=7 dest: 4}, { cond=(AND p1 (NOT p3) p4), acceptance={} source=7 dest: 5}], [{ cond=(AND (NOT p0) p3 p4), acceptance={} source=8 dest: 1}, { cond=(AND p0 p3 p4), acceptance={0} source=8 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3) p4), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p3) p4), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) (NOT p3) p4), acceptance={} source=8 dest: 7}, { cond=(AND p0 p4), acceptance={0, 1} source=8 dest: 8}, { cond=(AND p0 (NOT p1) p2 (NOT p3) p4), acceptance={} source=8 dest: 9}, { cond=(AND p0 p1 (NOT p3) p4), acceptance={} source=8 dest: 10}], [{ cond=(AND (NOT p0) p3), acceptance={} source=9 dest: 1}, { cond=(AND p0 p3), acceptance={0} source=9 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=9 dest: 4}, { cond=(AND p0 p3), acceptance={0, 1} source=9 dest: 8}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=9 dest: 9}, { cond=(AND p0 p2 (NOT p3)), acceptance={1} source=9 dest: 13}], [{ cond=(AND (NOT p0) p3), acceptance={} source=10 dest: 1}, { cond=(AND p0 p3), acceptance={0} source=10 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=10 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=10 dest: 5}, { cond=(AND p0 p3), acceptance={0, 1} source=10 dest: 8}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=10 dest: 9}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=10 dest: 10}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={1} source=10 dest: 13}, { cond=(AND p0 p1 (NOT p3)), acceptance={1} source=10 dest: 14}], [{ cond=(AND p3 p4), acceptance={} source=11 dest: 6}, { cond=(AND p2 (NOT p3) p4), acceptance={} source=11 dest: 15}], [{ cond=(AND p3 p4), acceptance={} source=12 dest: 6}, { cond=(AND (NOT p1) p2 (NOT p3) p4), acceptance={} source=12 dest: 15}, { cond=(AND p1 (NOT p3) p4), acceptance={} source=12 dest: 16}], [{ cond=(AND (NOT p0) p3 p4), acceptance={} source=13 dest: 1}, { cond=(AND p0 p3 p4), acceptance={0} source=13 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p3) p4), acceptance={} source=13 dest: 4}, { cond=(AND p0 p3 p4), acceptance={0, 1} source=13 dest: 8}, { cond=(AND p0 p2 (NOT p3) p4), acceptance={} source=13 dest: 9}, { cond=(AND p0 p2 (NOT p3) p4), acceptance={1} source=13 dest: 13}], [{ cond=(AND (NOT p0) p3 p4), acceptance={} source=14 dest: 1}, { cond=(AND p0 p3 p4), acceptance={0} source=14 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3) p4), acceptance={} source=14 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p3) p4), acceptance={} source=14 dest: 5}, { cond=(AND p0 p3 p4), acceptance={0, 1} source=14 dest: 8}, { cond=(AND p0 (NOT p1) p2 (NOT p3) p4), acceptance={} source=14 dest: 9}, { cond=(AND p0 p1 (NOT p3) p4), acceptance={} source=14 dest: 10}, { cond=(AND p0 (NOT p1) p2 (NOT p3) p4), acceptance={1} source=14 dest: 13}, { cond=(AND p0 p1 (NOT p3) p4), acceptance={1} source=14 dest: 14}], [{ cond=(AND p3 (NOT p4)), acceptance={} source=15 dest: 6}, { cond=(AND p2 (NOT p3) (NOT p4)), acceptance={} source=15 dest: 15}], [{ cond=(AND p3 (NOT p4)), acceptance={} source=16 dest: 6}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p4)), acceptance={} source=16 dest: 15}, { cond=(AND p1 (NOT p3) (NOT p4)), acceptance={} source=16 dest: 16}]], initial=0, aps=[p0:(AND (GEQ s47 1) (GEQ s176 1) (GEQ s607 1)), p3:(AND (GEQ s29 1) (GEQ s455 1)), p1:(AND (GEQ s47 1) (GEQ s176 1)), p2:(AND (GEQ s25 1) (GEQ s721 1)), p...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24975 reset in 834 ms.
Product exploration explored 100000 steps with 24984 reset in 877 ms.
Computed a total of 948 stabilizing places and 902 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 948 transition count 902
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 (NOT p0) (NOT p3) (NOT p1) (NOT p2) (NOT p4)), (X (NOT (AND p0 p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT p3)), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 p1 (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p4)))), (X (X (NOT (AND (NOT p0) p3 p4)))), true, (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3) p4)))), (X (X (NOT (AND p3 p4)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 p4)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3) p4)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) p4)))), (X (X (NOT (AND p0 p3 p4)))), (X (X (NOT (AND p1 (NOT p3) p4)))), (X (X (NOT (AND p0 p1 (NOT p3) p4)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3) p4)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p4)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p0) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3)))))]
Knowledge based reduction with 42 factoid took 18621 ms. Reduced automaton from 17 states, 79 edges and 5 AP to 17 states, 79 edges and 5 AP.
Stuttering acceptance computed with spot in 833 ms :[p4, p4, p4, p4, (AND p3 p4), (AND p3 p4), true, p4, p4, (AND p3 p4), (AND p3 p4), (AND p3 p4), (AND p3 p4), (AND p3 p4), (AND p3 p4), (AND p3 (NOT p4)), (AND p3 (NOT p4))]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 562 ms. (steps per millisecond=17 ) properties (out of 33) seen :15
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:17:01] [INFO ] Computed 46 place invariants in 5 ms
[2022-05-17 05:17:01] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 225 ms returned sat
[2022-05-17 05:17:02] [INFO ] After 1393ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:13
[2022-05-17 05:17:03] [INFO ] [Nat]Absence check using 0 positive and 46 generalized place invariants in 210 ms returned sat
[2022-05-17 05:17:04] [INFO ] After 1582ms SMT Verify possible using state equation in natural domain returned unsat :13 sat :5
[2022-05-17 05:17:05] [INFO ] After 2270ms SMT Verify possible using trap constraints in natural domain returned unsat :13 sat :5
Attempting to minimize the solution found.
Minimization took 748 ms.
[2022-05-17 05:17:06] [INFO ] After 3885ms SMT Verify possible using all constraints in natural domain returned unsat :13 sat :5
Fused 18 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 203 ms.
Support contains 8 out of 948 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 948/948 places, 902/902 transitions.
Graph (complete) has 1815 edges and 948 vertex of which 935 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 375 transitions
Trivial Post-agglo rules discarded 375 transitions
Performed 375 trivial Post agglomeration. Transition count delta: 375
Iterating post reduction 0 with 388 rules applied. Total rules applied 389 place count 935 transition count 514
Reduce places removed 375 places and 0 transitions.
Graph (complete) has 1003 edges and 560 vertex of which 492 are kept as prefixes of interest. Removing 68 places using SCC suffix rule.0 ms
Discarding 68 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 376 rules applied. Total rules applied 765 place count 492 transition count 514
Drop transitions removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 833 place count 492 transition count 446
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 836 place count 489 transition count 443
Iterating global reduction 3 with 3 rules applied. Total rules applied 839 place count 489 transition count 443
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 841 place count 487 transition count 441
Iterating global reduction 3 with 2 rules applied. Total rules applied 843 place count 487 transition count 441
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 3 with 26 rules applied. Total rules applied 869 place count 487 transition count 415
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 895 place count 461 transition count 415
Reduce places removed 36 places and 36 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 931 place count 425 transition count 379
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 4 with 98 rules applied. Total rules applied 1029 place count 413 transition count 293
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 5 with 86 rules applied. Total rules applied 1115 place count 327 transition count 293
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 25 Pre rules applied. Total rules applied 1115 place count 327 transition count 268
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 1165 place count 302 transition count 268
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 1166 place count 301 transition count 268
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1166 place count 301 transition count 267
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1168 place count 300 transition count 267
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1174 place count 297 transition count 264
Applied a total of 1174 rules in 102 ms. Remains 297 /948 variables (removed 651) and now considering 264/902 (removed 638) transitions.
Finished structural reductions, in 1 iterations. Remains : 297/948 places, 264/902 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 5) seen :0
Finished Best-First random walk after 3220 steps, including 2 resets, run visited all 5 properties in 8 ms. (steps per millisecond=402 )
Found 13 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2) (NOT p4)), (X (NOT (AND p0 p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT p3)), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 p1 (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p4)))), (X (X (NOT (AND (NOT p0) p3 p4)))), true, (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3) p4)))), (X (X (NOT (AND p3 p4)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 p4)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3) p4)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) p4)))), (X (X (NOT (AND p0 p3 p4)))), (X (X (NOT (AND p1 (NOT p3) p4)))), (X (X (NOT (AND p0 p1 (NOT p3) p4)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3) p4)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p4))), (G (NOT (AND p4 (NOT p3) p2))), (G (NOT (AND p0 p4 (NOT p3) p1))), (G (NOT (AND p0 p3))), (G (NOT (AND p0 p4 (NOT p3) p2))), (G (NOT (AND (NOT p0) p4 (NOT p3) p2))), (G (NOT (AND p0 p4 (NOT p3) p2 (NOT p1)))), (G (NOT (AND p0 p4))), (G (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (G (NOT (AND p4 (NOT p3) p2 (NOT p1)))), (G (NOT (AND p4 p3))), (G (NOT (AND (NOT p0) p4 (NOT p3) p2 (NOT p1)))), (G (NOT (AND p0 p4 p3))), (G (NOT (AND (NOT p0) p4 p3)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p0) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (F (AND (NOT p0) p3)), (F (AND (NOT p3) p1)), (F (AND p0 (NOT p3) p2)), (F (AND (NOT p0) (NOT p3) p2)), (F (AND (NOT p0) (NOT p3) p2 (NOT p1))), (F p0), (F (AND (NOT p4) p3)), (F (AND (NOT p3) p2 (NOT p1))), (F p3), (F (AND (NOT p0) p4 (NOT p3))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (AND (NOT p0) (NOT p3) p1)), (F (AND p4 (NOT p3) p1)), (F (AND (NOT p3) p2)), (F (AND (NOT p0) p4 (NOT p3) p1)), (F p4), (F (AND (NOT p4) (NOT p3) p1)), (F (AND p0 (NOT p3) p1)), (F (AND (NOT p4) (NOT p3) p2 (NOT p1))), (F (AND (NOT p4) (NOT p3) p2))]
Knowledge based reduction with 55 factoid took 19360 ms. Reduced automaton from 17 states, 79 edges and 5 AP to 9 states, 19 edges and 5 AP.
Stuttering acceptance computed with spot in 392 ms :[(OR (AND (NOT p0) p4) (AND p3 p4)), p4, p4, (AND p3 p4), (AND p3 p4), true, (AND p1 p3 p4), p3, p3]
Stuttering acceptance computed with spot in 352 ms :[(OR (AND (NOT p0) p4) (AND p3 p4)), p4, p4, (AND p3 p4), (AND p3 p4), true, (AND p1 p3 p4), p3, p3]
Support contains 8 out of 948 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 948/948 places, 902/902 transitions.
Applied a total of 0 rules in 53 ms. Remains 948 /948 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:17:27] [INFO ] Computed 46 place invariants in 4 ms
[2022-05-17 05:17:27] [INFO ] Implicit Places using invariants in 819 ms returned []
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:17:27] [INFO ] Computed 46 place invariants in 5 ms
[2022-05-17 05:17:31] [INFO ] Implicit Places using invariants and state equation in 3856 ms returned []
Implicit Place search using SMT with State Equation took 4678 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:17:31] [INFO ] Computed 46 place invariants in 8 ms
[2022-05-17 05:17:32] [INFO ] Dead Transitions using invariants and state equation in 1093 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 948/948 places, 902/902 transitions.
Computed a total of 948 stabilizing places and 902 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 948 transition count 902
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 (NOT p0) (NOT p3) (NOT p1) (NOT p2) (NOT p4)), (X (NOT (AND (NOT p3) p1))), (X (NOT (AND (NOT p3) (NOT p1) p2))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p3) (NOT p1) p2)))), (X (X (NOT (AND (NOT p3) p2)))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p4)))]
False Knowledge obtained : [(X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) p1))))]
Knowledge based reduction with 12 factoid took 867 ms. Reduced automaton from 9 states, 19 edges and 5 AP to 9 states, 19 edges and 5 AP.
Stuttering acceptance computed with spot in 347 ms :[(OR (AND (NOT p0) p4) (AND p3 p4)), p4, p4, (AND p3 p4), (AND p3 p4), true, (AND p1 p3 p4), p3, p3]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:17:34] [INFO ] Computed 46 place invariants in 4 ms
[2022-05-17 05:17:35] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 223 ms returned sat
[2022-05-17 05:17:36] [INFO ] After 1315ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 05:17:36] [INFO ] [Nat]Absence check using 0 positive and 46 generalized place invariants in 199 ms returned sat
[2022-05-17 05:17:37] [INFO ] After 724ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 05:17:37] [INFO ] After 990ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 177 ms.
[2022-05-17 05:17:37] [INFO ] After 1600ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 29 ms.
Support contains 6 out of 948 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 948/948 places, 902/902 transitions.
Graph (complete) has 1815 edges and 948 vertex of which 933 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 0 output transitions
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 386 transitions
Trivial Post-agglo rules discarded 386 transitions
Performed 386 trivial Post agglomeration. Transition count delta: 386
Iterating post reduction 0 with 401 rules applied. Total rules applied 402 place count 933 transition count 501
Reduce places removed 386 places and 0 transitions.
Graph (complete) has 976 edges and 547 vertex of which 476 are kept as prefixes of interest. Removing 71 places using SCC suffix rule.0 ms
Discarding 71 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 387 rules applied. Total rules applied 789 place count 476 transition count 501
Drop transitions removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Iterating post reduction 2 with 71 rules applied. Total rules applied 860 place count 476 transition count 430
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 862 place count 474 transition count 428
Iterating global reduction 3 with 2 rules applied. Total rules applied 864 place count 474 transition count 428
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 865 place count 473 transition count 427
Iterating global reduction 3 with 1 rules applied. Total rules applied 866 place count 473 transition count 427
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 890 place count 473 transition count 403
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 914 place count 449 transition count 403
Reduce places removed 37 places and 37 transitions.
Iterating global reduction 4 with 37 rules applied. Total rules applied 951 place count 412 transition count 366
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 4 with 115 rules applied. Total rules applied 1066 place count 398 transition count 265
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 5 with 101 rules applied. Total rules applied 1167 place count 297 transition count 265
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 25 Pre rules applied. Total rules applied 1167 place count 297 transition count 240
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 1217 place count 272 transition count 240
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 1218 place count 271 transition count 240
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1218 place count 271 transition count 239
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 1220 place count 270 transition count 239
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1226 place count 267 transition count 236
Applied a total of 1226 rules in 85 ms. Remains 267 /948 variables (removed 681) and now considering 236/902 (removed 666) transitions.
Finished structural reductions, in 1 iterations. Remains : 267/948 places, 236/902 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Finished Best-First random walk after 802 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=401 )
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2) (NOT p4)), (X (NOT (AND (NOT p3) p1))), (X (NOT (AND (NOT p3) (NOT p1) p2))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p3) (NOT p1) p2)))), (X (X (NOT (AND (NOT p3) p2)))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p4)))]
False Knowledge obtained : [(X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) p1)))), (F p3), (F p4), (F (AND p4 p1)), (F (AND (NOT p3) p2)), (F (NOT (OR (NOT p0) p3))), (F (AND (NOT p3) p1)), (F (AND (NOT p3) p2 (NOT p1))), (F (AND (NOT p4) (NOT p3) p1))]
Knowledge based reduction with 12 factoid took 1156 ms. Reduced automaton from 9 states, 19 edges and 5 AP to 9 states, 19 edges and 5 AP.
Stuttering acceptance computed with spot in 360 ms :[(OR (AND (NOT p0) p4) (AND p3 p4)), p4, p4, (AND p3 p4), (AND p3 p4), true, (AND p1 p3 p4), p3, p3]
Stuttering acceptance computed with spot in 352 ms :[(OR (AND (NOT p0) p4) (AND p3 p4)), p4, p4, (AND p3 p4), (AND p3 p4), true, (AND p1 p3 p4), p3, p3]
Stuttering acceptance computed with spot in 377 ms :[(OR (AND (NOT p0) p4) (AND p3 p4)), p4, p4, (AND p3 p4), (AND p3 p4), true, (AND p1 p3 p4), p3, p3]
Product exploration explored 100000 steps with 25077 reset in 852 ms.
Product exploration explored 100000 steps with 25035 reset in 911 ms.
Applying partial POR strategy [false, false, true, false, false, true, false, true, true]
Stuttering acceptance computed with spot in 354 ms :[(OR (AND (NOT p0) p4) (AND p3 p4)), p4, p4, (AND p3 p4), (AND p3 p4), true, (AND p1 p3 p4), p3, p3]
Support contains 8 out of 948 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 948/948 places, 902/902 transitions.
Performed 375 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 375 rules applied. Total rules applied 375 place count 948 transition count 902
Deduced a syphon composed of 375 places in 8 ms
Applied a total of 375 rules in 61 ms. Remains 948 /948 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2022-05-17 05:17:42] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:17:42] [INFO ] Computed 46 place invariants in 4 ms
[2022-05-17 05:17:43] [INFO ] Dead Transitions using invariants and state equation in 1215 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 948/948 places, 902/902 transitions.
Finished structural reductions, in 1 iterations. Remains : 948/948 places, 902/902 transitions.
Product exploration explored 100000 steps with 25014 reset in 3561 ms.
Product exploration explored 100000 steps with 24950 reset in 3518 ms.
Built C files in :
/tmp/ltsmin4481990664488893811
[2022-05-17 05:17:50] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4481990664488893811
Running compilation step : cd /tmp/ltsmin4481990664488893811;'/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 2558 ms.
Running link step : cd /tmp/ltsmin4481990664488893811;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4481990664488893811;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2180372502388388406.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 948 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 948/948 places, 902/902 transitions.
Applied a total of 0 rules in 39 ms. Remains 948 /948 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:18:06] [INFO ] Computed 46 place invariants in 5 ms
[2022-05-17 05:18:06] [INFO ] Implicit Places using invariants in 860 ms returned []
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:18:06] [INFO ] Computed 46 place invariants in 5 ms
[2022-05-17 05:18:10] [INFO ] Implicit Places using invariants and state equation in 3804 ms returned []
Implicit Place search using SMT with State Equation took 4671 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:18:10] [INFO ] Computed 46 place invariants in 4 ms
[2022-05-17 05:18:11] [INFO ] Dead Transitions using invariants and state equation in 1160 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 948/948 places, 902/902 transitions.
Built C files in :
/tmp/ltsmin9483209820987672597
[2022-05-17 05:18:11] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9483209820987672597
Running compilation step : cd /tmp/ltsmin9483209820987672597;'/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 2533 ms.
Running link step : cd /tmp/ltsmin9483209820987672597;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9483209820987672597;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7905035852670503675.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 05:18:27] [INFO ] Flatten gal took : 43 ms
[2022-05-17 05:18:27] [INFO ] Flatten gal took : 35 ms
[2022-05-17 05:18:27] [INFO ] Time to serialize gal into /tmp/LTL12561177331999444748.gal : 4 ms
[2022-05-17 05:18:27] [INFO ] Time to serialize properties into /tmp/LTL13263959191106417391.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/LTL12561177331999444748.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13263959191106417391.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/LTL1256117...268
Read 1 LTL properties
Checking formula 0 : !((G(("(((newmsg24>=1)&&(election_25_0_1_to_left_25>=1))&&(rcv_left_reply_40_5_34>=1))")U(X(!((("((newmsg24>=1)&&(election_25_0_1_to_l...315
Formula 0 simplified : !G("(((newmsg24>=1)&&(election_25_0_1_to_left_25>=1))&&(rcv_left_reply_40_5_34>=1))" U X!(("((newmsg24>=1)&&(election_25_0_1_to_left...305
Detected timeout of ITS tools.
[2022-05-17 05:18:42] [INFO ] Flatten gal took : 33 ms
[2022-05-17 05:18:42] [INFO ] Applying decomposition
[2022-05-17 05:18:42] [INFO ] Flatten gal took : 34 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/graph15129187874628632107.txt' '-o' '/tmp/graph15129187874628632107.bin' '-w' '/tmp/graph15129187874628632107.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15129187874628632107.bin' '-l' '-1' '-v' '-w' '/tmp/graph15129187874628632107.weights' '-q' '0' '-e' '0.001'
[2022-05-17 05:18:42] [INFO ] Decomposing Gal with order
[2022-05-17 05:18:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 05:18:42] [INFO ] Removed a total of 101 redundant transitions.
[2022-05-17 05:18:42] [INFO ] Flatten gal took : 76 ms
[2022-05-17 05:18:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-17 05:18:42] [INFO ] Time to serialize gal into /tmp/LTL16666101078865983168.gal : 11 ms
[2022-05-17 05:18:42] [INFO ] Time to serialize properties into /tmp/LTL9968132022383672238.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/LTL16666101078865983168.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9968132022383672238.ltl' '-c' '-stutter-deadlock'
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/LTL1666610...246
Read 1 LTL properties
Checking formula 0 : !((G(("(((i5.i0.u21.newmsg24>=1)&&(i5.i0.u47.election_25_0_1_to_left_25>=1))&&(i8.i0.u30.rcv_left_reply_40_5_34>=1))")U(X(!((("((i5.i0...401
Formula 0 simplified : !G("(((i5.i0.u21.newmsg24>=1)&&(i5.i0.u47.election_25_0_1_to_left_25>=1))&&(i8.i0.u30.rcv_left_reply_40_5_34>=1))" U X!(("((i5.i0.u2...391
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13764150851699404520
[2022-05-17 05:18:57] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13764150851699404520
Running compilation step : cd /tmp/ltsmin13764150851699404520;'/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 2461 ms.
Running link step : cd /tmp/ltsmin13764150851699404520;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin13764150851699404520;'/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) U X(!(((LTLAPp1==true) U ((LTLAPp2==true) U (LTLAPp3==true))) U X((LTLAPp4==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-40-LTLFireability-12 finished in 160631 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((G(F(G(p1)))||p0))&&(F(p2)||p3))))'
Support contains 4 out of 949 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 949/949 places, 903/903 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 948 transition count 902
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 948 transition count 902
Applied a total of 2 rules in 85 ms. Remains 948 /949 variables (removed 1) and now considering 902/903 (removed 1) transitions.
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:19:12] [INFO ] Computed 46 place invariants in 5 ms
[2022-05-17 05:19:13] [INFO ] Implicit Places using invariants in 846 ms returned []
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:19:13] [INFO ] Computed 46 place invariants in 4 ms
[2022-05-17 05:19:17] [INFO ] Implicit Places using invariants and state equation in 3846 ms returned []
Implicit Place search using SMT with State Equation took 4694 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:19:17] [INFO ] Computed 46 place invariants in 4 ms
[2022-05-17 05:19:18] [INFO ] Dead Transitions using invariants and state equation in 1151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 948/949 places, 902/903 transitions.
Finished structural reductions, in 1 iterations. Remains : 948/949 places, 902/903 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (GEQ s1 1) (GEQ s279 1)), p2:(AND (GEQ s1 1) (GEQ s291 1)), p0:(OR (LT s1 1) (LT s291 1)), p1:(GEQ s785 1)], nbAcceptance=1, 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 608 reset in 572 ms.
Product exploration explored 100000 steps with 599 reset in 633 ms.
Computed a total of 948 stabilizing places and 902 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 948 transition count 902
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 (NOT p3) (NOT p2) p0 (NOT p1)), (X p0), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 366 ms. Reduced automaton from 4 states, 7 edges and 4 AP to 3 states, 6 edges and 4 AP.
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p1)]
Finished random walk after 855 steps, including 0 resets, run visited all 4 properties in 16 ms. (steps per millisecond=53 )
Knowledge obtained : [(AND (NOT p3) (NOT p2) p0 (NOT p1)), (X p0), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p3) (NOT p2)))), (F p2), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 431 ms. Reduced automaton from 3 states, 6 edges and 4 AP to 3 states, 6 edges and 4 AP.
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p1)]
// Phase 1: matrix 902 rows 948 cols
[2022-05-17 05:19:21] [INFO ] Computed 46 place invariants in 4 ms
[2022-05-17 05:19:22] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 251 ms returned sat
[2022-05-17 05:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 05:19:36] [INFO ] [Real]Absence check using state equation in 13788 ms returned unknown
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 4 out of 948 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 948/948 places, 902/902 transitions.
Reduce places removed 39 places and 39 transitions.
Drop transitions removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 392 place count 909 transition count 471
Reduce places removed 392 places and 0 transitions.
Iterating post reduction 1 with 392 rules applied. Total rules applied 784 place count 517 transition count 471
Applied a total of 784 rules in 26 ms. Remains 517 /948 variables (removed 431) and now considering 471/902 (removed 431) transitions.
// Phase 1: matrix 471 rows 517 cols
[2022-05-17 05:19:36] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:19:37] [INFO ] Implicit Places using invariants in 756 ms returned []
// Phase 1: matrix 471 rows 517 cols
[2022-05-17 05:19:37] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:19:40] [INFO ] Implicit Places using invariants and state equation in 2700 ms returned []
Implicit Place search using SMT with State Equation took 3458 ms to find 0 implicit places.
[2022-05-17 05:19:40] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 471 rows 517 cols
[2022-05-17 05:19:40] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:19:40] [INFO ] Dead Transitions using invariants and state equation in 687 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 517/948 places, 471/902 transitions.
Finished structural reductions, in 1 iterations. Remains : 517/948 places, 471/902 transitions.
Computed a total of 517 stabilizing places and 471 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 517 transition count 471
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 (NOT p3) (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 353 ms. Reduced automaton from 3 states, 6 edges and 4 AP to 3 states, 6 edges and 4 AP.
Stuttering acceptance computed with spot in 115 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p1)]
Finished random walk after 463 steps, including 0 resets, run visited all 4 properties in 8 ms. (steps per millisecond=57 )
Knowledge obtained : [(AND (NOT p3) (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p3) (NOT p2)))), (F p2), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 436 ms. Reduced automaton from 3 states, 6 edges and 4 AP to 3 states, 6 edges and 4 AP.
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p1)]
// Phase 1: matrix 471 rows 517 cols
[2022-05-17 05:19:42] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:19:43] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 420 ms returned sat
[2022-05-17 05:19:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 05:19:55] [INFO ] [Real]Absence check using state equation in 12648 ms returned sat
[2022-05-17 05:19:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 05:19:56] [INFO ] [Nat]Absence check using 0 positive and 46 generalized place invariants in 404 ms returned sat
[2022-05-17 05:19:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 05:20:02] [INFO ] [Nat]Absence check using state equation in 6333 ms returned sat
[2022-05-17 05:20:03] [INFO ] Computed and/alt/rep : 379/387/379 causal constraints (skipped 15 transitions) in 37 ms.
[2022-05-17 05:20:03] [INFO ] Added : 29 causal constraints over 6 iterations in 728 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 124 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 665 reset in 549 ms.
Product exploration explored 100000 steps with 664 reset in 605 ms.
Built C files in :
/tmp/ltsmin18305244655312759693
[2022-05-17 05:20:05] [INFO ] Computing symmetric may disable matrix : 471 transitions.
[2022-05-17 05:20:05] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 05:20:05] [INFO ] Computing symmetric may enable matrix : 471 transitions.
[2022-05-17 05:20:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 05:20:05] [INFO ] Computing Do-Not-Accords matrix : 471 transitions.
[2022-05-17 05:20:05] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 05:20:05] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18305244655312759693
Running compilation step : cd /tmp/ltsmin18305244655312759693;'/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 1628 ms.
Running link step : cd /tmp/ltsmin18305244655312759693;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin18305244655312759693;'/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/stateBased13661175541650023727.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 517 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 517/517 places, 471/471 transitions.
Applied a total of 0 rules in 16 ms. Remains 517 /517 variables (removed 0) and now considering 471/471 (removed 0) transitions.
// Phase 1: matrix 471 rows 517 cols
[2022-05-17 05:20:20] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:20:20] [INFO ] Implicit Places using invariants in 783 ms returned []
// Phase 1: matrix 471 rows 517 cols
[2022-05-17 05:20:20] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:20:23] [INFO ] Implicit Places using invariants and state equation in 2524 ms returned []
Implicit Place search using SMT with State Equation took 3310 ms to find 0 implicit places.
[2022-05-17 05:20:23] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 471 rows 517 cols
[2022-05-17 05:20:23] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:20:24] [INFO ] Dead Transitions using invariants and state equation in 714 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 517/517 places, 471/471 transitions.
Built C files in :
/tmp/ltsmin7522624575244001264
[2022-05-17 05:20:24] [INFO ] Computing symmetric may disable matrix : 471 transitions.
[2022-05-17 05:20:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 05:20:24] [INFO ] Computing symmetric may enable matrix : 471 transitions.
[2022-05-17 05:20:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 05:20:24] [INFO ] Computing Do-Not-Accords matrix : 471 transitions.
[2022-05-17 05:20:24] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 05:20:24] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7522624575244001264
Running compilation step : cd /tmp/ltsmin7522624575244001264;'/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 1599 ms.
Running link step : cd /tmp/ltsmin7522624575244001264;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin7522624575244001264;'/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/stateBased17962967875361834597.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 05:20:39] [INFO ] Flatten gal took : 17 ms
[2022-05-17 05:20:39] [INFO ] Flatten gal took : 22 ms
[2022-05-17 05:20:39] [INFO ] Time to serialize gal into /tmp/LTL14561312306880072129.gal : 2 ms
[2022-05-17 05:20:39] [INFO ] Time to serialize properties into /tmp/LTL16545450379313102062.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/LTL14561312306880072129.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16545450379313102062.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/LTL1456131...268
Read 1 LTL properties
Checking formula 0 : !((G((X(((G(F(G("(rcv_right_election_40_6_18_22>=1)"))))||("(newmsg1<1)"))||("(reply_40_2_to_left_2<1)")))&&((F("((newmsg1>=1)&&(reply...236
Formula 0 simplified : !G(X("(newmsg1<1)" | "(reply_40_2_to_left_2<1)" | GFG"(rcv_right_election_40_6_18_22>=1)") & ("((newmsg1>=1)&&(election_40_2_1_to_ri...216
Detected timeout of ITS tools.
[2022-05-17 05:20:54] [INFO ] Flatten gal took : 17 ms
[2022-05-17 05:20:54] [INFO ] Applying decomposition
[2022-05-17 05:20:54] [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/graph17855519127217646471.txt' '-o' '/tmp/graph17855519127217646471.bin' '-w' '/tmp/graph17855519127217646471.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17855519127217646471.bin' '-l' '-1' '-v' '-w' '/tmp/graph17855519127217646471.weights' '-q' '0' '-e' '0.001'
[2022-05-17 05:20:54] [INFO ] Decomposing Gal with order
[2022-05-17 05:20:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 05:20:54] [INFO ] Removed a total of 315 redundant transitions.
[2022-05-17 05:20:54] [INFO ] Flatten gal took : 40 ms
[2022-05-17 05:20:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 7 ms.
[2022-05-17 05:20:54] [INFO ] Time to serialize gal into /tmp/LTL9122431319895791388.gal : 10 ms
[2022-05-17 05:20:54] [INFO ] Time to serialize properties into /tmp/LTL12559453650993321715.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/LTL9122431319895791388.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12559453650993321715.ltl' '-c' '-stutter-deadlock'
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/LTL9122431...246
Read 1 LTL properties
Checking formula 0 : !((G((X(((G(F(G("(i4.u1.rcv_right_election_40_6_18_22>=1)"))))||("(i0.u3.newmsg1<1)"))||("(i0.u0.reply_40_2_to_left_2<1)")))&&((F("((i...278
Formula 0 simplified : !G(X("(i0.u0.reply_40_2_to_left_2<1)" | "(i0.u3.newmsg1<1)" | GFG"(i4.u1.rcv_right_election_40_6_18_22>=1)") & ("((i0.u3.newmsg1>=1)...258
Reverse transition relation is NOT exact ! Due to transitions t54_t55, t74_t75, t94_t95, t123_t124, t155_t156, t179_t180, t201_t202, t782, i0.t50_t51, i0.t...713
Computing Next relation with stutter on 8.73115e+28 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16526179871618567683
[2022-05-17 05:21:09] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16526179871618567683
Running compilation step : cd /tmp/ltsmin16526179871618567683;'/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 1245 ms.
Running link step : cd /tmp/ltsmin16526179871618567683;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16526179871618567683;'/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' '[]((X(([](<>([]((LTLAPp1==true))))||(LTLAPp0==true)))&&(<>((LTLAPp2==true))||(LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-40-LTLFireability-13 finished in 132049 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 949 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 949/949 places, 903/903 transitions.
Reduce places removed 38 places and 38 transitions.
Drop transitions removed 397 transitions
Trivial Post-agglo rules discarded 397 transitions
Performed 397 trivial Post agglomeration. Transition count delta: 397
Iterating post reduction 0 with 397 rules applied. Total rules applied 397 place count 911 transition count 468
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 1 with 397 rules applied. Total rules applied 794 place count 514 transition count 468
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 795 place count 513 transition count 467
Iterating global reduction 2 with 1 rules applied. Total rules applied 796 place count 513 transition count 467
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 797 place count 513 transition count 466
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 798 place count 512 transition count 466
Applied a total of 798 rules in 61 ms. Remains 512 /949 variables (removed 437) and now considering 466/903 (removed 437) transitions.
// Phase 1: matrix 466 rows 512 cols
[2022-05-17 05:21:24] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:21:25] [INFO ] Implicit Places using invariants in 785 ms returned []
// Phase 1: matrix 466 rows 512 cols
[2022-05-17 05:21:25] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:21:26] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 05:21:27] [INFO ] Implicit Places using invariants and state equation in 2198 ms returned []
Implicit Place search using SMT with State Equation took 2995 ms to find 0 implicit places.
[2022-05-17 05:21:27] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 466 rows 512 cols
[2022-05-17 05:21:27] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:21:28] [INFO ] Dead Transitions using invariants and state equation in 718 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 512/949 places, 466/903 transitions.
Finished structural reductions, in 1 iterations. Remains : 512/949 places, 466/903 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 507 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-LTLFireability-15 finished in 3844 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U ((F(p3) U X(!p4))&&p2)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(!((p1 U (p2 U p3)) U X(p4))))))'
Warning : SL/CL computation failed.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((G(F(G(p1)))||p0))&&(F(p2)||p3))))'
Found a SL insensitive property : HirschbergSinclair-PT-40-LTLFireability-13
Stuttering acceptance computed with spot in 177 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 949 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 949/949 places, 903/903 transitions.
Reduce places removed 39 places and 39 transitions.
Drop transitions removed 391 transitions
Trivial Post-agglo rules discarded 391 transitions
Performed 391 trivial Post agglomeration. Transition count delta: 391
Iterating post reduction 0 with 391 rules applied. Total rules applied 391 place count 910 transition count 473
Reduce places removed 391 places and 0 transitions.
Iterating post reduction 1 with 391 rules applied. Total rules applied 782 place count 519 transition count 473
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 783 place count 518 transition count 472
Iterating global reduction 2 with 1 rules applied. Total rules applied 784 place count 518 transition count 472
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 785 place count 518 transition count 471
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 786 place count 517 transition count 471
Applied a total of 786 rules in 49 ms. Remains 517 /949 variables (removed 432) and now considering 471/903 (removed 432) transitions.
// Phase 1: matrix 471 rows 517 cols
[2022-05-17 05:21:39] [INFO ] Computed 46 place invariants in 3 ms
[2022-05-17 05:21:39] [INFO ] Implicit Places using invariants in 595 ms returned []
// Phase 1: matrix 471 rows 517 cols
[2022-05-17 05:21:39] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:21:42] [INFO ] Implicit Places using invariants and state equation in 2659 ms returned []
Implicit Place search using SMT with State Equation took 3280 ms to find 0 implicit places.
// Phase 1: matrix 471 rows 517 cols
[2022-05-17 05:21:42] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:21:43] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 517/949 places, 471/903 transitions.
Finished structural reductions, in 1 iterations. Remains : 517/949 places, 471/903 transitions.
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (GEQ s1 1) (GEQ s147 1)), p2:(AND (GEQ s1 1) (GEQ s155 1)), p0:(OR (LT s1 1) (LT s155 1)), p1:(GEQ s413 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1326 reset in 577 ms.
Product exploration explored 100000 steps with 1327 reset in 622 ms.
Computed a total of 517 stabilizing places and 471 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 517 transition count 471
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 (NOT p3) (NOT p2) p0 (NOT p1)), (X p0), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 394 ms. Reduced automaton from 4 states, 7 edges and 4 AP to 3 states, 6 edges and 4 AP.
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p1)]
Finished random walk after 450 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=75 )
Knowledge obtained : [(AND (NOT p3) (NOT p2) p0 (NOT p1)), (X p0), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p3) (NOT p2)))), (F p2), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 451 ms. Reduced automaton from 3 states, 6 edges and 4 AP to 3 states, 6 edges and 4 AP.
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p1)]
// Phase 1: matrix 471 rows 517 cols
[2022-05-17 05:21:45] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:21:46] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 421 ms returned sat
[2022-05-17 05:21:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 05:21:59] [INFO ] [Real]Absence check using state equation in 12397 ms returned sat
[2022-05-17 05:21:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 05:22:00] [INFO ] [Nat]Absence check using 0 positive and 46 generalized place invariants in 404 ms returned sat
[2022-05-17 05:22:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 05:22:06] [INFO ] [Nat]Absence check using state equation in 6305 ms returned sat
[2022-05-17 05:22:06] [INFO ] Computed and/alt/rep : 379/387/379 causal constraints (skipped 15 transitions) in 34 ms.
[2022-05-17 05:22:07] [INFO ] Added : 29 causal constraints over 6 iterations in 696 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 4 out of 517 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 517/517 places, 471/471 transitions.
Applied a total of 0 rules in 17 ms. Remains 517 /517 variables (removed 0) and now considering 471/471 (removed 0) transitions.
// Phase 1: matrix 471 rows 517 cols
[2022-05-17 05:22:07] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:22:07] [INFO ] Implicit Places using invariants in 769 ms returned []
// Phase 1: matrix 471 rows 517 cols
[2022-05-17 05:22:07] [INFO ] Computed 46 place invariants in 5 ms
[2022-05-17 05:22:10] [INFO ] Implicit Places using invariants and state equation in 2429 ms returned []
Implicit Place search using SMT with State Equation took 3200 ms to find 0 implicit places.
[2022-05-17 05:22:10] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 471 rows 517 cols
[2022-05-17 05:22:10] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:22:11] [INFO ] Dead Transitions using invariants and state equation in 683 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 517/517 places, 471/471 transitions.
Computed a total of 517 stabilizing places and 471 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 517 transition count 471
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 (NOT p3) (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 354 ms. Reduced automaton from 3 states, 6 edges and 4 AP to 3 states, 6 edges and 4 AP.
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p1)]
Finished random walk after 440 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=62 )
Knowledge obtained : [(AND (NOT p3) (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p3) (NOT p2)))), (F p2), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 508 ms. Reduced automaton from 3 states, 6 edges and 4 AP to 3 states, 6 edges and 4 AP.
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p1)]
// Phase 1: matrix 471 rows 517 cols
[2022-05-17 05:22:12] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:22:13] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 409 ms returned sat
[2022-05-17 05:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 05:22:25] [INFO ] [Real]Absence check using state equation in 12477 ms returned sat
[2022-05-17 05:22:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 05:22:26] [INFO ] [Nat]Absence check using 0 positive and 46 generalized place invariants in 408 ms returned sat
[2022-05-17 05:22:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 05:22:33] [INFO ] [Nat]Absence check using state equation in 6408 ms returned sat
[2022-05-17 05:22:33] [INFO ] Computed and/alt/rep : 379/387/379 causal constraints (skipped 15 transitions) in 35 ms.
[2022-05-17 05:22:34] [INFO ] Added : 29 causal constraints over 6 iterations in 703 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 127 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 664 reset in 553 ms.
Product exploration explored 100000 steps with 664 reset in 611 ms.
Built C files in :
/tmp/ltsmin4461721461759830990
[2022-05-17 05:22:35] [INFO ] Computing symmetric may disable matrix : 471 transitions.
[2022-05-17 05:22:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 05:22:35] [INFO ] Computing symmetric may enable matrix : 471 transitions.
[2022-05-17 05:22:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 05:22:35] [INFO ] Computing Do-Not-Accords matrix : 471 transitions.
[2022-05-17 05:22:35] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 05:22:35] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4461721461759830990
Running compilation step : cd /tmp/ltsmin4461721461759830990;'/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 1607 ms.
Running link step : cd /tmp/ltsmin4461721461759830990;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin4461721461759830990;'/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/stateBased7316361621491362620.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 517 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 517/517 places, 471/471 transitions.
Applied a total of 0 rules in 24 ms. Remains 517 /517 variables (removed 0) and now considering 471/471 (removed 0) transitions.
// Phase 1: matrix 471 rows 517 cols
[2022-05-17 05:22:50] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:22:51] [INFO ] Implicit Places using invariants in 736 ms returned []
// Phase 1: matrix 471 rows 517 cols
[2022-05-17 05:22:51] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:22:53] [INFO ] Implicit Places using invariants and state equation in 2504 ms returned []
Implicit Place search using SMT with State Equation took 3246 ms to find 0 implicit places.
[2022-05-17 05:22:53] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 471 rows 517 cols
[2022-05-17 05:22:53] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-17 05:22:54] [INFO ] Dead Transitions using invariants and state equation in 751 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 517/517 places, 471/471 transitions.
Built C files in :
/tmp/ltsmin12899038835374389558
[2022-05-17 05:22:54] [INFO ] Computing symmetric may disable matrix : 471 transitions.
[2022-05-17 05:22:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 05:22:54] [INFO ] Computing symmetric may enable matrix : 471 transitions.
[2022-05-17 05:22:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 05:22:54] [INFO ] Computing Do-Not-Accords matrix : 471 transitions.
[2022-05-17 05:22:54] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 05:22:54] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12899038835374389558
Running compilation step : cd /tmp/ltsmin12899038835374389558;'/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 1672 ms.
Running link step : cd /tmp/ltsmin12899038835374389558;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12899038835374389558;'/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/stateBased11040943667142698921.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 05:23:09] [INFO ] Flatten gal took : 19 ms
[2022-05-17 05:23:09] [INFO ] Flatten gal took : 17 ms
[2022-05-17 05:23:09] [INFO ] Time to serialize gal into /tmp/LTL13221011193635243903.gal : 2 ms
[2022-05-17 05:23:09] [INFO ] Time to serialize properties into /tmp/LTL284867478807857838.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/LTL13221011193635243903.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL284867478807857838.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/LTL1322101...266
Read 1 LTL properties
Checking formula 0 : !((G((X(((G(F(G("(rcv_right_election_40_6_18_22>=1)"))))||("(newmsg1<1)"))||("(reply_40_2_to_left_2<1)")))&&((F("((newmsg1>=1)&&(reply...236
Formula 0 simplified : !G(X("(newmsg1<1)" | "(reply_40_2_to_left_2<1)" | GFG"(rcv_right_election_40_6_18_22>=1)") & ("((newmsg1>=1)&&(election_40_2_1_to_ri...216
Detected timeout of ITS tools.
[2022-05-17 05:23:24] [INFO ] Flatten gal took : 16 ms
[2022-05-17 05:23:24] [INFO ] Applying decomposition
[2022-05-17 05:23:24] [INFO ] Flatten gal took : 15 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/graph1743357597304202419.txt' '-o' '/tmp/graph1743357597304202419.bin' '-w' '/tmp/graph1743357597304202419.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1743357597304202419.bin' '-l' '-1' '-v' '-w' '/tmp/graph1743357597304202419.weights' '-q' '0' '-e' '0.001'
[2022-05-17 05:23:24] [INFO ] Decomposing Gal with order
[2022-05-17 05:23:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 05:23:24] [INFO ] Removed a total of 318 redundant transitions.
[2022-05-17 05:23:24] [INFO ] Flatten gal took : 36 ms
[2022-05-17 05:23:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 9 ms.
[2022-05-17 05:23:24] [INFO ] Time to serialize gal into /tmp/LTL14948730450838812683.gal : 7 ms
[2022-05-17 05:23:24] [INFO ] Time to serialize properties into /tmp/LTL4357885479547601216.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/LTL14948730450838812683.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4357885479547601216.ltl' '-c' '-stutter-deadlock'
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/LTL1494873...246
Read 1 LTL properties
Checking formula 0 : !((G((X(((G(F(G("(i7.u2.rcv_right_election_40_6_18_22>=1)"))))||("(i0.u0.newmsg1<1)"))||("(i1.u1.reply_40_2_to_left_2<1)")))&&((F("((i...278
Formula 0 simplified : !G(X("(i0.u0.newmsg1<1)" | "(i1.u1.reply_40_2_to_left_2<1)" | GFG"(i7.u2.rcv_right_election_40_6_18_22>=1)") & ("((i0.u0.newmsg1>=1)...258
Reverse transition relation is NOT exact ! Due to transitions t74_t75, t98_t99, t115_t116, t167_t168, t187_t188, t214_t215, t296_t297, t544_t545, i0.t861_t...712
Computing Next relation with stutter on 8.73115e+28 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10588554747090793063
[2022-05-17 05:23:39] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10588554747090793063
Running compilation step : cd /tmp/ltsmin10588554747090793063;'/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 1192 ms.
Running link step : cd /tmp/ltsmin10588554747090793063;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10588554747090793063;'/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' '[]((X(([](<>([]((LTLAPp1==true))))||(LTLAPp0==true)))&&(<>((LTLAPp2==true))||(LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-40-LTLFireability-13 finished in 136127 ms.
[2022-05-17 05:23:55] [INFO ] Flatten gal took : 31 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18190189454735162982
[2022-05-17 05:23:55] [INFO ] Computing symmetric may disable matrix : 903 transitions.
[2022-05-17 05:23:55] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 05:23:55] [INFO ] Computing symmetric may enable matrix : 903 transitions.
[2022-05-17 05:23:55] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 05:23:55] [INFO ] Applying decomposition
[2022-05-17 05:23:55] [INFO ] Flatten gal took : 31 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/graph12972673983596809918.txt' '-o' '/tmp/graph12972673983596809918.bin' '-w' '/tmp/graph12972673983596809918.weights'
[2022-05-17 05:23:55] [INFO ] Computing Do-Not-Accords matrix : 903 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12972673983596809918.bin' '-l' '-1' '-v' '-w' '/tmp/graph12972673983596809918.weights' '-q' '0' '-e' '0.001'
[2022-05-17 05:23:55] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 05:23:55] [INFO ] Decomposing Gal with order
[2022-05-17 05:23:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 05:23:55] [INFO ] Built C files in 182ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18190189454735162982
Running compilation step : cd /tmp/ltsmin18190189454735162982;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' '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-17 05:23:55] [INFO ] Removed a total of 96 redundant transitions.
[2022-05-17 05:23:55] [INFO ] Flatten gal took : 68 ms
[2022-05-17 05:23:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-17 05:23:55] [INFO ] Time to serialize gal into /tmp/LTLFireability5348075365119709498.gal : 11 ms
[2022-05-17 05:23:55] [INFO ] Time to serialize properties into /tmp/LTLFireability1474549629760794430.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/LTLFireability5348075365119709498.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1474549629760794430.ltl' '-c' '-stutter-deadlock'
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/LTLFireabi...267
Read 4 LTL properties
Checking formula 0 : !(((("(i4.u38.rcv_right_election_16_0_1_15>=1)")U("(i1.u33.rcv_right_election_40_6_37_3<1)"))U((((F("((i0.i1.u0.newmsg1>=1)&&(i0.i1.u3...383
Formula 0 simplified : !(("(i4.u38.rcv_right_election_16_0_1_15>=1)" U "(i1.u33.rcv_right_election_40_6_37_3<1)") U ("(i0.i1.u0.newmsg1>=1)" & "(i0.i1.u32....371
Compilation finished in 3989 ms.
Running link step : cd /tmp/ltsmin18190189454735162982;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin18190189454735162982;'/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) U (LTLAPp1==true)) U ((<>((LTLAPp3==true)) U X(!(LTLAPp4==true)))&&(LTLAPp2==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t5, t6, t7, t10, t13, t15, t16, t19, t22, t26, t29, t30, t33, t37, t38, t39, t49,...1438
Computing Next relation with stutter on 1.04774e+29 deadlock states
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin18190189454735162982;'/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) U (LTLAPp1==true)) U ((<>((LTLAPp3==true)) U X(!(LTLAPp4==true)))&&(LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin18190189454735162982;'/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' '<>((LTLAPp5==true))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-17 05:48:27] [INFO ] Flatten gal took : 98 ms
[2022-05-17 05:48:27] [INFO ] Time to serialize gal into /tmp/LTLFireability13259296229375441400.gal : 22 ms
[2022-05-17 05:48:27] [INFO ] Time to serialize properties into /tmp/LTLFireability5341379481308546003.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/LTLFireability13259296229375441400.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5341379481308546003.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/LTLFireabi...289
Read 4 LTL properties
Checking formula 0 : !(((("(rcv_right_election_16_0_1_15>=1)")U("(rcv_right_election_40_6_37_3<1)"))U((((F("((newmsg1>=1)&&(election_2_0_1_to_left_2>=1))")...310
Formula 0 simplified : !(("(rcv_right_election_16_0_1_15>=1)" U "(rcv_right_election_40_6_37_3<1)") U ("(election_2_0_1_to_left_2>=1)" & "(newmsg1>=1)" & (...298
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin18190189454735162982;'/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' '<>((LTLAPp5==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin18190189454735162982;'/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' '[](((LTLAPp6==true) U X(!(((LTLAPp7==true) U ((LTLAPp8==true) U (LTLAPp9==true))) U X((LTLAPp10==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...803
Computing Next relation with stutter on 1.04774e+29 deadlock states
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin18190189454735162982;'/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' '[](((LTLAPp6==true) U X(!(((LTLAPp7==true) U ((LTLAPp8==true) U (LTLAPp9==true))) U X((LTLAPp10==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin18190189454735162982;'/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' '[]((X(([](<>([]((LTLAPp12==true))))||(LTLAPp11==true)))&&(<>((LTLAPp13==true))||(LTLAPp14==true))))' '--buchi-type=spotba'
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="HirschbergSinclair-PT-40"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is HirschbergSinclair-PT-40, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-smll-165264477500324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-40.tgz
mv HirschbergSinclair-PT-40 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;