About the Execution of ITS-Tools for FamilyReunion-PT-L00100M0010C005P005G002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16176.760 | 3600000.00 | 7722074.00 | 16228.00 | ?TFFF?FTFTFFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110800739.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FamilyReunion-PT-L00100M0010C005P005G002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110800739
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 27M
-rw-r--r-- 1 mcc users 469K Apr 30 09:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.8M Apr 30 09:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 30 09:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.6M Apr 30 09:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 194K May 9 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 782K May 9 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 362K May 9 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 970K May 9 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 9 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 48K May 9 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 24 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 17M May 10 09:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-00
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-01
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-02
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-03
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-04
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-05
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-06
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-07
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-08
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-09
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-10
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-11
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-12
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-13
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-14
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652725653062
Running Version 202205111006
[2022-05-16 18:27:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 18:27:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 18:27:35] [INFO ] Load time of PNML (sax parser for PT used): 734 ms
[2022-05-16 18:27:35] [INFO ] Transformed 40605 places.
[2022-05-16 18:27:35] [INFO ] Transformed 36871 transitions.
[2022-05-16 18:27:35] [INFO ] Parsed PT model containing 40605 places and 36871 transitions in 977 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 2401 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 31 places and 0 transitions.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5668 out of 40574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40574/40574 places, 36871/36871 transitions.
Reduce places removed 340 places and 0 transitions.
Discarding 6665 places :
Implicit places reduction removed 6665 places
Iterating post reduction 0 with 7005 rules applied. Total rules applied 7005 place count 33569 transition count 36871
Discarding 202 places :
Symmetric choice reduction at 1 with 202 rule applications. Total rules 7207 place count 33367 transition count 36467
Iterating global reduction 1 with 202 rules applied. Total rules applied 7409 place count 33367 transition count 36467
Applied a total of 7409 rules in 1194 ms. Remains 33367 /40574 variables (removed 7207) and now considering 36467/36871 (removed 404) transitions.
// Phase 1: matrix 36467 rows 33367 cols
[2022-05-16 18:27:41] [INFO ] Computed 1925 place invariants in 1631 ms
[2022-05-16 18:27:43] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:27:43] [INFO ] Implicit Places using invariants in 4467 ms returned []
Implicit Place search using SMT only with invariants took 4496 ms to find 0 implicit places.
// Phase 1: matrix 36467 rows 33367 cols
[2022-05-16 18:27:45] [INFO ] Computed 1925 place invariants in 1432 ms
[2022-05-16 18:27:48] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:27:48] [INFO ] Dead Transitions using invariants and state equation in 4147 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33367/40574 places, 36467/36871 transitions.
Finished structural reductions, in 1 iterations. Remains : 33367/40574 places, 36467/36871 transitions.
Support contains 5668 out of 33367 places after structural reductions.
[2022-05-16 18:27:49] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-16 18:27:49] [INFO ] Flatten gal took : 1218 ms
[2022-05-16 18:27:49] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-16 18:27:50] [INFO ] Flatten gal took : 972 ms
[2022-05-16 18:27:52] [INFO ] Input system was already deterministic with 36467 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1010 ms. (steps per millisecond=9 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) 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 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 36467 rows 33367 cols
[2022-05-16 18:27:56] [INFO ] Computed 1925 place invariants in 1456 ms
[2022-05-16 18:28:04] [INFO ] After 8141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-16 18:28:14] [INFO ] [Nat]Absence check using 0 positive and 1925 generalized place invariants in 2569 ms returned sat
[2022-05-16 18:28:29] [INFO ] After 10805ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-16 18:28:29] [INFO ] After 10858ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-16 18:28:29] [INFO ] After 25090ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2332 out of 33367 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 33367/33367 places, 36467/36467 transitions.
Graph (complete) has 47776 edges and 33367 vertex of which 32653 are kept as prefixes of interest. Removing 714 places using SCC suffix rule.69 ms
Discarding 714 places :
Also discarding 713 output transitions
Drop transitions removed 713 transitions
Drop transitions removed 14942 transitions
Trivial Post-agglo rules discarded 14942 transitions
Performed 14942 trivial Post agglomeration. Transition count delta: 14942
Iterating post reduction 0 with 14942 rules applied. Total rules applied 14943 place count 32653 transition count 20812
Reduce places removed 14942 places and 0 transitions.
Performed 1113 Post agglomeration using F-continuation condition.Transition count delta: 1113
Iterating post reduction 1 with 16055 rules applied. Total rules applied 30998 place count 17711 transition count 19699
Reduce places removed 1113 places and 0 transitions.
Iterating post reduction 2 with 1113 rules applied. Total rules applied 32111 place count 16598 transition count 19699
Performed 1919 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1919 Pre rules applied. Total rules applied 32111 place count 16598 transition count 17780
Deduced a syphon composed of 1919 places in 11 ms
Ensure Unique test removed 909 places
Reduce places removed 2828 places and 0 transitions.
Iterating global reduction 3 with 4747 rules applied. Total rules applied 36858 place count 13770 transition count 17780
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 604 transitions
Trivial Post-agglo rules discarded 604 transitions
Performed 604 trivial Post agglomeration. Transition count delta: 604
Iterating post reduction 3 with 605 rules applied. Total rules applied 37463 place count 13769 transition count 17176
Reduce places removed 604 places and 0 transitions.
Iterating post reduction 4 with 604 rules applied. Total rules applied 38067 place count 13165 transition count 17176
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 38067 place count 13165 transition count 17175
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 38069 place count 13164 transition count 17175
Discarding 4140 places :
Symmetric choice reduction at 5 with 4140 rule applications. Total rules 42209 place count 9024 transition count 12835
Iterating global reduction 5 with 4140 rules applied. Total rules applied 46349 place count 9024 transition count 12835
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 302 transitions
Trivial Post-agglo rules discarded 302 transitions
Performed 302 trivial Post agglomeration. Transition count delta: 302
Iterating post reduction 5 with 908 rules applied. Total rules applied 47257 place count 8923 transition count 12028
Reduce places removed 302 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 6 with 403 rules applied. Total rules applied 47660 place count 8621 transition count 11927
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 7 with 101 rules applied. Total rules applied 47761 place count 8520 transition count 11927
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 203 Pre rules applied. Total rules applied 47761 place count 8520 transition count 11724
Deduced a syphon composed of 203 places in 7 ms
Ensure Unique test removed 101 places
Reduce places removed 304 places and 0 transitions.
Iterating global reduction 8 with 507 rules applied. Total rules applied 48268 place count 8216 transition count 11724
Discarding 509 places :
Symmetric choice reduction at 8 with 509 rule applications. Total rules 48777 place count 7707 transition count 10815
Iterating global reduction 8 with 509 rules applied. Total rules applied 49286 place count 7707 transition count 10815
Ensure Unique test removed 403 transitions
Reduce isomorphic transitions removed 403 transitions.
Iterating post reduction 8 with 403 rules applied. Total rules applied 49689 place count 7707 transition count 10412
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 101 Pre rules applied. Total rules applied 49689 place count 7707 transition count 10311
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 9 with 202 rules applied. Total rules applied 49891 place count 7606 transition count 10311
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 49896 place count 7601 transition count 9806
Iterating global reduction 9 with 5 rules applied. Total rules applied 49901 place count 7601 transition count 9806
Performed 504 Post agglomeration using F-continuation condition.Transition count delta: 504
Deduced a syphon composed of 504 places in 4 ms
Reduce places removed 504 places and 0 transitions.
Iterating global reduction 9 with 1008 rules applied. Total rules applied 50909 place count 7097 transition count 9302
Free-agglomeration rule applied 5 times.
Iterating global reduction 9 with 5 rules applied. Total rules applied 50914 place count 7097 transition count 9297
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 50919 place count 7092 transition count 9297
Free-agglomeration rule (complex) applied 1213 times.
Iterating global reduction 10 with 1213 rules applied. Total rules applied 52132 place count 7092 transition count 8084
Ensure Unique test removed 101 places
Reduce places removed 1314 places and 0 transitions.
Iterating post reduction 10 with 1314 rules applied. Total rules applied 53446 place count 5778 transition count 8084
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 53448 place count 5778 transition count 8084
Applied a total of 53448 rules in 8370 ms. Remains 5778 /33367 variables (removed 27589) and now considering 8084/36467 (removed 28383) transitions.
Finished structural reductions, in 1 iterations. Remains : 5778/33367 places, 8084/36467 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 459 ms. (steps per millisecond=21 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 8084 rows 5778 cols
[2022-05-16 18:28:38] [INFO ] Computed 611 place invariants in 244 ms
[2022-05-16 18:28:39] [INFO ] After 591ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 18:28:40] [INFO ] [Nat]Absence check using 0 positive and 611 generalized place invariants in 195 ms returned sat
[2022-05-16 18:28:44] [INFO ] After 4129ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-16 18:28:44] [INFO ] After 4576ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 302 ms.
[2022-05-16 18:28:45] [INFO ] After 5849ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 926 steps, including 0 resets, run visited all 1 properties in 24 ms. (steps per millisecond=38 )
Parikh walk visited 1 properties in 35 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 33367 stabilizing places and 36467 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33367 transition count 36467
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' '!(G(F(p0)))'
Support contains 1212 out of 33367 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33367/33367 places, 36467/36467 transitions.
Graph (complete) has 47776 edges and 33367 vertex of which 21525 are kept as prefixes of interest. Removing 11842 places using SCC suffix rule.49 ms
Discarding 11842 places :
Also discarding 12833 output transitions
Drop transitions removed 12833 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 13029 transitions
Trivial Post-agglo rules discarded 13029 transitions
Performed 13029 trivial Post agglomeration. Transition count delta: 13029
Iterating post reduction 0 with 13030 rules applied. Total rules applied 13031 place count 21423 transition count 10504
Reduce places removed 13029 places and 0 transitions.
Performed 1111 Post agglomeration using F-continuation condition.Transition count delta: 1111
Iterating post reduction 1 with 14140 rules applied. Total rules applied 27171 place count 8394 transition count 9393
Reduce places removed 1111 places and 0 transitions.
Iterating post reduction 2 with 1111 rules applied. Total rules applied 28282 place count 7283 transition count 9393
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 28282 place count 7283 transition count 9292
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 28484 place count 7182 transition count 9292
Discarding 2525 places :
Symmetric choice reduction at 3 with 2525 rule applications. Total rules 31009 place count 4657 transition count 6767
Iterating global reduction 3 with 2525 rules applied. Total rules applied 33534 place count 4657 transition count 6767
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 3 with 1010 rules applied. Total rules applied 34544 place count 4455 transition count 5959
Reduce places removed 303 places and 0 transitions.
Iterating post reduction 4 with 303 rules applied. Total rules applied 34847 place count 4152 transition count 5959
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 101 Pre rules applied. Total rules applied 34847 place count 4152 transition count 5858
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 35049 place count 4051 transition count 5858
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 35059 place count 4041 transition count 4848
Iterating global reduction 5 with 10 rules applied. Total rules applied 35069 place count 4041 transition count 4848
Discarding 101 places :
Implicit places reduction removed 101 places
Iterating post reduction 5 with 101 rules applied. Total rules applied 35170 place count 3940 transition count 4848
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 101 Pre rules applied. Total rules applied 35170 place count 3940 transition count 4747
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 6 with 202 rules applied. Total rules applied 35372 place count 3839 transition count 4747
Applied a total of 35372 rules in 1947 ms. Remains 3839 /33367 variables (removed 29528) and now considering 4747/36467 (removed 31720) transitions.
// Phase 1: matrix 4747 rows 3839 cols
[2022-05-16 18:28:47] [INFO ] Computed 102 place invariants in 96 ms
[2022-05-16 18:28:48] [INFO ] Implicit Places using invariants in 1129 ms returned [115, 149, 157, 174, 191]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1138 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3834/33367 places, 4747/36467 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 3834 transition count 4692
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 3779 transition count 4692
Applied a total of 110 rules in 218 ms. Remains 3779 /3834 variables (removed 55) and now considering 4692/4747 (removed 55) transitions.
// Phase 1: matrix 4692 rows 3779 cols
[2022-05-16 18:28:49] [INFO ] Computed 97 place invariants in 141 ms
[2022-05-16 18:28:50] [INFO ] Implicit Places using invariants in 1140 ms returned [104, 127, 144, 156, 194]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1144 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3774/33367 places, 4692/36467 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 3774 transition count 4637
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 3719 transition count 4637
Applied a total of 110 rules in 184 ms. Remains 3719 /3774 variables (removed 55) and now considering 4637/4692 (removed 55) transitions.
// Phase 1: matrix 4637 rows 3719 cols
[2022-05-16 18:28:50] [INFO ] Computed 92 place invariants in 62 ms
[2022-05-16 18:28:51] [INFO ] Implicit Places using invariants in 1017 ms returned [114, 137, 143, 153, 176]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1020 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 3714/33367 places, 4637/36467 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 3714 transition count 4582
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 3659 transition count 4582
Applied a total of 110 rules in 173 ms. Remains 3659 /3714 variables (removed 55) and now considering 4582/4637 (removed 55) transitions.
// Phase 1: matrix 4582 rows 3659 cols
[2022-05-16 18:28:51] [INFO ] Computed 87 place invariants in 58 ms
[2022-05-16 18:28:52] [INFO ] Implicit Places using invariants in 1279 ms returned [101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 3456]
Discarding 87 places :
Implicit Place search using SMT only with invariants took 1285 ms to find 87 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 3572/33367 places, 4582/36467 transitions.
Drop transitions removed 946 transitions
Trivial Post-agglo rules discarded 946 transitions
Performed 946 trivial Post agglomeration. Transition count delta: 946
Iterating post reduction 0 with 946 rules applied. Total rules applied 946 place count 3572 transition count 3636
Reduce places removed 946 places and 0 transitions.
Iterating post reduction 1 with 946 rules applied. Total rules applied 1892 place count 2626 transition count 3636
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 1892 place count 2626 transition count 3535
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 2094 place count 2525 transition count 3535
Applied a total of 2094 rules in 99 ms. Remains 2525 /3572 variables (removed 1047) and now considering 3535/4582 (removed 1047) transitions.
// Phase 1: matrix 3535 rows 2525 cols
[2022-05-16 18:28:52] [INFO ] Computed 0 place invariants in 7 ms
[2022-05-16 18:28:53] [INFO ] Implicit Places using invariants in 203 ms returned []
// Phase 1: matrix 3535 rows 2525 cols
[2022-05-16 18:28:53] [INFO ] Computed 0 place invariants in 6 ms
[2022-05-16 18:28:53] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 5 : 2525/33367 places, 3535/36467 transitions.
Finished structural reductions, in 5 iterations. Remains : 2525/33367 places, 3535/36467 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s2424 s2425 s2426 s2427 s2428 s2429 s2430 s2431 s2432 s2433 s2434 s2435 s2436 s2437 s2438 s2439 s2440 s2441 s2442 s2443 s2444 s2445 s2446 s244...], 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 301 reset in 4065 ms.
Product exploration explored 100000 steps with 304 reset in 3945 ms.
Computed a total of 2525 stabilizing places and 3535 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2525 transition count 3535
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 179 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 84 ms :[(NOT p0), (NOT p0)]
Finished random walk after 352 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=25 )
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 501 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 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 3535 rows 2525 cols
[2022-05-16 18:29:34] [INFO ] Computed 0 place invariants in 16 ms
[2022-05-16 18:29:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:29:49] [INFO ] [Real]Absence check using state equation in 3317 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1212 out of 2525 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2525/2525 places, 3535/3535 transitions.
Applied a total of 0 rules in 55 ms. Remains 2525 /2525 variables (removed 0) and now considering 3535/3535 (removed 0) transitions.
// Phase 1: matrix 3535 rows 2525 cols
[2022-05-16 18:29:50] [INFO ] Computed 0 place invariants in 13 ms
[2022-05-16 18:29:50] [INFO ] Implicit Places using invariants in 204 ms returned []
// Phase 1: matrix 3535 rows 2525 cols
[2022-05-16 18:29:50] [INFO ] Computed 0 place invariants in 5 ms
[2022-05-16 18:29:50] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
[2022-05-16 18:29:51] [INFO ] Redundant transitions in 283 ms returned []
// Phase 1: matrix 3535 rows 2525 cols
[2022-05-16 18:29:51] [INFO ] Computed 0 place invariants in 11 ms
[2022-05-16 18:29:52] [INFO ] Dead Transitions using invariants and state equation in 1341 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2525/2525 places, 3535/3535 transitions.
Computed a total of 2525 stabilizing places and 3535 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2525 transition count 3535
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 139 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 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 380 steps, including 0 resets, run visited all 1 properties in 21 ms. (steps per millisecond=18 )
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 141 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)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 3535 rows 2525 cols
[2022-05-16 18:30:24] [INFO ] Computed 0 place invariants in 12 ms
[2022-05-16 18:30:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:30:39] [INFO ] [Real]Absence check using state equation in 3210 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 302 reset in 3838 ms.
Product exploration explored 100000 steps with 302 reset in 3898 ms.
Built C files in :
/tmp/ltsmin4270199638870637062
[2022-05-16 18:30:47] [INFO ] Too many transitions (3535) to apply POR reductions. Disabling POR matrices.
[2022-05-16 18:30:47] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4270199638870637062
Running compilation step : cd /tmp/ltsmin4270199638870637062;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4270199638870637062;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4270199638870637062;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1212 out of 2525 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2525/2525 places, 3535/3535 transitions.
Applied a total of 0 rules in 52 ms. Remains 2525 /2525 variables (removed 0) and now considering 3535/3535 (removed 0) transitions.
// Phase 1: matrix 3535 rows 2525 cols
[2022-05-16 18:30:50] [INFO ] Computed 0 place invariants in 8 ms
[2022-05-16 18:30:51] [INFO ] Implicit Places using invariants in 192 ms returned []
// Phase 1: matrix 3535 rows 2525 cols
[2022-05-16 18:30:51] [INFO ] Computed 0 place invariants in 6 ms
[2022-05-16 18:30:51] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
[2022-05-16 18:30:51] [INFO ] Redundant transitions in 92 ms returned []
// Phase 1: matrix 3535 rows 2525 cols
[2022-05-16 18:30:51] [INFO ] Computed 0 place invariants in 12 ms
[2022-05-16 18:30:53] [INFO ] Dead Transitions using invariants and state equation in 1344 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2525/2525 places, 3535/3535 transitions.
Built C files in :
/tmp/ltsmin625770587715165804
[2022-05-16 18:30:53] [INFO ] Too many transitions (3535) to apply POR reductions. Disabling POR matrices.
[2022-05-16 18:30:53] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin625770587715165804
Running compilation step : cd /tmp/ltsmin625770587715165804;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin625770587715165804;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin625770587715165804;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 18:30:57] [INFO ] Flatten gal took : 61 ms
[2022-05-16 18:30:57] [INFO ] Flatten gal took : 60 ms
[2022-05-16 18:30:57] [INFO ] Time to serialize gal into /tmp/LTL1256661360788226222.gal : 25 ms
[2022-05-16 18:30:57] [INFO ] Time to serialize properties into /tmp/LTL444068088670882098.ltl : 14 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/LTL1256661360788226222.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL444068088670882098.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/LTL1256661...265
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((l15_0+l15_1)+(l15_2+l15_3))+((l15_4+l15_5)+(l15_6+l15_7)))+(((l15_8+l15_9)+(l15_10+l15_11))+((l15_12+l15_13)+(l15_14+l...12043
Formula 0 simplified : !GF"((((((((l15_0+l15_1)+(l15_2+l15_3))+((l15_4+l15_5)+(l15_6+l15_7)))+(((l15_8+l15_9)+(l15_10+l15_11))+((l15_12+l15_13)+(l15_14+l15...12037
Detected timeout of ITS tools.
[2022-05-16 18:31:12] [INFO ] Flatten gal took : 55 ms
[2022-05-16 18:31:12] [INFO ] Applying decomposition
[2022-05-16 18:31:12] [INFO ] Flatten gal took : 57 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/graph7483889784132568040.txt' '-o' '/tmp/graph7483889784132568040.bin' '-w' '/tmp/graph7483889784132568040.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7483889784132568040.bin' '-l' '-1' '-v' '-w' '/tmp/graph7483889784132568040.weights' '-q' '0' '-e' '0.001'
[2022-05-16 18:31:14] [INFO ] Decomposing Gal with order
[2022-05-16 18:31:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 18:31:17] [INFO ] Removed a total of 730 redundant transitions.
[2022-05-16 18:31:17] [INFO ] Flatten gal took : 3239 ms
[2022-05-16 18:31:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 803 labels/synchronizations in 137 ms.
[2022-05-16 18:31:17] [INFO ] Time to serialize gal into /tmp/LTL13844141511154139453.gal : 20 ms
[2022-05-16 18:31:17] [INFO ] Time to serialize properties into /tmp/LTL15187097796218779316.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13844141511154139453.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15187097796218779316.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/LTL1384414...268
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((gu132.l15_0+gu132.l15_1)+(gu132.l15_2+gu132.l15_3))+((gu132.l15_4+gu132.l15_5)+(gu132.l15_6+gu132.l15_7)))+(((gu132.l1...19315
Formula 0 simplified : !GF"((((((((gu132.l15_0+gu132.l15_1)+(gu132.l15_2+gu132.l15_3))+((gu132.l15_4+gu132.l15_5)+(gu132.l15_6+gu132.l15_7)))+(((gu132.l15_...19309
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8668051922484126589
[2022-05-16 18:31:33] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8668051922484126589
Running compilation step : cd /tmp/ltsmin8668051922484126589;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8668051922484126589;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8668051922484126589;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-00 finished in 170482 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1111 out of 33367 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33367/33367 places, 36467/36467 transitions.
Graph (complete) has 47776 edges and 33367 vertex of which 19606 are kept as prefixes of interest. Removing 13761 places using SCC suffix rule.29 ms
Discarding 13761 places :
Also discarding 15055 output transitions
Drop transitions removed 15055 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 14544 transitions
Trivial Post-agglo rules discarded 14544 transitions
Performed 14544 trivial Post agglomeration. Transition count delta: 14544
Iterating post reduction 0 with 14545 rules applied. Total rules applied 14546 place count 19504 transition count 6767
Reduce places removed 14544 places and 0 transitions.
Iterating post reduction 1 with 14544 rules applied. Total rules applied 29090 place count 4960 transition count 6767
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 29090 place count 4960 transition count 6666
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 29292 place count 4859 transition count 6666
Discarding 1010 places :
Symmetric choice reduction at 2 with 1010 rule applications. Total rules 30302 place count 3849 transition count 5656
Iterating global reduction 2 with 1010 rules applied. Total rules applied 31312 place count 3849 transition count 5656
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 31514 place count 3748 transition count 5555
Applied a total of 31514 rules in 1299 ms. Remains 3748 /33367 variables (removed 29619) and now considering 5555/36467 (removed 30912) transitions.
// Phase 1: matrix 5555 rows 3748 cols
[2022-05-16 18:31:37] [INFO ] Computed 203 place invariants in 50 ms
[2022-05-16 18:31:38] [INFO ] Implicit Places using invariants in 1156 ms returned [115, 157, 1452, 1455, 1458]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1165 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3743/33367 places, 5555/36467 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 3743 transition count 5533
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 3721 transition count 5533
Applied a total of 44 rules in 180 ms. Remains 3721 /3743 variables (removed 22) and now considering 5533/5555 (removed 22) transitions.
// Phase 1: matrix 5533 rows 3721 cols
[2022-05-16 18:31:38] [INFO ] Computed 198 place invariants in 92 ms
[2022-05-16 18:31:40] [INFO ] Implicit Places using invariants in 2088 ms returned [101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 1401, 1402, 1403, 1404, 1405, 1406, 1407, 1408, 1409, 1410, 1411, 1412, 1413, 1414, 1415, 1416, 1417, 1418, 1419, 1420, 1421, 1422, 1423, 1424, 1425, 1426, 1427, 1428, 1429, 1430, 1431, 1432, 1433, 1434, 1435, 1436, 1437, 1438, 1439, 1440, 1441, 1442, 1443, 1444, 1445, 1446, 1447, 1448, 1449, 1450, 1451, 1452, 1453, 1454, 1455, 1456, 1457, 1458, 1459, 1460, 1461, 1462, 1463, 1464, 1465, 1466, 1467, 1468, 1469, 1470, 1471, 1472, 1473, 1474, 1475, 1476, 1477, 1478, 1479, 1480, 1481, 1482, 1483, 1484, 1485, 1486, 1487, 1488, 1489, 1490, 1491, 1492, 1493, 1494, 1495, 1496, 1497, 1498]
Discarding 197 places :
Implicit Place search using SMT only with invariants took 2098 ms to find 197 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3524/33367 places, 5533/36467 transitions.
Drop transitions removed 1089 transitions
Trivial Post-agglo rules discarded 1089 transitions
Performed 1089 trivial Post agglomeration. Transition count delta: 1089
Iterating post reduction 0 with 1089 rules applied. Total rules applied 1089 place count 3524 transition count 4444
Reduce places removed 1089 places and 0 transitions.
Iterating post reduction 1 with 1089 rules applied. Total rules applied 2178 place count 2435 transition count 4444
Applied a total of 2178 rules in 90 ms. Remains 2435 /3524 variables (removed 1089) and now considering 4444/5533 (removed 1089) transitions.
// Phase 1: matrix 4444 rows 2435 cols
[2022-05-16 18:31:40] [INFO ] Computed 1 place invariants in 44 ms
[2022-05-16 18:31:41] [INFO ] Implicit Places using invariants in 361 ms returned []
// Phase 1: matrix 4444 rows 2435 cols
[2022-05-16 18:31:41] [INFO ] Computed 1 place invariants in 35 ms
[2022-05-16 18:31:42] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 1123 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 2435/33367 places, 4444/36467 transitions.
Finished structural reductions, in 3 iterations. Remains : 2435/33367 places, 4444/36467 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 (ADD s1324 s1325 s1326 s1327 s1328 s1329 s1330 s1331 s1332 s1333 s1334 s1335 s1336 s1337 s1338 s1339 s1340 s1341 s1342 s1343 s1344 s1345 s1346 s1...], 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 250 reset in 5058 ms.
Product exploration explored 100000 steps with 252 reset in 5129 ms.
Computed a total of 2435 stabilizing places and 4444 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2435 transition count 4444
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-01 finished in 46434 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G(p0)))))'
Support contains 202 out of 33367 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33367/33367 places, 36467/36467 transitions.
Graph (complete) has 47776 edges and 33367 vertex of which 28702 are kept as prefixes of interest. Removing 4665 places using SCC suffix rule.32 ms
Discarding 4665 places :
Also discarding 5258 output transitions
Drop transitions removed 5258 transitions
Reduce places removed 101 places and 101 transitions.
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 18281 transitions
Trivial Post-agglo rules discarded 18281 transitions
Performed 18281 trivial Post agglomeration. Transition count delta: 18281
Iterating post reduction 0 with 18787 rules applied. Total rules applied 18788 place count 28600 transition count 12322
Reduce places removed 18281 places and 0 transitions.
Iterating post reduction 1 with 18281 rules applied. Total rules applied 37069 place count 10319 transition count 12322
Performed 1818 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1818 Pre rules applied. Total rules applied 37069 place count 10319 transition count 10504
Deduced a syphon composed of 1818 places in 5 ms
Ensure Unique test removed 909 places
Reduce places removed 2727 places and 0 transitions.
Iterating global reduction 2 with 4545 rules applied. Total rules applied 41614 place count 7592 transition count 10504
Drop transitions removed 606 transitions
Trivial Post-agglo rules discarded 606 transitions
Performed 606 trivial Post agglomeration. Transition count delta: 606
Iterating post reduction 2 with 606 rules applied. Total rules applied 42220 place count 7592 transition count 9898
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 3 with 606 rules applied. Total rules applied 42826 place count 6986 transition count 9898
Discarding 3535 places :
Symmetric choice reduction at 4 with 3535 rule applications. Total rules 46361 place count 3451 transition count 6363
Iterating global reduction 4 with 3535 rules applied. Total rules applied 49896 place count 3451 transition count 6363
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 606 transitions
Trivial Post-agglo rules discarded 606 transitions
Performed 606 trivial Post agglomeration. Transition count delta: 606
Iterating post reduction 4 with 1313 rules applied. Total rules applied 51209 place count 3249 transition count 5252
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 5 with 606 rules applied. Total rules applied 51815 place count 2643 transition count 5252
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 51830 place count 2628 transition count 3737
Iterating global reduction 6 with 15 rules applied. Total rules applied 51845 place count 2628 transition count 3737
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 303 places :
Implicit places reduction removed 303 places
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 6 with 1010 rules applied. Total rules applied 52855 place count 2325 transition count 3030
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 7 with 202 rules applied. Total rules applied 53057 place count 2123 transition count 3030
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 202 Pre rules applied. Total rules applied 53057 place count 2123 transition count 2828
Deduced a syphon composed of 202 places in 1 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 8 with 404 rules applied. Total rules applied 53461 place count 1921 transition count 2828
Discarding 1010 places :
Symmetric choice reduction at 8 with 1010 rule applications. Total rules 54471 place count 911 transition count 1818
Iterating global reduction 8 with 1010 rules applied. Total rules applied 55481 place count 911 transition count 1818
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Iterating post reduction 8 with 1010 rules applied. Total rules applied 56491 place count 911 transition count 808
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 101 Pre rules applied. Total rules applied 56491 place count 911 transition count 707
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 101 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 9 with 303 rules applied. Total rules applied 56794 place count 709 transition count 707
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 9 with 101 rules applied. Total rules applied 56895 place count 608 transition count 606
Applied a total of 56895 rules in 1674 ms. Remains 608 /33367 variables (removed 32759) and now considering 606/36467 (removed 35861) transitions.
// Phase 1: matrix 606 rows 608 cols
[2022-05-16 18:32:24] [INFO ] Computed 2 place invariants in 8 ms
[2022-05-16 18:32:24] [INFO ] Implicit Places using invariants in 192 ms returned [202, 203]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 195 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 606/33367 places, 606/36467 transitions.
Reduce places removed 101 places and 101 transitions.
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 101 Pre rules applied. Total rules applied 0 place count 505 transition count 404
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 0 with 202 rules applied. Total rules applied 202 place count 404 transition count 404
Applied a total of 202 rules in 13 ms. Remains 404 /606 variables (removed 202) and now considering 404/606 (removed 202) transitions.
// Phase 1: matrix 404 rows 404 cols
[2022-05-16 18:32:24] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 18:32:24] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 404 rows 404 cols
[2022-05-16 18:32:24] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 18:32:24] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 404/33367 places, 404/36467 transitions.
Finished structural reductions, in 2 iterations. Remains : 404/33367 places, 404/36467 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s228 s229 s2...], 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 404 steps with 0 reset in 13 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-04 finished in 2157 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!G(X((X(p0) U G(p1)))) U !(p2 U p3)))'
Support contains 1717 out of 33367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33367/33367 places, 36467/36467 transitions.
Reduce places removed 1 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 33365 transition count 36467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 33363 transition count 36265
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 33363 transition count 36265
Applied a total of 6 rules in 375 ms. Remains 33363 /33367 variables (removed 4) and now considering 36265/36467 (removed 202) transitions.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:32:26] [INFO ] Computed 1924 place invariants in 1391 ms
[2022-05-16 18:32:29] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:32:29] [INFO ] Implicit Places using invariants in 4047 ms returned []
Implicit Place search using SMT only with invariants took 4048 ms to find 0 implicit places.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:32:30] [INFO ] Computed 1924 place invariants in 1361 ms
[2022-05-16 18:32:33] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:32:33] [INFO ] Dead Transitions using invariants and state equation in 3960 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33363/33367 places, 36265/36467 transitions.
Finished structural reductions, in 1 iterations. Remains : 33363/33367 places, 36265/36467 transitions.
Stuttering acceptance computed with spot in 227 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 0}, { cond=p3, acceptance={0} source=0 dest: 0}, { cond=p3, acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND p3 p1), acceptance={} source=2 dest: 3}, { cond=p3, acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(GT (ADD s21130 s21131 s21132 s21133 s21134 s21135 s21136 s21137 s21138 s21139 s21140 s21141 s21142 s21143 s21144 s21145 s21146 s21147 s21148 s21149 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 43 reset in 3897 ms.
Product exploration explored 100000 steps with 43 reset in 3924 ms.
Computed a total of 33363 stabilizing places and 36265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33363 transition count 36265
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) p3 (NOT p1) p0), (X p3), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p3 p1))), (X (NOT p1)), (X (X p3)), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p3 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 984 ms. Reduced automaton from 5 states, 11 edges and 4 AP to 5 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 194 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 773 ms. (steps per millisecond=12 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:33:27] [INFO ] Computed 1924 place invariants in 1383 ms
[2022-05-16 18:33:34] [INFO ] After 6689ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-16 18:33:43] [INFO ] [Nat]Absence check using 0 positive and 1924 generalized place invariants in 2492 ms returned sat
[2022-05-16 18:33:59] [INFO ] After 13702ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 18:33:59] [INFO ] After 13722ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-16 18:33:59] [INFO ] After 25054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1717 out of 33363 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 33363/33363 places, 36265/36265 transitions.
Graph (complete) has 47470 edges and 33363 vertex of which 31740 are kept as prefixes of interest. Removing 1623 places using SCC suffix rule.14 ms
Discarding 1623 places :
Also discarding 1521 output transitions
Drop transitions removed 1521 transitions
Drop transitions removed 16564 transitions
Trivial Post-agglo rules discarded 16564 transitions
Performed 16564 trivial Post agglomeration. Transition count delta: 16564
Iterating post reduction 0 with 16564 rules applied. Total rules applied 16565 place count 31740 transition count 18180
Reduce places removed 16564 places and 0 transitions.
Performed 1111 Post agglomeration using F-continuation condition.Transition count delta: 1111
Iterating post reduction 1 with 17675 rules applied. Total rules applied 34240 place count 15176 transition count 17069
Reduce places removed 1111 places and 0 transitions.
Iterating post reduction 2 with 1111 rules applied. Total rules applied 35351 place count 14065 transition count 17069
Performed 2525 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2525 Pre rules applied. Total rules applied 35351 place count 14065 transition count 14544
Deduced a syphon composed of 2525 places in 8 ms
Ensure Unique test removed 909 places
Reduce places removed 3434 places and 0 transitions.
Iterating global reduction 3 with 5959 rules applied. Total rules applied 41310 place count 10631 transition count 14544
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 3 with 101 rules applied. Total rules applied 41411 place count 10631 transition count 14443
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 4 with 101 rules applied. Total rules applied 41512 place count 10530 transition count 14443
Discarding 3537 places :
Symmetric choice reduction at 5 with 3537 rule applications. Total rules 45049 place count 6993 transition count 10706
Iterating global reduction 5 with 3537 rules applied. Total rules applied 48586 place count 6993 transition count 10706
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 5 with 707 rules applied. Total rules applied 49293 place count 6892 transition count 10100
Reduce places removed 101 places and 0 transitions.
Performed 202 Post agglomeration using F-continuation condition.Transition count delta: 202
Iterating post reduction 6 with 303 rules applied. Total rules applied 49596 place count 6791 transition count 9898
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 7 with 202 rules applied. Total rules applied 49798 place count 6589 transition count 9898
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 101 Pre rules applied. Total rules applied 49798 place count 6589 transition count 9797
Deduced a syphon composed of 101 places in 5 ms
Ensure Unique test removed 101 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 8 with 303 rules applied. Total rules applied 50101 place count 6387 transition count 9797
Discarding 520 places :
Symmetric choice reduction at 8 with 520 rule applications. Total rules 50621 place count 5867 transition count 7777
Iterating global reduction 8 with 520 rules applied. Total rules applied 51141 place count 5867 transition count 7777
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 8 with 202 rules applied. Total rules applied 51343 place count 5766 transition count 7676
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 9 with 101 rules applied. Total rules applied 51444 place count 5665 transition count 7676
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 202 Pre rules applied. Total rules applied 51444 place count 5665 transition count 7474
Deduced a syphon composed of 202 places in 3 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 10 with 404 rules applied. Total rules applied 51848 place count 5463 transition count 7474
Discarding 1015 places :
Symmetric choice reduction at 10 with 1015 rule applications. Total rules 52863 place count 4448 transition count 5959
Iterating global reduction 10 with 1015 rules applied. Total rules applied 53878 place count 4448 transition count 5959
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 10 with 1313 rules applied. Total rules applied 55191 place count 4246 transition count 4848
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 11 with 101 rules applied. Total rules applied 55292 place count 4145 transition count 4848
Performed 202 Post agglomeration using F-continuation condition.Transition count delta: 202
Deduced a syphon composed of 202 places in 1 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 12 with 404 rules applied. Total rules applied 55696 place count 3943 transition count 4646
Free-agglomeration rule (complex) applied 202 times.
Iterating global reduction 12 with 202 rules applied. Total rules applied 55898 place count 3943 transition count 4444
Ensure Unique test removed 101 places
Reduce places removed 303 places and 0 transitions.
Iterating post reduction 12 with 303 rules applied. Total rules applied 56201 place count 3640 transition count 4444
Applied a total of 56201 rules in 4058 ms. Remains 3640 /33363 variables (removed 29723) and now considering 4444/36265 (removed 31821) transitions.
Finished structural reductions, in 1 iterations. Remains : 3640/33363 places, 4444/36265 transitions.
Finished random walk after 799 steps, including 0 resets, run visited all 5 properties in 55 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p2) p3 (NOT p1) p0), (X p3), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p3 p1))), (X (NOT p1)), (X (X p3)), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p3 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND p3 p1)), (F (NOT p0)), (F (AND p2 (NOT p3))), (F p1), (F (NOT p3))]
Knowledge based reduction with 16 factoid took 1125 ms. Reduced automaton from 5 states, 11 edges and 4 AP to 5 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 196 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
Stuttering acceptance computed with spot in 184 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:34:06] [INFO ] Computed 1924 place invariants in 1500 ms
Could not prove EG p3
Support contains 1717 out of 33363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33363/33363 places, 36265/36265 transitions.
Applied a total of 0 rules in 165 ms. Remains 33363 /33363 variables (removed 0) and now considering 36265/36265 (removed 0) transitions.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:34:23] [INFO ] Computed 1924 place invariants in 1357 ms
[2022-05-16 18:34:25] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:34:25] [INFO ] Implicit Places using invariants in 3934 ms returned []
Implicit Place search using SMT only with invariants took 3935 ms to find 0 implicit places.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:34:27] [INFO ] Computed 1924 place invariants in 1389 ms
[2022-05-16 18:34:29] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:34:29] [INFO ] Dead Transitions using invariants and state equation in 4017 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 33363/33363 places, 36265/36265 transitions.
Computed a total of 33363 stabilizing places and 36265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33363 transition count 36265
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) p3 (NOT p1) p0), (X p3), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p3 p1))), (X (NOT p1)), (X (X p3)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p3 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1148 ms. Reduced automaton from 5 states, 11 edges and 4 AP to 5 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 208 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 762 ms. (steps per millisecond=13 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:35:19] [INFO ] Computed 1924 place invariants in 1386 ms
[2022-05-16 18:35:25] [INFO ] After 6541ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-16 18:35:34] [INFO ] [Nat]Absence check using 0 positive and 1924 generalized place invariants in 2433 ms returned sat
[2022-05-16 18:35:50] [INFO ] After 13791ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 18:35:50] [INFO ] After 13808ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-16 18:35:50] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1717 out of 33363 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 33363/33363 places, 36265/36265 transitions.
Graph (complete) has 47470 edges and 33363 vertex of which 31740 are kept as prefixes of interest. Removing 1623 places using SCC suffix rule.15 ms
Discarding 1623 places :
Also discarding 1521 output transitions
Drop transitions removed 1521 transitions
Drop transitions removed 16564 transitions
Trivial Post-agglo rules discarded 16564 transitions
Performed 16564 trivial Post agglomeration. Transition count delta: 16564
Iterating post reduction 0 with 16564 rules applied. Total rules applied 16565 place count 31740 transition count 18180
Reduce places removed 16564 places and 0 transitions.
Performed 1111 Post agglomeration using F-continuation condition.Transition count delta: 1111
Iterating post reduction 1 with 17675 rules applied. Total rules applied 34240 place count 15176 transition count 17069
Reduce places removed 1111 places and 0 transitions.
Iterating post reduction 2 with 1111 rules applied. Total rules applied 35351 place count 14065 transition count 17069
Performed 2525 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2525 Pre rules applied. Total rules applied 35351 place count 14065 transition count 14544
Deduced a syphon composed of 2525 places in 9 ms
Ensure Unique test removed 909 places
Reduce places removed 3434 places and 0 transitions.
Iterating global reduction 3 with 5959 rules applied. Total rules applied 41310 place count 10631 transition count 14544
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 3 with 101 rules applied. Total rules applied 41411 place count 10631 transition count 14443
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 4 with 101 rules applied. Total rules applied 41512 place count 10530 transition count 14443
Discarding 3537 places :
Symmetric choice reduction at 5 with 3537 rule applications. Total rules 45049 place count 6993 transition count 10706
Iterating global reduction 5 with 3537 rules applied. Total rules applied 48586 place count 6993 transition count 10706
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 5 with 707 rules applied. Total rules applied 49293 place count 6892 transition count 10100
Reduce places removed 101 places and 0 transitions.
Performed 202 Post agglomeration using F-continuation condition.Transition count delta: 202
Iterating post reduction 6 with 303 rules applied. Total rules applied 49596 place count 6791 transition count 9898
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 7 with 202 rules applied. Total rules applied 49798 place count 6589 transition count 9898
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 101 Pre rules applied. Total rules applied 49798 place count 6589 transition count 9797
Deduced a syphon composed of 101 places in 5 ms
Ensure Unique test removed 101 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 8 with 303 rules applied. Total rules applied 50101 place count 6387 transition count 9797
Discarding 520 places :
Symmetric choice reduction at 8 with 520 rule applications. Total rules 50621 place count 5867 transition count 7777
Iterating global reduction 8 with 520 rules applied. Total rules applied 51141 place count 5867 transition count 7777
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 8 with 202 rules applied. Total rules applied 51343 place count 5766 transition count 7676
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 9 with 101 rules applied. Total rules applied 51444 place count 5665 transition count 7676
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 202 Pre rules applied. Total rules applied 51444 place count 5665 transition count 7474
Deduced a syphon composed of 202 places in 3 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 10 with 404 rules applied. Total rules applied 51848 place count 5463 transition count 7474
Discarding 1015 places :
Symmetric choice reduction at 10 with 1015 rule applications. Total rules 52863 place count 4448 transition count 5959
Iterating global reduction 10 with 1015 rules applied. Total rules applied 53878 place count 4448 transition count 5959
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 10 with 1313 rules applied. Total rules applied 55191 place count 4246 transition count 4848
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 11 with 101 rules applied. Total rules applied 55292 place count 4145 transition count 4848
Performed 202 Post agglomeration using F-continuation condition.Transition count delta: 202
Deduced a syphon composed of 202 places in 2 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 12 with 404 rules applied. Total rules applied 55696 place count 3943 transition count 4646
Free-agglomeration rule (complex) applied 202 times.
Iterating global reduction 12 with 202 rules applied. Total rules applied 55898 place count 3943 transition count 4444
Ensure Unique test removed 101 places
Reduce places removed 303 places and 0 transitions.
Iterating post reduction 12 with 303 rules applied. Total rules applied 56201 place count 3640 transition count 4444
Applied a total of 56201 rules in 4017 ms. Remains 3640 /33363 variables (removed 29723) and now considering 4444/36265 (removed 31821) transitions.
Finished structural reductions, in 1 iterations. Remains : 3640/33363 places, 4444/36265 transitions.
Finished random walk after 1029 steps, including 0 resets, run visited all 5 properties in 53 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p2) p3 (NOT p1) p0), (X p3), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p3 p1))), (X (NOT p1)), (X (X p3)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p3 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND p3 p1)), (F (NOT p0)), (F (AND p2 (NOT p3))), (F p1), (F (NOT p3))]
Knowledge based reduction with 16 factoid took 1188 ms. Reduced automaton from 5 states, 11 edges and 4 AP to 5 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 196 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
Stuttering acceptance computed with spot in 195 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:35:58] [INFO ] Computed 1924 place invariants in 1442 ms
Could not prove EG p3
Stuttering acceptance computed with spot in 206 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
Product exploration explored 100000 steps with 43 reset in 4947 ms.
Product exploration explored 100000 steps with 43 reset in 4954 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 204 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
Support contains 1717 out of 33363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33363/33363 places, 36265/36265 transitions.
Graph (complete) has 47470 edges and 33363 vertex of which 31740 are kept as prefixes of interest. Removing 1623 places using SCC suffix rule.33 ms
Discarding 1623 places :
Also discarding 1521 output transitions
Drop transitions removed 1521 transitions
Performed 11009 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11009 rules applied. Total rules applied 11010 place count 31740 transition count 34744
Performed 7171 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7171 Pre rules applied. Total rules applied 11010 place count 31740 transition count 35451
Deduced a syphon composed of 18180 places in 45 ms
Iterating global reduction 1 with 7171 rules applied. Total rules applied 18181 place count 31740 transition count 35451
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18183 place count 31738 transition count 35249
Deduced a syphon composed of 18180 places in 21 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 18185 place count 31738 transition count 35249
Performed 1818 Post agglomeration using F-continuation condition.Transition count delta: -505
Deduced a syphon composed of 19998 places in 17 ms
Iterating global reduction 1 with 1818 rules applied. Total rules applied 20003 place count 31738 transition count 35754
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -2525
Deduced a syphon composed of 20099 places in 17 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 20104 place count 31738 transition count 38279
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -1010
Deduced a syphon composed of 20200 places in 17 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 20205 place count 31738 transition count 39289
Deduced a syphon composed of 20200 places in 16 ms
Applied a total of 20205 rules in 11520 ms. Remains 31738 /33363 variables (removed 1625) and now considering 39289/36265 (removed -3024) transitions.
// Phase 1: matrix 39289 rows 31738 cols
[2022-05-16 18:36:37] [INFO ] Computed 1721 place invariants in 2143 ms
[2022-05-16 18:36:39] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:36:39] [INFO ] Dead Transitions using invariants and state equation in 4594 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31738/33363 places, 39289/36265 transitions.
Finished structural reductions, in 1 iterations. Remains : 31738/33363 places, 39289/36265 transitions.
Product exploration explored 100000 steps with 241 reset in 5510 ms.
Product exploration explored 100000 steps with 240 reset in 5525 ms.
Built C files in :
/tmp/ltsmin17910590101982446163
[2022-05-16 18:36:51] [INFO ] Built C files in 309ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17910590101982446163
Running compilation step : cd /tmp/ltsmin17910590101982446163;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17910590101982446163;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17910590101982446163;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1717 out of 33363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33363/33363 places, 36265/36265 transitions.
Applied a total of 0 rules in 161 ms. Remains 33363 /33363 variables (removed 0) and now considering 36265/36265 (removed 0) transitions.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:36:55] [INFO ] Computed 1924 place invariants in 1424 ms
[2022-05-16 18:36:58] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:36:58] [INFO ] Implicit Places using invariants in 4046 ms returned []
Implicit Place search using SMT only with invariants took 4048 ms to find 0 implicit places.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:36:59] [INFO ] Computed 1924 place invariants in 1339 ms
[2022-05-16 18:37:02] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:37:02] [INFO ] Dead Transitions using invariants and state equation in 3949 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 33363/33363 places, 36265/36265 transitions.
Built C files in :
/tmp/ltsmin7213420543900055883
[2022-05-16 18:37:02] [INFO ] Built C files in 247ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7213420543900055883
Running compilation step : cd /tmp/ltsmin7213420543900055883;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7213420543900055883;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7213420543900055883;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 18:37:07] [INFO ] Flatten gal took : 1003 ms
[2022-05-16 18:37:08] [INFO ] Flatten gal took : 904 ms
[2022-05-16 18:37:08] [INFO ] Time to serialize gal into /tmp/LTL9963376489983787611.gal : 153 ms
[2022-05-16 18:37:08] [INFO ] Time to serialize properties into /tmp/LTL10255829931189498584.ltl : 3 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/LTL9963376489983787611.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10255829931189498584.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/LTL9963376...267
Read 1 LTL properties
Checking formula 0 : !(((!(G(X((X("(((((((((((pl0_0_0+pl0_1_0)+(pl0_2_0+pl0_3_0))+((pl0_4_0+pl0_5_0)+(pl0_6_0+pl0_7_0)))+(((pl0_8_0+pl0_9_0)+(pl0_10_0+pl0_...18681
Formula 0 simplified : !(!GX(X"(((((((((((pl0_0_0+pl0_1_0)+(pl0_2_0+pl0_3_0))+((pl0_4_0+pl0_5_0)+(pl0_6_0+pl0_7_0)))+(((pl0_8_0+pl0_9_0)+(pl0_10_0+pl0_11_0...18667
Detected timeout of ITS tools.
[2022-05-16 18:37:24] [INFO ] Flatten gal took : 890 ms
[2022-05-16 18:37:24] [INFO ] Applying decomposition
[2022-05-16 18:37:25] [INFO ] Flatten gal took : 1039 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/graph13471534367925076443.txt' '-o' '/tmp/graph13471534367925076443.bin' '-w' '/tmp/graph13471534367925076443.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13471534367925076443.bin' '-l' '-1' '-v' '-w' '/tmp/graph13471534367925076443.weights' '-q' '0' '-e' '0.001'
[2022-05-16 18:37:29] [INFO ] Decomposing Gal with order
[2022-05-16 18:37:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 18:44:08] [INFO ] Removed a total of 13016 redundant transitions.
[2022-05-16 18:44:08] [INFO ] Flatten gal took : 5423 ms
[2022-05-16 18:44:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 7107 labels/synchronizations in 2136 ms.
[2022-05-16 18:44:21] [INFO ] Time to serialize gal into /tmp/LTL8024902028492527269.gal : 166 ms
[2022-05-16 18:44:21] [INFO ] Time to serialize properties into /tmp/LTL17360030234842194379.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/LTL8024902028492527269.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17360030234842194379.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/LTL8024902...267
Read 1 LTL properties
Checking formula 0 : !(((!(G(X((X("(((((((((((gu11420.pl0_0_0+gu11420.pl0_1_0)+(gu11420.pl0_2_0+gu11420.pl0_3_0))+((gu11420.pl0_4_0+gu11420.pl0_5_0)+(gu114...33730
Formula 0 simplified : !(!GX(X"(((((((((((gu11420.pl0_0_0+gu11420.pl0_1_0)+(gu11420.pl0_2_0+gu11420.pl0_3_0))+((gu11420.pl0_4_0+gu11420.pl0_5_0)+(gu11420.p...33716
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9015465422687840430
[2022-05-16 18:44:36] [INFO ] Built C files in 200ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9015465422687840430
Running compilation step : cd /tmp/ltsmin9015465422687840430;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9015465422687840430;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9015465422687840430;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-05 finished in 734801 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 3 out of 33367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33367/33367 places, 36467/36467 transitions.
Reduce places removed 1 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 33365 transition count 36467
Applied a total of 2 rules in 270 ms. Remains 33365 /33367 variables (removed 2) and now considering 36467/36467 (removed 0) transitions.
// Phase 1: matrix 36467 rows 33365 cols
[2022-05-16 18:44:41] [INFO ] Computed 1924 place invariants in 2009 ms
[2022-05-16 18:44:44] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:44:44] [INFO ] Implicit Places using invariants in 4366 ms returned []
Implicit Place search using SMT only with invariants took 4367 ms to find 0 implicit places.
// Phase 1: matrix 36467 rows 33365 cols
[2022-05-16 18:44:45] [INFO ] Computed 1924 place invariants in 1668 ms
[2022-05-16 18:44:48] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:44:48] [INFO ] Dead Transitions using invariants and state equation in 4076 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33365/33367 places, 36467/36467 transitions.
Finished structural reductions, in 1 iterations. Remains : 33365/33367 places, 36467/36467 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 2 (ADD s16977 s16978 s16979))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-06 finished in 8938 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1414 out of 33367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33367/33367 places, 36467/36467 transitions.
Reduce places removed 1 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 33365 transition count 36467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 33363 transition count 36265
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 33363 transition count 36265
Applied a total of 6 rules in 531 ms. Remains 33363 /33367 variables (removed 4) and now considering 36265/36467 (removed 202) transitions.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:44:50] [INFO ] Computed 1924 place invariants in 1686 ms
[2022-05-16 18:44:52] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:44:53] [INFO ] Implicit Places using invariants in 4059 ms returned []
Implicit Place search using SMT only with invariants took 4059 ms to find 0 implicit places.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:44:54] [INFO ] Computed 1924 place invariants in 1762 ms
[2022-05-16 18:44:57] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:44:57] [INFO ] Dead Transitions using invariants and state equation in 4140 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33363/33367 places, 36265/36467 transitions.
Finished structural reductions, in 1 iterations. Remains : 33363/33367 places, 36265/36467 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s11015 s11016 s11017 s11018 s11019 s11020 s11021 s11022 s11023 s11024 s11025 s11026 s11027 s11028 s11029 s11030 s11031 s11032 s11033 s11034 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 57100 steps with 28550 reset in 10012 ms.
Product exploration timeout after 54920 steps with 27460 reset in 10001 ms.
Computed a total of 33363 stabilizing places and 36265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33363 transition count 36265
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 65 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-07 finished in 83872 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 33367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33367/33367 places, 36467/36467 transitions.
Reduce places removed 1 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 33365 transition count 36467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 33363 transition count 36265
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 33363 transition count 36265
Applied a total of 6 rules in 653 ms. Remains 33363 /33367 variables (removed 4) and now considering 36265/36467 (removed 202) transitions.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:46:15] [INFO ] Computed 1924 place invariants in 2126 ms
[2022-05-16 18:46:17] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:46:17] [INFO ] Implicit Places using invariants in 4509 ms returned []
Implicit Place search using SMT only with invariants took 4510 ms to find 0 implicit places.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:46:19] [INFO ] Computed 1924 place invariants in 2399 ms
[2022-05-16 18:46:22] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:46:22] [INFO ] Dead Transitions using invariants and state equation in 4774 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33363/33367 places, 36265/36467 transitions.
Finished structural reductions, in 1 iterations. Remains : 33363/33367 places, 36265/36467 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 1 s25393)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-10 finished in 10184 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Support contains 3 out of 33367 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33367/33367 places, 36467/36467 transitions.
Graph (complete) has 47776 edges and 33367 vertex of which 31742 are kept as prefixes of interest. Removing 1625 places using SCC suffix rule.37 ms
Discarding 1625 places :
Also discarding 1723 output transitions
Drop transitions removed 1723 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 19593 transitions
Trivial Post-agglo rules discarded 19593 transitions
Performed 19593 trivial Post agglomeration. Transition count delta: 19593
Iterating post reduction 0 with 19594 rules applied. Total rules applied 19595 place count 31640 transition count 15050
Reduce places removed 19593 places and 0 transitions.
Iterating post reduction 1 with 19593 rules applied. Total rules applied 39188 place count 12047 transition count 15050
Performed 1819 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1819 Pre rules applied. Total rules applied 39188 place count 12047 transition count 13231
Deduced a syphon composed of 1819 places in 10 ms
Ensure Unique test removed 909 places
Reduce places removed 2728 places and 0 transitions.
Iterating global reduction 2 with 4547 rules applied. Total rules applied 43735 place count 9319 transition count 13231
Drop transitions removed 707 transitions
Trivial Post-agglo rules discarded 707 transitions
Performed 707 trivial Post agglomeration. Transition count delta: 707
Iterating post reduction 2 with 707 rules applied. Total rules applied 44442 place count 9319 transition count 12524
Reduce places removed 707 places and 0 transitions.
Iterating post reduction 3 with 707 rules applied. Total rules applied 45149 place count 8612 transition count 12524
Discarding 4646 places :
Symmetric choice reduction at 4 with 4646 rule applications. Total rules 49795 place count 3966 transition count 7678
Iterating global reduction 4 with 4646 rules applied. Total rules applied 54441 place count 3966 transition count 7678
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 807 transitions
Trivial Post-agglo rules discarded 807 transitions
Performed 807 trivial Post agglomeration. Transition count delta: 807
Iterating post reduction 4 with 1514 rules applied. Total rules applied 55955 place count 3764 transition count 6366
Reduce places removed 807 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 808 rules applied. Total rules applied 56763 place count 2957 transition count 6365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 56764 place count 2956 transition count 6365
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 56783 place count 2937 transition count 4446
Iterating global reduction 7 with 19 rules applied. Total rules applied 56802 place count 2937 transition count 4446
Ensure Unique test removed 909 transitions
Reduce isomorphic transitions removed 909 transitions.
Discarding 302 places :
Implicit places reduction removed 302 places
Drop transitions removed 302 transitions
Trivial Post-agglo rules discarded 302 transitions
Performed 302 trivial Post agglomeration. Transition count delta: 302
Iterating post reduction 7 with 1513 rules applied. Total rules applied 58315 place count 2635 transition count 3235
Reduce places removed 302 places and 0 transitions.
Iterating post reduction 8 with 302 rules applied. Total rules applied 58617 place count 2333 transition count 3235
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 201 Pre rules applied. Total rules applied 58617 place count 2333 transition count 3034
Deduced a syphon composed of 201 places in 1 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 9 with 402 rules applied. Total rules applied 59019 place count 2132 transition count 3034
Discarding 1110 places :
Symmetric choice reduction at 9 with 1110 rule applications. Total rules 60129 place count 1022 transition count 1924
Ensure Unique test removed 1 places
Iterating global reduction 9 with 1111 rules applied. Total rules applied 61240 place count 1021 transition count 1924
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Iterating post reduction 9 with 1010 rules applied. Total rules applied 62250 place count 1021 transition count 914
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 102 Pre rules applied. Total rules applied 62250 place count 1021 transition count 812
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 101 places
Reduce places removed 203 places and 0 transitions.
Iterating global reduction 10 with 305 rules applied. Total rules applied 62555 place count 818 transition count 812
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 101 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 10 with 303 rules applied. Total rules applied 62858 place count 616 transition count 711
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 10 with 202 rules applied. Total rules applied 63060 place count 515 transition count 610
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 63062 place count 514 transition count 709
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 10 with 101 rules applied. Total rules applied 63163 place count 413 transition count 608
Applied a total of 63163 rules in 2431 ms. Remains 413 /33367 variables (removed 32954) and now considering 608/36467 (removed 35859) transitions.
// Phase 1: matrix 608 rows 413 cols
[2022-05-16 18:46:24] [INFO ] Computed 105 place invariants in 4 ms
[2022-05-16 18:46:25] [INFO ] Implicit Places using invariants in 323 ms returned [103, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209]
Discarding 102 places :
Implicit Place search using SMT only with invariants took 324 ms to find 102 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 311/33367 places, 608/36467 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 311 transition count 607
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 309 transition count 607
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 103 place count 209 transition count 407
Iterating global reduction 0 with 100 rules applied. Total rules applied 203 place count 209 transition count 407
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 303 place count 109 transition count 207
Iterating global reduction 0 with 100 rules applied. Total rules applied 403 place count 109 transition count 207
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 502 place count 10 transition count 9
Iterating global reduction 0 with 99 rules applied. Total rules applied 601 place count 10 transition count 9
Applied a total of 601 rules in 16 ms. Remains 10 /311 variables (removed 301) and now considering 9/608 (removed 599) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-16 18:46:25] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 18:46:25] [INFO ] Implicit Places using invariants in 28 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/33367 places, 9/36467 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 8
Applied a total of 2 rules in 0 ms. Remains 8 /9 variables (removed 1) and now considering 8/9 (removed 1) transitions.
// Phase 1: matrix 8 rows 8 cols
[2022-05-16 18:46:25] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 18:46:25] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2022-05-16 18:46:25] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 18:46:25] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 8/33367 places, 8/36467 transitions.
Finished structural reductions, in 3 iterations. Remains : 8/33367 places, 8/36467 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(GT 1 s0), p0:(LEQ s6 s4)], 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, null, null][true, true, true]]
Product exploration explored 100000 steps with 11332 reset in 125 ms.
Product exploration explored 100000 steps with 11362 reset in 132 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 8
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 p1) p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 9 factoid took 585 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 53 ms :[(NOT p1), (NOT p1)]
Finished random walk after 106 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=106 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p1)]
Knowledge based reduction with 9 factoid took 522 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
// Phase 1: matrix 8 rows 8 cols
[2022-05-16 18:46:27] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 18:46:27] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-16 18:46:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:46:27] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 18:46:27] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 18:46:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:46:27] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-16 18:46:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:46:27] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-16 18:46:27] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 18:46:27] [INFO ] Added : 3 causal constraints over 2 iterations in 13 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 8 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 8 cols
[2022-05-16 18:46:27] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 18:46:27] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2022-05-16 18:46:27] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 18:46:27] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2022-05-16 18:46:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2022-05-16 18:46:27] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 18:46:27] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 8/8 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 8
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 p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 124 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 27 ms :[(NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 3 factoid took 213 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 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
// Phase 1: matrix 8 rows 8 cols
[2022-05-16 18:46:27] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 18:46:27] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-16 18:46:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:46:27] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-16 18:46:27] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 18:46:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:46:27] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-16 18:46:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:46:27] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-16 18:46:27] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 18:46:27] [INFO ] Added : 3 causal constraints over 2 iterations in 4 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Product exploration explored 100000 steps with 11385 reset in 66 ms.
Product exploration explored 100000 steps with 11384 reset in 83 ms.
Built C files in :
/tmp/ltsmin12726580070751706014
[2022-05-16 18:46:27] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2022-05-16 18:46:27] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 18:46:27] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2022-05-16 18:46:27] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 18:46:27] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2022-05-16 18:46:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 18:46:27] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12726580070751706014
Running compilation step : cd /tmp/ltsmin12726580070751706014;'/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 70 ms.
Running link step : cd /tmp/ltsmin12726580070751706014;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12726580070751706014;'/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/stateBased2627025899047045636.hoa' '--buchi-type=spotba'
LTSmin run took 243 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-12 finished in 5874 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(X((X(X(F(p0)))||p0))))))'
Support contains 2 out of 33367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33367/33367 places, 36467/36467 transitions.
Reduce places removed 1 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 33365 transition count 36467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 33363 transition count 36265
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 33363 transition count 36265
Applied a total of 6 rules in 586 ms. Remains 33363 /33367 variables (removed 4) and now considering 36265/36467 (removed 202) transitions.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:46:30] [INFO ] Computed 1924 place invariants in 1983 ms
[2022-05-16 18:46:33] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:46:33] [INFO ] Implicit Places using invariants in 4377 ms returned []
Implicit Place search using SMT only with invariants took 4378 ms to find 0 implicit places.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:46:35] [INFO ] Computed 1924 place invariants in 2155 ms
[2022-05-16 18:46:37] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:46:37] [INFO ] Dead Transitions using invariants and state equation in 4513 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33363/33367 places, 36265/36467 transitions.
Finished structural reductions, in 1 iterations. Remains : 33363/33367 places, 36265/36467 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT s21246 s29613)], 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 40 reset in 2680 ms.
Product exploration explored 100000 steps with 39 reset in 2676 ms.
Computed a total of 33363 stabilizing places and 36265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33363 transition count 36265
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 (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1790 steps, including 0 resets, run visited all 1 properties in 40 ms. (steps per millisecond=44 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:47:38] [INFO ] Computed 1924 place invariants in 1562 ms
Could not prove EG (NOT p0)
Support contains 2 out of 33363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33363/33363 places, 36265/36265 transitions.
Applied a total of 0 rules in 213 ms. Remains 33363 /33363 variables (removed 0) and now considering 36265/36265 (removed 0) transitions.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:47:55] [INFO ] Computed 1924 place invariants in 2356 ms
[2022-05-16 18:47:57] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:47:57] [INFO ] Implicit Places using invariants in 4730 ms returned []
Implicit Place search using SMT only with invariants took 4730 ms to find 0 implicit places.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:48:00] [INFO ] Computed 1924 place invariants in 2388 ms
[2022-05-16 18:48:02] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:48:02] [INFO ] Dead Transitions using invariants and state equation in 4759 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 33363/33363 places, 36265/36265 transitions.
Computed a total of 33363 stabilizing places and 36265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33363 transition count 36265
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 (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1464 steps, including 0 resets, run visited all 1 properties in 33 ms. (steps per millisecond=44 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:48:55] [INFO ] Computed 1924 place invariants in 2036 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 40 reset in 2297 ms.
Product exploration explored 100000 steps with 42 reset in 2408 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 33363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33363/33363 places, 36265/36265 transitions.
Graph (complete) has 47470 edges and 33363 vertex of which 16267 are kept as prefixes of interest. Removing 17096 places using SCC suffix rule.64 ms
Discarding 17096 places :
Also discarding 18085 output transitions
Drop transitions removed 18085 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 7909 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7913 rules applied. Total rules applied 7914 place count 16267 transition count 18176
Performed 4568 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4568 Pre rules applied. Total rules applied 7914 place count 16267 transition count 18176
Deduced a syphon composed of 12477 places in 12 ms
Iterating global reduction 1 with 4568 rules applied. Total rules applied 12482 place count 16267 transition count 18176
Discarding 98 places :
Symmetric choice reduction at 1 with 98 rule applications. Total rules 12580 place count 16169 transition count 17098
Deduced a syphon composed of 12477 places in 12 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 12678 place count 16169 transition count 17098
Performed 2325 Post agglomeration using F-continuation condition.Transition count delta: -1010
Deduced a syphon composed of 14802 places in 7 ms
Iterating global reduction 1 with 2325 rules applied. Total rules applied 15003 place count 16169 transition count 18108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 14803 places in 7 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15004 place count 16169 transition count 18110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15005 place count 16168 transition count 18108
Deduced a syphon composed of 14802 places in 8 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15006 place count 16168 transition count 18108
Deduced a syphon composed of 14802 places in 7 ms
Applied a total of 15006 rules in 7288 ms. Remains 16168 /33363 variables (removed 17195) and now considering 18108/36265 (removed 18157) transitions.
// Phase 1: matrix 18108 rows 16168 cols
[2022-05-16 18:49:27] [INFO ] Computed 107 place invariants in 4008 ms
[2022-05-16 18:49:28] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:49:28] [INFO ] Dead Transitions using invariants and state equation in 5284 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16168/33363 places, 18108/36265 transitions.
Finished structural reductions, in 1 iterations. Remains : 16168/33363 places, 18108/36265 transitions.
Stuttering criterion allowed to conclude after 1023 steps with 3 reset in 34 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-13 finished in 180121 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(G((X(p0)&&p1)))))'
Support contains 4 out of 33367 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33367/33367 places, 36467/36467 transitions.
Graph (complete) has 47776 edges and 33367 vertex of which 26920 are kept as prefixes of interest. Removing 6447 places using SCC suffix rule.35 ms
Discarding 6447 places :
Also discarding 7144 output transitions
Drop transitions removed 7144 transitions
Reduce places removed 101 places and 101 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 18180 transitions
Trivial Post-agglo rules discarded 18180 transitions
Performed 18180 trivial Post agglomeration. Transition count delta: 18180
Iterating post reduction 0 with 18185 rules applied. Total rules applied 18186 place count 26818 transition count 11038
Reduce places removed 18180 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18181 rules applied. Total rules applied 36367 place count 8638 transition count 11037
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36368 place count 8637 transition count 11037
Performed 1521 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1521 Pre rules applied. Total rules applied 36368 place count 8637 transition count 9516
Deduced a syphon composed of 1521 places in 4 ms
Ensure Unique test removed 611 places
Reduce places removed 2132 places and 0 transitions.
Iterating global reduction 3 with 3653 rules applied. Total rules applied 40021 place count 6505 transition count 9516
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 504 transitions
Trivial Post-agglo rules discarded 504 transitions
Performed 504 trivial Post agglomeration. Transition count delta: 504
Iterating post reduction 3 with 505 rules applied. Total rules applied 40526 place count 6504 transition count 9012
Reduce places removed 504 places and 0 transitions.
Iterating post reduction 4 with 504 rules applied. Total rules applied 41030 place count 6000 transition count 9012
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 41030 place count 6000 transition count 9010
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 41034 place count 5998 transition count 9010
Discarding 3138 places :
Symmetric choice reduction at 5 with 3138 rule applications. Total rules 44172 place count 2860 transition count 5382
Iterating global reduction 5 with 3138 rules applied. Total rules applied 47310 place count 2860 transition count 5382
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 507 transitions
Trivial Post-agglo rules discarded 507 transitions
Performed 507 trivial Post agglomeration. Transition count delta: 507
Iterating post reduction 5 with 1214 rules applied. Total rules applied 48524 place count 2658 transition count 4370
Reduce places removed 507 places and 0 transitions.
Iterating post reduction 6 with 507 rules applied. Total rules applied 49031 place count 2151 transition count 4370
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 49031 place count 2151 transition count 4368
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 49035 place count 2149 transition count 4368
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 49049 place count 2135 transition count 3346
Iterating global reduction 7 with 14 rules applied. Total rules applied 49063 place count 2135 transition count 3346
Ensure Unique test removed 403 transitions
Reduce isomorphic transitions removed 403 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 7 with 605 rules applied. Total rules applied 49668 place count 2034 transition count 2842
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 8 with 101 rules applied. Total rules applied 49769 place count 1933 transition count 2842
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 101 Pre rules applied. Total rules applied 49769 place count 1933 transition count 2741
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 9 with 202 rules applied. Total rules applied 49971 place count 1832 transition count 2741
Discarding 1010 places :
Symmetric choice reduction at 9 with 1010 rule applications. Total rules 50981 place count 822 transition count 1731
Iterating global reduction 9 with 1010 rules applied. Total rules applied 51991 place count 822 transition count 1731
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Iterating post reduction 9 with 1010 rules applied. Total rules applied 53001 place count 822 transition count 721
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 101 Pre rules applied. Total rules applied 53001 place count 822 transition count 620
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 101 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 10 with 303 rules applied. Total rules applied 53304 place count 620 transition count 620
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 10 with 202 rules applied. Total rules applied 53506 place count 519 transition count 519
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 53508 place count 518 transition count 616
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 10 with 101 rules applied. Total rules applied 53609 place count 417 transition count 515
Applied a total of 53609 rules in 1627 ms. Remains 417 /33367 variables (removed 32950) and now considering 515/36467 (removed 35952) transitions.
// Phase 1: matrix 515 rows 417 cols
[2022-05-16 18:49:30] [INFO ] Computed 105 place invariants in 3 ms
[2022-05-16 18:49:30] [INFO ] Implicit Places using invariants in 304 ms returned [103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 411, 412]
Discarding 104 places :
Implicit Place search using SMT only with invariants took 305 ms to find 104 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 313/33367 places, 515/36467 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 313 transition count 513
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 513
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 102 place count 213 transition count 317
Iterating global reduction 0 with 98 rules applied. Total rules applied 200 place count 213 transition count 317
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 298 place count 115 transition count 219
Iterating global reduction 0 with 98 rules applied. Total rules applied 396 place count 115 transition count 219
Discarding 97 places :
Symmetric choice reduction at 0 with 97 rule applications. Total rules 493 place count 18 transition count 25
Iterating global reduction 0 with 97 rules applied. Total rules applied 590 place count 18 transition count 25
Applied a total of 590 rules in 28 ms. Remains 18 /313 variables (removed 295) and now considering 25/515 (removed 490) transitions.
// Phase 1: matrix 25 rows 18 cols
[2022-05-16 18:49:30] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 18:49:30] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 25 rows 18 cols
[2022-05-16 18:49:30] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 18:49:30] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/33367 places, 25/36467 transitions.
Finished structural reductions, in 2 iterations. Remains : 18/33367 places, 25/36467 transitions.
Stuttering acceptance computed with spot in 34 ms :[(OR (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(GT s10 s0), p0:(LEQ s1 s12)], 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 251 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-15 finished in 2130 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!G(X((X(p0) U G(p1)))) U !(p2 U p3)))'
Found a CL insensitive property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-05
Stuttering acceptance computed with spot in 168 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
Support contains 1717 out of 33367 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 33367/33367 places, 36467/36467 transitions.
Graph (complete) has 47776 edges and 33367 vertex of which 31741 are kept as prefixes of interest. Removing 1626 places using SCC suffix rule.74 ms
Discarding 1626 places :
Also discarding 1723 output transitions
Drop transitions removed 1723 transitions
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 16564 transitions
Trivial Post-agglo rules discarded 16564 transitions
Performed 16564 trivial Post agglomeration. Transition count delta: 16564
Iterating post reduction 0 with 16565 rules applied. Total rules applied 16566 place count 31740 transition count 18180
Reduce places removed 16564 places and 0 transitions.
Performed 1111 Post agglomeration using F-continuation condition.Transition count delta: 1111
Iterating post reduction 1 with 17675 rules applied. Total rules applied 34241 place count 15176 transition count 17069
Reduce places removed 1111 places and 0 transitions.
Iterating post reduction 2 with 1111 rules applied. Total rules applied 35352 place count 14065 transition count 17069
Performed 2525 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2525 Pre rules applied. Total rules applied 35352 place count 14065 transition count 14544
Deduced a syphon composed of 2525 places in 10 ms
Ensure Unique test removed 909 places
Reduce places removed 3434 places and 0 transitions.
Iterating global reduction 3 with 5959 rules applied. Total rules applied 41311 place count 10631 transition count 14544
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 3 with 101 rules applied. Total rules applied 41412 place count 10631 transition count 14443
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 4 with 101 rules applied. Total rules applied 41513 place count 10530 transition count 14443
Discarding 3537 places :
Symmetric choice reduction at 5 with 3537 rule applications. Total rules 45050 place count 6993 transition count 10706
Iterating global reduction 5 with 3537 rules applied. Total rules applied 48587 place count 6993 transition count 10706
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 5 with 707 rules applied. Total rules applied 49294 place count 6892 transition count 10100
Reduce places removed 101 places and 0 transitions.
Performed 202 Post agglomeration using F-continuation condition.Transition count delta: 202
Iterating post reduction 6 with 303 rules applied. Total rules applied 49597 place count 6791 transition count 9898
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 7 with 202 rules applied. Total rules applied 49799 place count 6589 transition count 9898
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 101 Pre rules applied. Total rules applied 49799 place count 6589 transition count 9797
Deduced a syphon composed of 101 places in 5 ms
Ensure Unique test removed 101 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 8 with 303 rules applied. Total rules applied 50102 place count 6387 transition count 9797
Discarding 520 places :
Symmetric choice reduction at 8 with 520 rule applications. Total rules 50622 place count 5867 transition count 7777
Iterating global reduction 8 with 520 rules applied. Total rules applied 51142 place count 5867 transition count 7777
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 8 with 202 rules applied. Total rules applied 51344 place count 5766 transition count 7676
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 9 with 101 rules applied. Total rules applied 51445 place count 5665 transition count 7676
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 202 Pre rules applied. Total rules applied 51445 place count 5665 transition count 7474
Deduced a syphon composed of 202 places in 4 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 10 with 404 rules applied. Total rules applied 51849 place count 5463 transition count 7474
Discarding 1015 places :
Symmetric choice reduction at 10 with 1015 rule applications. Total rules 52864 place count 4448 transition count 5959
Iterating global reduction 10 with 1015 rules applied. Total rules applied 53879 place count 4448 transition count 5959
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 10 with 1313 rules applied. Total rules applied 55192 place count 4246 transition count 4848
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 11 with 101 rules applied. Total rules applied 55293 place count 4145 transition count 4848
Performed 202 Post agglomeration using F-continuation condition.Transition count delta: 202
Deduced a syphon composed of 202 places in 1 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 12 with 404 rules applied. Total rules applied 55697 place count 3943 transition count 4646
Applied a total of 55697 rules in 4677 ms. Remains 3943 /33367 variables (removed 29424) and now considering 4646/36467 (removed 31821) transitions.
// Phase 1: matrix 4646 rows 3943 cols
[2022-05-16 18:49:35] [INFO ] Computed 307 place invariants in 68 ms
[2022-05-16 18:49:37] [INFO ] Implicit Places using invariants in 1866 ms returned [202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 1515, 2022, 2528, 2529, 2530, 2531, 2532, 2533, 2534, 2535, 2536, 2537, 2538, 2539, 2540, 2541, 2542, 2543, 2544, 2545, 2546, 2547, 2548, 2549, 2550, 2551, 2552, 2553, 2554, 2555, 2556, 2557, 2558, 2559, 2560, 2561, 2562, 2563, 2564, 2565, 2566, 2567, 2568, 2569, 2570, 2571, 2572, 2573, 2574, 2575, 2576, 2577, 2578, 2579, 2580, 2581, 2582, 2583, 2584, 2585, 2586, 2587, 2588, 2589, 2590, 2591, 2592, 2593, 2594, 2595, 2596, 2597, 2598, 2599, 2600, 2601, 2602, 2603, 2604, 2605, 2606, 2607, 2608, 2609, 2610, 2611, 2612, 2613, 2614, 2615, 2616, 2617, 2618, 2619, 2620, 2621, 2622, 2623, 2624, 2625, 2626, 2627, 2628, 3235]
Discarding 205 places :
Implicit Place search using SMT only with invariants took 1872 ms to find 205 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 3738/33367 places, 4646/36467 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 3738 transition count 4545
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 3637 transition count 4545
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 3637 transition count 4444
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 101 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 2 with 303 rules applied. Total rules applied 505 place count 3435 transition count 4444
Applied a total of 505 rules in 136 ms. Remains 3435 /3738 variables (removed 303) and now considering 4444/4646 (removed 202) transitions.
// Phase 1: matrix 4444 rows 3435 cols
[2022-05-16 18:49:37] [INFO ] Computed 1 place invariants in 15 ms
[2022-05-16 18:49:37] [INFO ] Implicit Places using invariants in 326 ms returned []
// Phase 1: matrix 4444 rows 3435 cols
[2022-05-16 18:49:37] [INFO ] Computed 1 place invariants in 15 ms
[2022-05-16 18:49:38] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 1015 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 3435/33367 places, 4444/36467 transitions.
Finished structural reductions, in 2 iterations. Remains : 3435/33367 places, 4444/36467 transitions.
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 0}, { cond=p3, acceptance={0} source=0 dest: 0}, { cond=p3, acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND p3 p1), acceptance={} source=2 dest: 3}, { cond=p3, acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(GT (ADD s1819 s1820 s1821 s1822 s1823 s1824 s1825 s1826 s1827 s1828 s1829 s1830 s1831 s1832 s1833 s1834 s1835 s1836 s1837 s1838 s1839 s1840 s1841 s184...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 544 reset in 2416 ms.
Product exploration explored 100000 steps with 546 reset in 2472 ms.
Computed a total of 3435 stabilizing places and 4444 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3435 transition count 4444
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) p3 (NOT p1) p0), (X p3), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p3 p1))), (X (NOT p1)), (X (X p3)), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p3 p1)))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p2))), (F (G p3)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 608 ms. Reduced automaton from 5 states, 11 edges and 4 AP to 5 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 153 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
Finished random walk after 1301 steps, including 0 resets, run visited all 6 properties in 58 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p2) p3 (NOT p1) p0), (X p3), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p3 p1))), (X (NOT p1)), (X (X p3)), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p3 p1)))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p2))), (F (G p3)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND p3 p1)), (F (NOT p0)), (F (AND p2 (NOT p3))), (F p1), (F (NOT p3))]
Knowledge based reduction with 16 factoid took 792 ms. Reduced automaton from 5 states, 11 edges and 4 AP to 5 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 172 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
Stuttering acceptance computed with spot in 170 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
// Phase 1: matrix 4444 rows 3435 cols
[2022-05-16 18:49:46] [INFO ] Computed 1 place invariants in 15 ms
[2022-05-16 18:49:54] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 18 ms returned sat
[2022-05-16 18:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:50:01] [INFO ] [Real]Absence check using state equation in 7206 ms returned unknown
Could not prove EG p3
Support contains 1717 out of 3435 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3435/3435 places, 4444/4444 transitions.
Applied a total of 0 rules in 59 ms. Remains 3435 /3435 variables (removed 0) and now considering 4444/4444 (removed 0) transitions.
// Phase 1: matrix 4444 rows 3435 cols
[2022-05-16 18:50:02] [INFO ] Computed 1 place invariants in 15 ms
[2022-05-16 18:50:02] [INFO ] Implicit Places using invariants in 329 ms returned []
// Phase 1: matrix 4444 rows 3435 cols
[2022-05-16 18:50:02] [INFO ] Computed 1 place invariants in 14 ms
[2022-05-16 18:50:03] [INFO ] Implicit Places using invariants and state equation in 663 ms returned []
Implicit Place search using SMT with State Equation took 995 ms to find 0 implicit places.
// Phase 1: matrix 4444 rows 3435 cols
[2022-05-16 18:50:03] [INFO ] Computed 1 place invariants in 14 ms
[2022-05-16 18:50:05] [INFO ] Dead Transitions using invariants and state equation in 2062 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3435/3435 places, 4444/4444 transitions.
Computed a total of 3435 stabilizing places and 4444 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3435 transition count 4444
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) p3 (NOT p1) p0), (X p3), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p3 p1))), (X (NOT p1)), (X (X p3)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p3 p1)))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p2))), (F (G p3)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 623 ms. Reduced automaton from 5 states, 11 edges and 4 AP to 5 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 165 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
Finished random walk after 1308 steps, including 0 resets, run visited all 6 properties in 54 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p2) p3 (NOT p1) p0), (X p3), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p3 p1))), (X (NOT p1)), (X (X p3)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p3 p1)))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p2))), (F (G p3)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND p3 p1)), (F (NOT p0)), (F (AND p2 (NOT p3))), (F p1), (F (NOT p3))]
Knowledge based reduction with 16 factoid took 1065 ms. Reduced automaton from 5 states, 11 edges and 4 AP to 5 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 174 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
Stuttering acceptance computed with spot in 148 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
// Phase 1: matrix 4444 rows 3435 cols
[2022-05-16 18:50:08] [INFO ] Computed 1 place invariants in 23 ms
[2022-05-16 18:50:16] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 18 ms returned sat
[2022-05-16 18:50:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:50:23] [INFO ] [Real]Absence check using state equation in 7321 ms returned unknown
Could not prove EG p3
Stuttering acceptance computed with spot in 164 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
Product exploration explored 100000 steps with 543 reset in 3458 ms.
Product exploration explored 100000 steps with 544 reset in 3518 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 171 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
Support contains 1717 out of 3435 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3435/3435 places, 4444/4444 transitions.
Applied a total of 0 rules in 75 ms. Remains 3435 /3435 variables (removed 0) and now considering 4444/4444 (removed 0) transitions.
[2022-05-16 18:50:31] [INFO ] Redundant transitions in 336 ms returned []
// Phase 1: matrix 4444 rows 3435 cols
[2022-05-16 18:50:31] [INFO ] Computed 1 place invariants in 14 ms
[2022-05-16 18:50:33] [INFO ] Dead Transitions using invariants and state equation in 2056 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3435/3435 places, 4444/4444 transitions.
Product exploration explored 100000 steps with 544 reset in 2650 ms.
Product exploration explored 100000 steps with 544 reset in 2668 ms.
Built C files in :
/tmp/ltsmin3204127869787851007
[2022-05-16 18:50:39] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3204127869787851007
Running compilation step : cd /tmp/ltsmin3204127869787851007;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3204127869787851007;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3204127869787851007;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1717 out of 3435 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3435/3435 places, 4444/4444 transitions.
Applied a total of 0 rules in 110 ms. Remains 3435 /3435 variables (removed 0) and now considering 4444/4444 (removed 0) transitions.
// Phase 1: matrix 4444 rows 3435 cols
[2022-05-16 18:50:42] [INFO ] Computed 1 place invariants in 14 ms
[2022-05-16 18:50:42] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:50:42] [INFO ] Implicit Places using invariants in 569 ms returned []
// Phase 1: matrix 4444 rows 3435 cols
[2022-05-16 18:50:42] [INFO ] Computed 1 place invariants in 15 ms
[2022-05-16 18:50:43] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:50:43] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
// Phase 1: matrix 4444 rows 3435 cols
[2022-05-16 18:50:43] [INFO ] Computed 1 place invariants in 27 ms
[2022-05-16 18:50:43] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:50:46] [INFO ] Dead Transitions using invariants and state equation in 2932 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3435/3435 places, 4444/4444 transitions.
Built C files in :
/tmp/ltsmin12717846408441266416
[2022-05-16 18:50:46] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12717846408441266416
Running compilation step : cd /tmp/ltsmin12717846408441266416;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12717846408441266416;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12717846408441266416;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 18:50:50] [INFO ] Flatten gal took : 100 ms
[2022-05-16 18:50:50] [INFO ] Flatten gal took : 78 ms
[2022-05-16 18:50:50] [INFO ] Time to serialize gal into /tmp/LTL32977415742597468.gal : 9 ms
[2022-05-16 18:50:50] [INFO ] Time to serialize properties into /tmp/LTL10534816833676645134.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/LTL32977415742597468.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10534816833676645134.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/LTL3297741...265
Read 1 LTL properties
Checking formula 0 : !(((!(G(X((X("(((((((((((pl0_0_0+pl0_1_0)+(pl0_2_0+pl0_3_0))+((pl0_4_0+pl0_5_0)+(pl0_6_0+pl0_7_0)))+(((pl0_8_0+pl0_9_0)+(pl0_10_0+pl0_...18681
Formula 0 simplified : !(!GX(X"(((((((((((pl0_0_0+pl0_1_0)+(pl0_2_0+pl0_3_0))+((pl0_4_0+pl0_5_0)+(pl0_6_0+pl0_7_0)))+(((pl0_8_0+pl0_9_0)+(pl0_10_0+pl0_11_0...18667
Detected timeout of ITS tools.
[2022-05-16 18:51:05] [INFO ] Flatten gal took : 157 ms
[2022-05-16 18:51:05] [INFO ] Applying decomposition
[2022-05-16 18:51:05] [INFO ] Flatten gal took : 141 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/graph10131364891742778235.txt' '-o' '/tmp/graph10131364891742778235.bin' '-w' '/tmp/graph10131364891742778235.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10131364891742778235.bin' '-l' '-1' '-v' '-w' '/tmp/graph10131364891742778235.weights' '-q' '0' '-e' '0.001'
[2022-05-16 18:51:07] [INFO ] Decomposing Gal with order
[2022-05-16 18:51:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 18:51:13] [INFO ] Removed a total of 1293 redundant transitions.
[2022-05-16 18:51:13] [INFO ] Flatten gal took : 5832 ms
[2022-05-16 18:51:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 1581 labels/synchronizations in 208 ms.
[2022-05-16 18:51:13] [INFO ] Time to serialize gal into /tmp/LTL176338473508895363.gal : 23 ms
[2022-05-16 18:51:13] [INFO ] Time to serialize properties into /tmp/LTL7200196900376712997.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/LTL176338473508895363.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7200196900376712997.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/LTL1763384...265
Read 1 LTL properties
Checking formula 0 : !(((!(G(X((X("(((((((((((gu14.pl0_0_0+gu14.pl0_1_0)+(gu14.pl0_2_0+gu14.pl0_3_0))+((gu14.pl0_4_0+gu14.pl0_5_0)+(gu14.pl0_6_0+gu14.pl0_7...27367
Formula 0 simplified : !(!GX(X"(((((((((((gu14.pl0_0_0+gu14.pl0_1_0)+(gu14.pl0_2_0+gu14.pl0_3_0))+((gu14.pl0_4_0+gu14.pl0_5_0)+(gu14.pl0_6_0+gu14.pl0_7_0))...27353
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8864865588919689953
[2022-05-16 18:51:29] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8864865588919689953
Running compilation step : cd /tmp/ltsmin8864865588919689953;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8864865588919689953;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8864865588919689953;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-05 finished in 121345 ms.
[2022-05-16 18:51:33] [INFO ] Flatten gal took : 1186 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7805926420824786589
[2022-05-16 18:51:34] [INFO ] Too many transitions (36467) to apply POR reductions. Disabling POR matrices.
[2022-05-16 18:51:35] [INFO ] Built C files in 1063ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7805926420824786589
Running compilation step : cd /tmp/ltsmin7805926420824786589;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 18:51:35] [INFO ] Applying decomposition
[2022-05-16 18:51:37] [INFO ] Flatten gal took : 1830 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/graph15813242164684627394.txt' '-o' '/tmp/graph15813242164684627394.bin' '-w' '/tmp/graph15813242164684627394.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15813242164684627394.bin' '-l' '-1' '-v' '-w' '/tmp/graph15813242164684627394.weights' '-q' '0' '-e' '0.001'
[2022-05-16 18:51:52] [INFO ] Decomposing Gal with order
[2022-05-16 18:52:39] [INFO ] Rewriting arrays to variables to allow decomposition.
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7805926420824786589;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 360 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7805926420824786589;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 360 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 18:59:38] [INFO ] Removed a total of 13535 redundant transitions.
[2022-05-16 18:59:39] [INFO ] Flatten gal took : 8965 ms
[2022-05-16 18:59:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 2733 labels/synchronizations in 545 ms.
[2022-05-16 18:59:42] [INFO ] Time to serialize gal into /tmp/LTLCardinality1758617620938788750.gal : 131 ms
[2022-05-16 18:59:42] [INFO ] Time to serialize properties into /tmp/LTLCardinality2162202165069683453.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/LTLCardinality1758617620938788750.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2162202165069683453.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 2 LTL properties
Checking formula 0 : !((G(F("((((((((gu2667.l15_0+gu2667.l15_1)+(gu2667.l15_2+gu2667.l15_3))+((gu2667.l15_4+gu2667.l15_5)+(gu2667.l15_6+gu2667.l15_7)))+(((...20527
Formula 0 simplified : !GF"((((((((gu2667.l15_0+gu2667.l15_1)+(gu2667.l15_2+gu2667.l15_3))+((gu2667.l15_4+gu2667.l15_5)+(gu2667.l15_6+gu2667.l15_7)))+(((gu...20521
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FamilyReunion-PT-L00100M0010C005P005G002"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is FamilyReunion-PT-L00100M0010C005P005G002, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-165260110800739"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-PT-L00100M0010C005P005G002.tgz
mv FamilyReunion-PT-L00100M0010C005P005G002 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;