About the Execution of 2023-gold for ShieldPPPs-PT-100A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6757.119 | 3600000.00 | 6192095.00 | 11429.10 | ?T???F??FT?F?FTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r373-tall-171683789000323.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldPPPs-PT-100A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789000323
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 13:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 13 13:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 13 13:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 13 13:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 907K May 18 16:43 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 ShieldPPPs-PT-100A-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716980116322
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-100A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 10:55:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 10:55:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 10:55:18] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2024-05-29 10:55:18] [INFO ] Transformed 3103 places.
[2024-05-29 10:55:18] [INFO ] Transformed 2603 transitions.
[2024-05-29 10:55:18] [INFO ] Found NUPN structural information;
[2024-05-29 10:55:18] [INFO ] Parsed PT model containing 3103 places and 2603 transitions and 10006 arcs in 368 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPs-PT-100A-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100A-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 347 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2024-05-29 10:55:19] [INFO ] Computed 1101 invariants in 33 ms
[2024-05-29 10:55:21] [INFO ] Implicit Places using invariants in 2159 ms returned []
[2024-05-29 10:55:21] [INFO ] Invariant cache hit.
[2024-05-29 10:55:23] [INFO ] Implicit Places using invariants and state equation in 1853 ms returned []
Implicit Place search using SMT with State Equation took 4045 ms to find 0 implicit places.
[2024-05-29 10:55:23] [INFO ] Invariant cache hit.
[2024-05-29 10:55:24] [INFO ] Dead Transitions using invariants and state equation in 1719 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6115 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Support contains 61 out of 3103 places after structural reductions.
[2024-05-29 10:55:25] [INFO ] Flatten gal took : 329 ms
[2024-05-29 10:55:25] [INFO ] Flatten gal took : 196 ms
[2024-05-29 10:55:26] [INFO ] Input system was already deterministic with 2603 transitions.
Support contains 60 out of 3103 places (down from 61) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 796 ms. (steps per millisecond=12 ) properties (out of 32) seen :14
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2024-05-29 10:55:27] [INFO ] Invariant cache hit.
[2024-05-29 10:55:28] [INFO ] [Real]Absence check using 1101 positive place invariants in 229 ms returned sat
[2024-05-29 10:55:34] [INFO ] After 7267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-29 10:55:36] [INFO ] [Nat]Absence check using 1101 positive place invariants in 257 ms returned sat
[2024-05-29 10:55:59] [INFO ] After 22600ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-29 10:55:59] [INFO ] After 22606ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-29 10:55:59] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 18 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 751 ms.
Support contains 35 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 17 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 869 times.
Drop transitions removed 869 transitions
Iterating global reduction 0 with 869 rules applied. Total rules applied 873 place count 3101 transition count 2601
Applied a total of 873 rules in 624 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 625 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 466 ms. (steps per millisecond=21 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 65810 steps, run timeout after 3003 ms. (steps per millisecond=21 ) properties seen :{3=1, 5=1, 11=1, 16=1}
Probabilistic random walk after 65810 steps, saw 65040 distinct states, run finished after 3005 ms. (steps per millisecond=21 ) properties seen :4
Running SMT prover for 14 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2024-05-29 10:56:04] [INFO ] Computed 1101 invariants in 127 ms
[2024-05-29 10:56:06] [INFO ] [Real]Absence check using 1041 positive place invariants in 230 ms returned sat
[2024-05-29 10:56:06] [INFO ] [Real]Absence check using 1041 positive and 60 generalized place invariants in 22 ms returned sat
[2024-05-29 10:56:11] [INFO ] After 6174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-29 10:56:12] [INFO ] [Nat]Absence check using 1041 positive place invariants in 221 ms returned sat
[2024-05-29 10:56:12] [INFO ] [Nat]Absence check using 1041 positive and 60 generalized place invariants in 13 ms returned sat
[2024-05-29 10:56:36] [INFO ] After 23120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-29 10:56:36] [INFO ] After 23132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-29 10:56:36] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 26 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 307 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 307 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 163472 steps, run timeout after 6006 ms. (steps per millisecond=27 ) properties seen :{13=1}
Probabilistic random walk after 163472 steps, saw 162121 distinct states, run finished after 6007 ms. (steps per millisecond=27 ) properties seen :1
Running SMT prover for 13 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2024-05-29 10:56:44] [INFO ] Computed 1101 invariants in 25 ms
[2024-05-29 10:56:45] [INFO ] [Real]Absence check using 1040 positive place invariants in 213 ms returned sat
[2024-05-29 10:56:45] [INFO ] [Real]Absence check using 1040 positive and 61 generalized place invariants in 13 ms returned sat
[2024-05-29 10:56:50] [INFO ] After 5536ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-29 10:56:51] [INFO ] [Nat]Absence check using 1040 positive place invariants in 216 ms returned sat
[2024-05-29 10:56:51] [INFO ] [Nat]Absence check using 1040 positive and 61 generalized place invariants in 13 ms returned sat
[2024-05-29 10:57:15] [INFO ] After 23262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-29 10:57:15] [INFO ] After 23276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-29 10:57:15] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 13 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 1293 ms.
Support contains 24 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 3101 transition count 2601
Applied a total of 3 rules in 282 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 283 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((F(p1)||G(p2))))))'
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 118 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2024-05-29 10:57:17] [INFO ] Computed 1101 invariants in 8 ms
[2024-05-29 10:57:19] [INFO ] Implicit Places using invariants in 2013 ms returned []
[2024-05-29 10:57:19] [INFO ] Invariant cache hit.
[2024-05-29 10:57:21] [INFO ] Implicit Places using invariants and state equation in 1748 ms returned []
Implicit Place search using SMT with State Equation took 3763 ms to find 0 implicit places.
[2024-05-29 10:57:21] [INFO ] Invariant cache hit.
[2024-05-29 10:57:22] [INFO ] Dead Transitions using invariants and state equation in 1668 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5550 ms. Remains : 3103/3103 places, 2603/2603 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s265 1) (EQ s267 1)), p1:(EQ s63 1), p2:(AND (OR (EQ s63 1) (AND (EQ s265 1) (EQ s267 1))) (EQ s369 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 17 reset in 1886 ms.
Product exploration explored 100000 steps with 17 reset in 2362 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 61959 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61959 steps, saw 55698 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 8 properties.
[2024-05-29 10:57:32] [INFO ] Invariant cache hit.
[2024-05-29 10:57:33] [INFO ] [Real]Absence check using 1101 positive place invariants in 250 ms returned sat
[2024-05-29 10:57:35] [INFO ] After 1834ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:6
[2024-05-29 10:57:35] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 5 ms to minimize.
[2024-05-29 10:57:35] [INFO ] Deduced a trap composed of 18 places in 185 ms of which 1 ms to minimize.
[2024-05-29 10:57:36] [INFO ] Deduced a trap composed of 20 places in 187 ms of which 2 ms to minimize.
[2024-05-29 10:57:36] [INFO ] Deduced a trap composed of 18 places in 315 ms of which 1 ms to minimize.
[2024-05-29 10:57:36] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 1 ms to minimize.
[2024-05-29 10:57:37] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 1 ms to minimize.
[2024-05-29 10:57:37] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 1 ms to minimize.
[2024-05-29 10:57:37] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 0 ms to minimize.
[2024-05-29 10:57:37] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 0 ms to minimize.
[2024-05-29 10:57:37] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2024-05-29 10:57:38] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 0 ms to minimize.
[2024-05-29 10:57:38] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2818 ms
[2024-05-29 10:57:38] [INFO ] After 4724ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:7
[2024-05-29 10:57:38] [INFO ] After 5958ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2024-05-29 10:57:39] [INFO ] [Nat]Absence check using 1101 positive place invariants in 239 ms returned sat
[2024-05-29 10:57:41] [INFO ] After 2063ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2024-05-29 10:57:41] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 1 ms to minimize.
[2024-05-29 10:57:42] [INFO ] Deduced a trap composed of 18 places in 192 ms of which 1 ms to minimize.
[2024-05-29 10:57:42] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 1 ms to minimize.
[2024-05-29 10:57:42] [INFO ] Deduced a trap composed of 18 places in 202 ms of which 1 ms to minimize.
[2024-05-29 10:57:42] [INFO ] Deduced a trap composed of 18 places in 194 ms of which 1 ms to minimize.
[2024-05-29 10:57:43] [INFO ] Deduced a trap composed of 24 places in 207 ms of which 1 ms to minimize.
[2024-05-29 10:57:43] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 2 ms to minimize.
[2024-05-29 10:57:43] [INFO ] Deduced a trap composed of 18 places in 225 ms of which 1 ms to minimize.
[2024-05-29 10:57:44] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 1 ms to minimize.
[2024-05-29 10:57:44] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 1 ms to minimize.
[2024-05-29 10:57:44] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 1 ms to minimize.
[2024-05-29 10:57:44] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 0 ms to minimize.
[2024-05-29 10:57:45] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 1 ms to minimize.
[2024-05-29 10:57:45] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 0 ms to minimize.
[2024-05-29 10:57:45] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 1 ms to minimize.
[2024-05-29 10:57:45] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 1 ms to minimize.
[2024-05-29 10:57:46] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 1 ms to minimize.
[2024-05-29 10:57:46] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 1 ms to minimize.
[2024-05-29 10:57:46] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 0 ms to minimize.
[2024-05-29 10:57:46] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 0 ms to minimize.
[2024-05-29 10:57:46] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
[2024-05-29 10:57:47] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 0 ms to minimize.
[2024-05-29 10:57:47] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 5 ms to minimize.
[2024-05-29 10:57:47] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 5706 ms
[2024-05-29 10:57:47] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2024-05-29 10:57:47] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2024-05-29 10:57:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 360 ms
[2024-05-29 10:57:48] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-29 10:57:48] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2024-05-29 10:57:48] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-29 10:57:48] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-29 10:57:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 642 ms
[2024-05-29 10:57:49] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-29 10:57:49] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2024-05-29 10:57:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 366 ms
[2024-05-29 10:57:49] [INFO ] After 9893ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 671 ms.
[2024-05-29 10:57:50] [INFO ] After 11875ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 642 ms.
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 894 times.
Drop transitions removed 894 transitions
Iterating global reduction 0 with 894 rules applied. Total rules applied 898 place count 3101 transition count 2601
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 899 place count 3100 transition count 2600
Applied a total of 899 rules in 563 ms. Remains 3100 /3103 variables (removed 3) and now considering 2600/2603 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 564 ms. Remains : 3100/3103 places, 2600/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 91163 steps, run timeout after 3006 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91163 steps, saw 90282 distinct states, run finished after 3008 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2600 rows 3100 cols
[2024-05-29 10:57:55] [INFO ] Computed 1101 invariants in 34 ms
[2024-05-29 10:57:56] [INFO ] [Real]Absence check using 1051 positive place invariants in 225 ms returned sat
[2024-05-29 10:57:56] [INFO ] [Real]Absence check using 1051 positive and 50 generalized place invariants in 12 ms returned sat
[2024-05-29 10:57:58] [INFO ] After 3150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 10:57:59] [INFO ] [Nat]Absence check using 1051 positive place invariants in 224 ms returned sat
[2024-05-29 10:57:59] [INFO ] [Nat]Absence check using 1051 positive and 50 generalized place invariants in 12 ms returned sat
[2024-05-29 10:58:23] [INFO ] After 23709ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 10:58:23] [INFO ] After 23713ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-29 10:58:23] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 3100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 149 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 135 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-29 10:58:24] [INFO ] Invariant cache hit.
[2024-05-29 10:58:26] [INFO ] Implicit Places using invariants in 2233 ms returned []
[2024-05-29 10:58:26] [INFO ] Invariant cache hit.
[2024-05-29 10:58:28] [INFO ] Implicit Places using invariants and state equation in 2272 ms returned []
Implicit Place search using SMT with State Equation took 4506 ms to find 0 implicit places.
[2024-05-29 10:58:28] [INFO ] Redundant transitions in 188 ms returned []
[2024-05-29 10:58:28] [INFO ] Invariant cache hit.
[2024-05-29 10:58:30] [INFO ] Dead Transitions using invariants and state equation in 1853 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6689 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 158 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Running SMT prover for 7 properties.
[2024-05-29 10:58:30] [INFO ] Invariant cache hit.
[2024-05-29 10:58:31] [INFO ] [Real]Absence check using 1051 positive place invariants in 231 ms returned sat
[2024-05-29 10:58:31] [INFO ] [Real]Absence check using 1051 positive and 50 generalized place invariants in 14 ms returned sat
[2024-05-29 10:58:34] [INFO ] After 3186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 10:58:35] [INFO ] [Nat]Absence check using 1051 positive place invariants in 226 ms returned sat
[2024-05-29 10:58:35] [INFO ] [Nat]Absence check using 1051 positive and 50 generalized place invariants in 19 ms returned sat
[2024-05-29 10:58:37] [INFO ] After 2281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 10:58:38] [INFO ] Deduced a trap composed of 5 places in 266 ms of which 1 ms to minimize.
[2024-05-29 10:58:38] [INFO ] Deduced a trap composed of 5 places in 271 ms of which 1 ms to minimize.
[2024-05-29 10:58:47] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 9723 ms
[2024-05-29 10:58:57] [INFO ] Deduced a trap composed of 6 places in 331 ms of which 1 ms to minimize.
[2024-05-29 10:58:58] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 1 ms to minimize.
[2024-05-29 10:58:58] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 1 ms to minimize.
[2024-05-29 10:58:58] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 1 ms to minimize.
[2024-05-29 10:58:59] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 0 ms to minimize.
[2024-05-29 10:58:59] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 1 ms to minimize.
[2024-05-29 10:59:00] [INFO ] Deduced a trap composed of 4 places in 267 ms of which 1 ms to minimize.
[2024-05-29 10:59:00] [INFO ] Deduced a trap composed of 8 places in 247 ms of which 1 ms to minimize.
[2024-05-29 10:59:09] [INFO ] Trap strengthening (SAT) tested/added 8/8 trap constraints in 12093 ms
[2024-05-29 10:59:14] [INFO ] Deduced a trap composed of 5 places in 274 ms of which 0 ms to minimize.
[2024-05-29 10:59:14] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 1 ms to minimize.
[2024-05-29 10:59:14] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 3 ms to minimize.
[2024-05-29 10:59:15] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 1 ms to minimize.
[2024-05-29 10:59:15] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 0 ms to minimize.
[2024-05-29 10:59:15] [INFO ] Deduced a trap composed of 5 places in 247 ms of which 1 ms to minimize.
[2024-05-29 10:59:16] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 0 ms to minimize.
[2024-05-29 10:59:16] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2024-05-29 10:59:16] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 1 ms to minimize.
[2024-05-29 10:59:17] [INFO ] Deduced a trap composed of 10 places in 225 ms of which 1 ms to minimize.
[2024-05-29 10:59:17] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 1 ms to minimize.
[2024-05-29 10:59:17] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 0 ms to minimize.
[2024-05-29 10:59:18] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 1 ms to minimize.
[2024-05-29 10:59:18] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 0 ms to minimize.
[2024-05-29 10:59:22] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 2 ms to minimize.
[2024-05-29 10:59:22] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 3 ms to minimize.
[2024-05-29 10:59:23] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 0 ms to minimize.
[2024-05-29 10:59:32] [INFO ] Trap strengthening (SAT) tested/added 17/17 trap constraints in 18489 ms
[2024-05-29 10:59:59] [INFO ] After 84084ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-29 10:59:59] [INFO ] After 85433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 92 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 2603 rows 3103 cols
[2024-05-29 10:59:59] [INFO ] Computed 1101 invariants in 7 ms
[2024-05-29 11:00:06] [INFO ] [Real]Absence check using 1101 positive place invariants in 2068 ms returned sat
[2024-05-29 11:00:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:00:14] [INFO ] [Real]Absence check using state equation in 8633 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 3103 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 : 3103/3103 places, 2603/2603 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3101 transition count 2601
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3100 transition count 2600
Applied a total of 4 rules in 436 ms. Remains 3100 /3103 variables (removed 3) and now considering 2600/2603 (removed 3) transitions.
// Phase 1: matrix 2600 rows 3100 cols
[2024-05-29 11:00:15] [INFO ] Computed 1101 invariants in 6 ms
[2024-05-29 11:00:16] [INFO ] Implicit Places using invariants in 1808 ms returned []
[2024-05-29 11:00:16] [INFO ] Invariant cache hit.
[2024-05-29 11:00:18] [INFO ] Implicit Places using invariants and state equation in 1836 ms returned []
Implicit Place search using SMT with State Equation took 3646 ms to find 0 implicit places.
[2024-05-29 11:00:18] [INFO ] Redundant transitions in 117 ms returned []
[2024-05-29 11:00:18] [INFO ] Invariant cache hit.
[2024-05-29 11:00:20] [INFO ] Dead Transitions using invariants and state equation in 1861 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3100/3103 places, 2600/2603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6069 ms. Remains : 3100/3103 places, 2600/2603 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 81943 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81943 steps, saw 74369 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 11:00:24] [INFO ] Invariant cache hit.
[2024-05-29 11:00:25] [INFO ] [Real]Absence check using 1101 positive place invariants in 245 ms returned sat
[2024-05-29 11:00:25] [INFO ] After 799ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 11:00:25] [INFO ] [Nat]Absence check using 1101 positive place invariants in 252 ms returned sat
[2024-05-29 11:00:27] [INFO ] After 1541ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 11:00:27] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 1 ms to minimize.
[2024-05-29 11:00:28] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 0 ms to minimize.
[2024-05-29 11:00:28] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 1 ms to minimize.
[2024-05-29 11:00:28] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 0 ms to minimize.
[2024-05-29 11:00:28] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 0 ms to minimize.
[2024-05-29 11:00:29] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 0 ms to minimize.
[2024-05-29 11:00:29] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 1 ms to minimize.
[2024-05-29 11:00:29] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-29 11:00:29] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2024-05-29 11:00:29] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 0 ms to minimize.
[2024-05-29 11:00:30] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 3 ms to minimize.
[2024-05-29 11:00:30] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2024-05-29 11:00:30] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 0 ms to minimize.
[2024-05-29 11:00:30] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 0 ms to minimize.
[2024-05-29 11:00:30] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-29 11:00:30] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-29 11:00:30] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3505 ms
[2024-05-29 11:00:31] [INFO ] After 5117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2024-05-29 11:00:31] [INFO ] After 6003ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 54 ms.
Support contains 3 out of 3100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Partial Free-agglomeration rule applied 597 times.
Drop transitions removed 597 transitions
Iterating global reduction 0 with 597 rules applied. Total rules applied 597 place count 3100 transition count 2600
Applied a total of 597 rules in 292 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 293 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 127286 steps, run timeout after 3002 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 127286 steps, saw 126328 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2600 rows 3100 cols
[2024-05-29 11:00:34] [INFO ] Computed 1101 invariants in 37 ms
[2024-05-29 11:00:35] [INFO ] [Real]Absence check using 1101 positive place invariants in 236 ms returned sat
[2024-05-29 11:00:35] [INFO ] After 828ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 11:00:36] [INFO ] [Nat]Absence check using 1101 positive place invariants in 244 ms returned sat
[2024-05-29 11:00:38] [INFO ] After 1589ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 11:00:38] [INFO ] Deduced a trap composed of 34 places in 338 ms of which 1 ms to minimize.
[2024-05-29 11:00:39] [INFO ] Deduced a trap composed of 28 places in 368 ms of which 1 ms to minimize.
[2024-05-29 11:00:39] [INFO ] Deduced a trap composed of 17 places in 366 ms of which 1 ms to minimize.
[2024-05-29 11:00:39] [INFO ] Deduced a trap composed of 17 places in 365 ms of which 1 ms to minimize.
[2024-05-29 11:00:40] [INFO ] Deduced a trap composed of 17 places in 324 ms of which 0 ms to minimize.
[2024-05-29 11:00:40] [INFO ] Deduced a trap composed of 17 places in 323 ms of which 1 ms to minimize.
[2024-05-29 11:00:41] [INFO ] Deduced a trap composed of 42 places in 304 ms of which 0 ms to minimize.
[2024-05-29 11:00:41] [INFO ] Deduced a trap composed of 17 places in 279 ms of which 1 ms to minimize.
[2024-05-29 11:00:41] [INFO ] Deduced a trap composed of 33 places in 253 ms of which 0 ms to minimize.
[2024-05-29 11:00:42] [INFO ] Deduced a trap composed of 25 places in 295 ms of which 1 ms to minimize.
[2024-05-29 11:00:42] [INFO ] Deduced a trap composed of 17 places in 275 ms of which 1 ms to minimize.
[2024-05-29 11:00:42] [INFO ] Deduced a trap composed of 17 places in 238 ms of which 0 ms to minimize.
[2024-05-29 11:00:43] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 1 ms to minimize.
[2024-05-29 11:00:43] [INFO ] Deduced a trap composed of 17 places in 240 ms of which 0 ms to minimize.
[2024-05-29 11:00:43] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 1 ms to minimize.
[2024-05-29 11:00:44] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 1 ms to minimize.
[2024-05-29 11:00:44] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 0 ms to minimize.
[2024-05-29 11:00:44] [INFO ] Deduced a trap composed of 28 places in 181 ms of which 0 ms to minimize.
[2024-05-29 11:00:44] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 0 ms to minimize.
[2024-05-29 11:00:45] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 1 ms to minimize.
[2024-05-29 11:00:45] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 1 ms to minimize.
[2024-05-29 11:00:45] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 1 ms to minimize.
[2024-05-29 11:00:45] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 1 ms to minimize.
[2024-05-29 11:00:46] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 0 ms to minimize.
[2024-05-29 11:00:46] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 1 ms to minimize.
[2024-05-29 11:00:46] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 0 ms to minimize.
[2024-05-29 11:00:46] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 0 ms to minimize.
[2024-05-29 11:00:46] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 0 ms to minimize.
[2024-05-29 11:00:47] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 2 ms to minimize.
[2024-05-29 11:00:47] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 0 ms to minimize.
[2024-05-29 11:00:47] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2024-05-29 11:00:47] [INFO ] Deduced a trap composed of 56 places in 117 ms of which 1 ms to minimize.
[2024-05-29 11:00:47] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-29 11:00:48] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 0 ms to minimize.
[2024-05-29 11:00:48] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 10001 ms
[2024-05-29 11:00:48] [INFO ] After 11666ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2024-05-29 11:00:48] [INFO ] After 12635ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 35 ms.
Support contains 3 out of 3100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 155 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 130 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-29 11:00:48] [INFO ] Invariant cache hit.
[2024-05-29 11:00:50] [INFO ] Implicit Places using invariants in 2098 ms returned []
[2024-05-29 11:00:50] [INFO ] Invariant cache hit.
[2024-05-29 11:00:52] [INFO ] Implicit Places using invariants and state equation in 2189 ms returned []
Implicit Place search using SMT with State Equation took 4291 ms to find 0 implicit places.
[2024-05-29 11:00:53] [INFO ] Redundant transitions in 75 ms returned []
[2024-05-29 11:00:53] [INFO ] Invariant cache hit.
[2024-05-29 11:00:54] [INFO ] Dead Transitions using invariants and state equation in 1703 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6206 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 129 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 11:00:54] [INFO ] Invariant cache hit.
[2024-05-29 11:00:55] [INFO ] [Real]Absence check using 1101 positive place invariants in 230 ms returned sat
[2024-05-29 11:00:55] [INFO ] After 790ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 11:00:56] [INFO ] [Nat]Absence check using 1101 positive place invariants in 242 ms returned sat
[2024-05-29 11:00:57] [INFO ] After 1541ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 11:00:58] [INFO ] Deduced a trap composed of 17 places in 339 ms of which 1 ms to minimize.
[2024-05-29 11:00:58] [INFO ] Deduced a trap composed of 19 places in 303 ms of which 1 ms to minimize.
[2024-05-29 11:00:59] [INFO ] Deduced a trap composed of 12 places in 324 ms of which 1 ms to minimize.
[2024-05-29 11:00:59] [INFO ] Deduced a trap composed of 17 places in 297 ms of which 0 ms to minimize.
[2024-05-29 11:00:59] [INFO ] Deduced a trap composed of 22 places in 262 ms of which 0 ms to minimize.
[2024-05-29 11:01:00] [INFO ] Deduced a trap composed of 25 places in 253 ms of which 0 ms to minimize.
[2024-05-29 11:01:00] [INFO ] Deduced a trap composed of 17 places in 260 ms of which 1 ms to minimize.
[2024-05-29 11:01:00] [INFO ] Deduced a trap composed of 17 places in 250 ms of which 1 ms to minimize.
[2024-05-29 11:01:01] [INFO ] Deduced a trap composed of 17 places in 231 ms of which 1 ms to minimize.
[2024-05-29 11:01:01] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 0 ms to minimize.
[2024-05-29 11:01:01] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 1 ms to minimize.
[2024-05-29 11:01:02] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 1 ms to minimize.
[2024-05-29 11:01:02] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 1 ms to minimize.
[2024-05-29 11:01:02] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 0 ms to minimize.
[2024-05-29 11:01:02] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 0 ms to minimize.
[2024-05-29 11:01:03] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 0 ms to minimize.
[2024-05-29 11:01:03] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 0 ms to minimize.
[2024-05-29 11:01:03] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 0 ms to minimize.
[2024-05-29 11:01:03] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 0 ms to minimize.
[2024-05-29 11:01:04] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 1 ms to minimize.
[2024-05-29 11:01:04] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 1 ms to minimize.
[2024-05-29 11:01:04] [INFO ] Deduced a trap composed of 52 places in 136 ms of which 1 ms to minimize.
[2024-05-29 11:01:04] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 1 ms to minimize.
[2024-05-29 11:01:04] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-05-29 11:01:04] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 0 ms to minimize.
[2024-05-29 11:01:05] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 7093 ms
[2024-05-29 11:01:05] [INFO ] After 8705ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2024-05-29 11:01:05] [INFO ] After 9599ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 2600 rows 3100 cols
[2024-05-29 11:01:05] [INFO ] Computed 1101 invariants in 7 ms
[2024-05-29 11:01:11] [INFO ] [Real]Absence check using 1101 positive place invariants in 1746 ms returned sat
[2024-05-29 11:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:01:20] [INFO ] [Real]Absence check using state equation in 8958 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 17 reset in 1932 ms.
Product exploration explored 100000 steps with 17 reset in 2435 ms.
Built C files in :
/tmp/ltsmin3110775566565129512
[2024-05-29 11:01:24] [INFO ] Too many transitions (2600) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:01:24] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3110775566565129512
Running compilation step : cd /tmp/ltsmin3110775566565129512;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3110775566565129512;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3110775566565129512;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 3100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 144 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-29 11:01:28] [INFO ] Invariant cache hit.
[2024-05-29 11:01:30] [INFO ] Implicit Places using invariants in 1879 ms returned []
[2024-05-29 11:01:30] [INFO ] Invariant cache hit.
[2024-05-29 11:01:31] [INFO ] Implicit Places using invariants and state equation in 1920 ms returned []
Implicit Place search using SMT with State Equation took 3800 ms to find 0 implicit places.
[2024-05-29 11:01:32] [INFO ] Redundant transitions in 69 ms returned []
[2024-05-29 11:01:32] [INFO ] Invariant cache hit.
[2024-05-29 11:01:33] [INFO ] Dead Transitions using invariants and state equation in 1848 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5868 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Built C files in :
/tmp/ltsmin17693856877185587289
[2024-05-29 11:01:33] [INFO ] Too many transitions (2600) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:01:33] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17693856877185587289
Running compilation step : cd /tmp/ltsmin17693856877185587289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin17693856877185587289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin17693856877185587289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 11:01:37] [INFO ] Flatten gal took : 90 ms
[2024-05-29 11:01:37] [INFO ] Flatten gal took : 94 ms
[2024-05-29 11:01:37] [INFO ] Time to serialize gal into /tmp/LTL3041539558031972155.gal : 28 ms
[2024-05-29 11:01:37] [INFO ] Time to serialize properties into /tmp/LTL10667401468776014729.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3041539558031972155.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16692465748193100089.hoa' '-atoms' '/tmp/LTL10667401468776014729.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10667401468776014729.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16692465748193100089.hoa
Detected timeout of ITS tools.
[2024-05-29 11:01:52] [INFO ] Flatten gal took : 85 ms
[2024-05-29 11:01:52] [INFO ] Flatten gal took : 87 ms
[2024-05-29 11:01:52] [INFO ] Time to serialize gal into /tmp/LTL9493401938152603915.gal : 13 ms
[2024-05-29 11:01:52] [INFO ] Time to serialize properties into /tmp/LTL2287151081193417910.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9493401938152603915.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2287151081193417910.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((X((F("(p63==1)"))||(G("(((p63==1)||((p265==1)&&(p267==1)))&&(p369==1))"))))||("((p265==1)&&(p267==1))"))))
Formula 0 simplified : G(!"((p265==1)&&(p267==1))" & X(G!"(p63==1)" & F!"(((p63==1)||((p265==1)&&(p267==1)))&&(p369==1))"))
Detected timeout of ITS tools.
[2024-05-29 11:02:07] [INFO ] Flatten gal took : 88 ms
[2024-05-29 11:02:07] [INFO ] Applying decomposition
[2024-05-29 11:02:07] [INFO ] Flatten gal took : 83 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7865279558150954589.txt' '-o' '/tmp/graph7865279558150954589.bin' '-w' '/tmp/graph7865279558150954589.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7865279558150954589.bin' '-l' '-1' '-v' '-w' '/tmp/graph7865279558150954589.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:02:08] [INFO ] Decomposing Gal with order
[2024-05-29 11:02:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:02:08] [INFO ] Removed a total of 600 redundant transitions.
[2024-05-29 11:02:08] [INFO ] Flatten gal took : 236 ms
[2024-05-29 11:02:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 70 ms.
[2024-05-29 11:02:09] [INFO ] Time to serialize gal into /tmp/LTL3291815056436764272.gal : 47 ms
[2024-05-29 11:02:09] [INFO ] Time to serialize properties into /tmp/LTL15785972884958225594.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3291815056436764272.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15785972884958225594.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((X((F("(i0.i1.i1.u22.p63==1)"))||(G("(((i0.i1.i1.u22.p63==1)||((i5.i0.i3.u94.p265==1)&&(i5.i0.i0.u95.p267==1)))&&(i6.i1.i2.u131.p...225
Formula 0 simplified : G(!"((i5.i0.i3.u94.p265==1)&&(i5.i0.i0.u95.p267==1))" & X(G!"(i0.i1.i1.u22.p63==1)" & F!"(((i0.i1.i1.u22.p63==1)||((i5.i0.i3.u94.p26...215
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9902396444734275179
[2024-05-29 11:02:24] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9902396444734275179
Running compilation step : cd /tmp/ltsmin9902396444734275179;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin9902396444734275179;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin9902396444734275179;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPs-PT-100A-LTLFireability-00 finished in 310108 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 136 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2024-05-29 11:02:27] [INFO ] Computed 1101 invariants in 8 ms
[2024-05-29 11:02:29] [INFO ] Implicit Places using invariants in 1828 ms returned []
[2024-05-29 11:02:29] [INFO ] Invariant cache hit.
[2024-05-29 11:02:31] [INFO ] Implicit Places using invariants and state equation in 1923 ms returned []
Implicit Place search using SMT with State Equation took 3753 ms to find 0 implicit places.
[2024-05-29 11:02:31] [INFO ] Invariant cache hit.
[2024-05-29 11:02:32] [INFO ] Dead Transitions using invariants and state equation in 1856 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5747 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s1152 0) (EQ s1171 0)), p1:(NEQ s431 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 18 reset in 1915 ms.
Product exploration explored 100000 steps with 18 reset in 2392 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), true, (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 71 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 81407 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81407 steps, saw 73304 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 11:02:41] [INFO ] Invariant cache hit.
[2024-05-29 11:02:41] [INFO ] [Real]Absence check using 1101 positive place invariants in 252 ms returned sat
[2024-05-29 11:02:43] [INFO ] After 2439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 11:02:44] [INFO ] [Nat]Absence check using 1101 positive place invariants in 248 ms returned sat
[2024-05-29 11:02:45] [INFO ] After 1555ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 11:02:46] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 1 ms to minimize.
[2024-05-29 11:02:46] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 1 ms to minimize.
[2024-05-29 11:02:46] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 0 ms to minimize.
[2024-05-29 11:02:46] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 1 ms to minimize.
[2024-05-29 11:02:47] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 1 ms to minimize.
[2024-05-29 11:02:47] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 1 ms to minimize.
[2024-05-29 11:02:47] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 1 ms to minimize.
[2024-05-29 11:02:47] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 0 ms to minimize.
[2024-05-29 11:02:47] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
[2024-05-29 11:02:48] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 0 ms to minimize.
[2024-05-29 11:02:48] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 1 ms to minimize.
[2024-05-29 11:02:48] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 0 ms to minimize.
[2024-05-29 11:02:48] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2024-05-29 11:02:48] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:02:48] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2024-05-29 11:02:49] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 0 ms to minimize.
[2024-05-29 11:02:49] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-29 11:02:49] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3458 ms
[2024-05-29 11:02:49] [INFO ] After 5084ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2024-05-29 11:02:49] [INFO ] After 6002ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 51 ms.
Support contains 1 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 14 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 0 with 896 rules applied. Total rules applied 900 place count 3101 transition count 2601
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 901 place count 3100 transition count 2600
Applied a total of 901 rules in 602 ms. Remains 3100 /3103 variables (removed 3) and now considering 2600/2603 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 603 ms. Remains : 3100/3103 places, 2600/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 1) seen :0
Finished probabilistic random walk after 99244 steps, run visited all 1 properties in 2386 ms. (steps per millisecond=41 )
Probabilistic random walk after 99244 steps, saw 98333 distinct states, run finished after 2392 ms. (steps per millisecond=41 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 3103 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 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 306 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2024-05-29 11:02:53] [INFO ] Computed 1101 invariants in 12 ms
[2024-05-29 11:02:55] [INFO ] Implicit Places using invariants in 1887 ms returned []
[2024-05-29 11:02:55] [INFO ] Invariant cache hit.
[2024-05-29 11:02:57] [INFO ] Implicit Places using invariants and state equation in 1862 ms returned []
Implicit Place search using SMT with State Equation took 3759 ms to find 0 implicit places.
[2024-05-29 11:02:57] [INFO ] Redundant transitions in 71 ms returned []
[2024-05-29 11:02:57] [INFO ] Invariant cache hit.
[2024-05-29 11:02:59] [INFO ] Dead Transitions using invariants and state equation in 1825 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5970 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 81805 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81805 steps, saw 74243 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 11:03:02] [INFO ] Invariant cache hit.
[2024-05-29 11:03:03] [INFO ] [Real]Absence check using 1101 positive place invariants in 247 ms returned sat
[2024-05-29 11:03:04] [INFO ] After 2277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 11:03:05] [INFO ] [Nat]Absence check using 1101 positive place invariants in 247 ms returned sat
[2024-05-29 11:03:07] [INFO ] After 1546ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 11:03:07] [INFO ] Deduced a trap composed of 18 places in 219 ms of which 1 ms to minimize.
[2024-05-29 11:03:07] [INFO ] Deduced a trap composed of 18 places in 218 ms of which 0 ms to minimize.
[2024-05-29 11:03:08] [INFO ] Deduced a trap composed of 18 places in 216 ms of which 1 ms to minimize.
[2024-05-29 11:03:08] [INFO ] Deduced a trap composed of 18 places in 233 ms of which 0 ms to minimize.
[2024-05-29 11:03:08] [INFO ] Deduced a trap composed of 30 places in 177 ms of which 0 ms to minimize.
[2024-05-29 11:03:09] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 1 ms to minimize.
[2024-05-29 11:03:09] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 1 ms to minimize.
[2024-05-29 11:03:09] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 1 ms to minimize.
[2024-05-29 11:03:09] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 0 ms to minimize.
[2024-05-29 11:03:09] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 0 ms to minimize.
[2024-05-29 11:03:10] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 0 ms to minimize.
[2024-05-29 11:03:10] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2024-05-29 11:03:10] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 1 ms to minimize.
[2024-05-29 11:03:10] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 0 ms to minimize.
[2024-05-29 11:03:10] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3526 ms
[2024-05-29 11:03:10] [INFO ] After 5139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2024-05-29 11:03:10] [INFO ] After 6032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 62 ms.
Support contains 1 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 0 with 896 rules applied. Total rules applied 896 place count 3101 transition count 2601
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 897 place count 3100 transition count 2600
Applied a total of 897 rules in 483 ms. Remains 3100 /3101 variables (removed 1) and now considering 2600/2601 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 484 ms. Remains : 3100/3101 places, 2600/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Finished probabilistic random walk after 99244 steps, run visited all 1 properties in 2402 ms. (steps per millisecond=41 )
Probabilistic random walk after 99244 steps, saw 98333 distinct states, run finished after 2409 ms. (steps per millisecond=41 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 18 reset in 1858 ms.
Product exploration explored 100000 steps with 18 reset in 2323 ms.
Built C files in :
/tmp/ltsmin3589930304783837842
[2024-05-29 11:03:18] [INFO ] Too many transitions (2601) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:03:18] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3589930304783837842
Running compilation step : cd /tmp/ltsmin3589930304783837842;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3589930304783837842;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3589930304783837842;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 148 ms. Remains 3100 /3101 variables (removed 1) and now considering 2600/2601 (removed 1) transitions.
// Phase 1: matrix 2600 rows 3100 cols
[2024-05-29 11:03:21] [INFO ] Computed 1101 invariants in 8 ms
[2024-05-29 11:03:23] [INFO ] Implicit Places using invariants in 1923 ms returned []
[2024-05-29 11:03:23] [INFO ] Invariant cache hit.
[2024-05-29 11:03:25] [INFO ] Implicit Places using invariants and state equation in 1899 ms returned []
Implicit Place search using SMT with State Equation took 3823 ms to find 0 implicit places.
[2024-05-29 11:03:25] [INFO ] Redundant transitions in 68 ms returned []
[2024-05-29 11:03:25] [INFO ] Invariant cache hit.
[2024-05-29 11:03:27] [INFO ] Dead Transitions using invariants and state equation in 1895 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5939 ms. Remains : 3100/3101 places, 2600/2601 transitions.
Built C files in :
/tmp/ltsmin14603733958397308346
[2024-05-29 11:03:27] [INFO ] Too many transitions (2600) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:03:27] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14603733958397308346
Running compilation step : cd /tmp/ltsmin14603733958397308346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14603733958397308346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14603733958397308346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 11:03:30] [INFO ] Flatten gal took : 77 ms
[2024-05-29 11:03:31] [INFO ] Flatten gal took : 77 ms
[2024-05-29 11:03:31] [INFO ] Time to serialize gal into /tmp/LTL14110153116785835172.gal : 18 ms
[2024-05-29 11:03:31] [INFO ] Time to serialize properties into /tmp/LTL1800634498735171897.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14110153116785835172.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2177960774461751772.hoa' '-atoms' '/tmp/LTL1800634498735171897.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1800634498735171897.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2177960774461751772.hoa
Detected timeout of ITS tools.
[2024-05-29 11:03:46] [INFO ] Flatten gal took : 121 ms
[2024-05-29 11:03:46] [INFO ] Flatten gal took : 155 ms
[2024-05-29 11:03:46] [INFO ] Time to serialize gal into /tmp/LTL5006659840128572441.gal : 26 ms
[2024-05-29 11:03:46] [INFO ] Time to serialize properties into /tmp/LTL11459417032134591421.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5006659840128572441.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11459417032134591421.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(p431==0)")))&&("((p1152==0)||(p1171==0))"))))
Formula 0 simplified : X(!"((p1152==0)||(p1171==0))" | FG!"(p431==0)")
Detected timeout of ITS tools.
[2024-05-29 11:04:01] [INFO ] Flatten gal took : 128 ms
[2024-05-29 11:04:01] [INFO ] Applying decomposition
[2024-05-29 11:04:01] [INFO ] Flatten gal took : 119 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1586757502712498664.txt' '-o' '/tmp/graph1586757502712498664.bin' '-w' '/tmp/graph1586757502712498664.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1586757502712498664.bin' '-l' '-1' '-v' '-w' '/tmp/graph1586757502712498664.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:04:02] [INFO ] Decomposing Gal with order
[2024-05-29 11:04:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:04:02] [INFO ] Removed a total of 600 redundant transitions.
[2024-05-29 11:04:02] [INFO ] Flatten gal took : 149 ms
[2024-05-29 11:04:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 222 ms.
[2024-05-29 11:04:02] [INFO ] Time to serialize gal into /tmp/LTL6155961372280179257.gal : 31 ms
[2024-05-29 11:04:02] [INFO ] Time to serialize properties into /tmp/LTL8700208976963854055.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6155961372280179257.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8700208976963854055.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(i7.i0.i3.u153.p431==0)")))&&("((i20.i1.i2.u409.p1152==0)||(i20.i1.i0.u416.p1171==0))"))))
Formula 0 simplified : X(!"((i20.i1.i2.u409.p1152==0)||(i20.i1.i0.u416.p1171==0))" | FG!"(i7.i0.i3.u153.p431==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14955676802866847793
[2024-05-29 11:04:17] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14955676802866847793
Running compilation step : cd /tmp/ltsmin14955676802866847793;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14955676802866847793;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14955676802866847793;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPs-PT-100A-LTLFireability-02 finished in 113683 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 138 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2024-05-29 11:04:21] [INFO ] Computed 1101 invariants in 13 ms
[2024-05-29 11:04:22] [INFO ] Implicit Places using invariants in 1908 ms returned []
[2024-05-29 11:04:22] [INFO ] Invariant cache hit.
[2024-05-29 11:04:24] [INFO ] Implicit Places using invariants and state equation in 1936 ms returned []
Implicit Place search using SMT with State Equation took 3861 ms to find 0 implicit places.
[2024-05-29 11:04:24] [INFO ] Invariant cache hit.
[2024-05-29 11:04:26] [INFO ] Dead Transitions using invariants and state equation in 1849 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5849 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s1023 1) (AND (EQ s313 1) (EQ s340 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22 reset in 1868 ms.
Product exploration explored 100000 steps with 22 reset in 2354 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 79436 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79436 steps, saw 71534 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 11:04:34] [INFO ] Invariant cache hit.
[2024-05-29 11:04:35] [INFO ] [Real]Absence check using 1101 positive place invariants in 244 ms returned sat
[2024-05-29 11:04:35] [INFO ] After 841ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 11:04:36] [INFO ] [Nat]Absence check using 1101 positive place invariants in 236 ms returned sat
[2024-05-29 11:04:46] [INFO ] After 11260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 19 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 894 times.
Drop transitions removed 894 transitions
Iterating global reduction 0 with 894 rules applied. Total rules applied 898 place count 3101 transition count 2601
Applied a total of 898 rules in 409 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 409 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Finished probabilistic random walk after 67125 steps, run visited all 1 properties in 1561 ms. (steps per millisecond=43 )
Probabilistic random walk after 67125 steps, saw 66350 distinct states, run finished after 1566 ms. (steps per millisecond=42 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 11:04:49] [INFO ] Invariant cache hit.
[2024-05-29 11:04:55] [INFO ] [Real]Absence check using 1101 positive place invariants in 1880 ms returned sat
[2024-05-29 11:04:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:05:04] [INFO ] [Real]Absence check using state equation in 9131 ms returned unknown
Could not prove EG (NOT p0)
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 164 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2024-05-29 11:05:04] [INFO ] Invariant cache hit.
[2024-05-29 11:05:06] [INFO ] Implicit Places using invariants in 1917 ms returned []
[2024-05-29 11:05:06] [INFO ] Invariant cache hit.
[2024-05-29 11:05:08] [INFO ] Implicit Places using invariants and state equation in 1873 ms returned []
Implicit Place search using SMT with State Equation took 3792 ms to find 0 implicit places.
[2024-05-29 11:05:08] [INFO ] Invariant cache hit.
[2024-05-29 11:05:10] [INFO ] Dead Transitions using invariants and state equation in 1779 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5736 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 81182 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81182 steps, saw 73097 distinct states, run finished after 3003 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 11:05:13] [INFO ] Invariant cache hit.
[2024-05-29 11:05:14] [INFO ] [Real]Absence check using 1101 positive place invariants in 250 ms returned sat
[2024-05-29 11:05:14] [INFO ] After 892ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 11:05:15] [INFO ] [Nat]Absence check using 1101 positive place invariants in 258 ms returned sat
[2024-05-29 11:05:26] [INFO ] After 11447ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 894 times.
Drop transitions removed 894 transitions
Iterating global reduction 0 with 894 rules applied. Total rules applied 898 place count 3101 transition count 2601
Applied a total of 898 rules in 414 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 414 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Finished probabilistic random walk after 67125 steps, run visited all 1 properties in 1691 ms. (steps per millisecond=39 )
Probabilistic random walk after 67125 steps, saw 66350 distinct states, run finished after 1697 ms. (steps per millisecond=39 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 11:05:28] [INFO ] Invariant cache hit.
[2024-05-29 11:05:35] [INFO ] [Real]Absence check using 1101 positive place invariants in 2020 ms returned sat
[2024-05-29 11:05:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:05:44] [INFO ] [Real]Absence check using state equation in 8755 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22 reset in 1816 ms.
Product exploration explored 100000 steps with 21 reset in 2251 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 12 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3103 transition count 2603
Deduced a syphon composed of 2 places in 10 ms
Applied a total of 2 rules in 465 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2024-05-29 11:05:48] [INFO ] Redundant transitions in 71 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2024-05-29 11:05:49] [INFO ] Computed 1101 invariants in 21 ms
[2024-05-29 11:05:50] [INFO ] Dead Transitions using invariants and state equation in 1878 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3103/3103 places, 2603/2603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2428 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Built C files in :
/tmp/ltsmin15471857798899570865
[2024-05-29 11:05:50] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15471857798899570865
Running compilation step : cd /tmp/ltsmin15471857798899570865;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15471857798899570865;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15471857798899570865;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 147 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2024-05-29 11:05:54] [INFO ] Computed 1101 invariants in 10 ms
[2024-05-29 11:05:55] [INFO ] Implicit Places using invariants in 1858 ms returned []
[2024-05-29 11:05:55] [INFO ] Invariant cache hit.
[2024-05-29 11:05:57] [INFO ] Implicit Places using invariants and state equation in 1872 ms returned []
Implicit Place search using SMT with State Equation took 3739 ms to find 0 implicit places.
[2024-05-29 11:05:57] [INFO ] Invariant cache hit.
[2024-05-29 11:05:59] [INFO ] Dead Transitions using invariants and state equation in 1805 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5692 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Built C files in :
/tmp/ltsmin1438964639100910473
[2024-05-29 11:05:59] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1438964639100910473
Running compilation step : cd /tmp/ltsmin1438964639100910473;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1438964639100910473;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1438964639100910473;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 11:06:02] [INFO ] Flatten gal took : 121 ms
[2024-05-29 11:06:03] [INFO ] Flatten gal took : 138 ms
[2024-05-29 11:06:03] [INFO ] Time to serialize gal into /tmp/LTL3498227058624485128.gal : 12 ms
[2024-05-29 11:06:03] [INFO ] Time to serialize properties into /tmp/LTL13734614303039277772.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3498227058624485128.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4175526587862240438.hoa' '-atoms' '/tmp/LTL13734614303039277772.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13734614303039277772.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4175526587862240438.hoa
Detected timeout of ITS tools.
[2024-05-29 11:06:18] [INFO ] Flatten gal took : 121 ms
[2024-05-29 11:06:18] [INFO ] Flatten gal took : 132 ms
[2024-05-29 11:06:18] [INFO ] Time to serialize gal into /tmp/LTL6533909829735365968.gal : 14 ms
[2024-05-29 11:06:18] [INFO ] Time to serialize properties into /tmp/LTL2278365014587352850.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6533909829735365968.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2278365014587352850.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((p1023==1)||((p313==1)&&(p340==1)))")))))
Formula 0 simplified : XXG!"((p1023==1)||((p313==1)&&(p340==1)))"
Detected timeout of ITS tools.
[2024-05-29 11:06:33] [INFO ] Flatten gal took : 120 ms
[2024-05-29 11:06:33] [INFO ] Applying decomposition
[2024-05-29 11:06:33] [INFO ] Flatten gal took : 137 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12239303325335350143.txt' '-o' '/tmp/graph12239303325335350143.bin' '-w' '/tmp/graph12239303325335350143.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12239303325335350143.bin' '-l' '-1' '-v' '-w' '/tmp/graph12239303325335350143.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:06:33] [INFO ] Decomposing Gal with order
[2024-05-29 11:06:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:06:34] [INFO ] Removed a total of 600 redundant transitions.
[2024-05-29 11:06:34] [INFO ] Flatten gal took : 120 ms
[2024-05-29 11:06:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 1204 labels/synchronizations in 247 ms.
[2024-05-29 11:06:34] [INFO ] Time to serialize gal into /tmp/LTL5390023848684473179.gal : 27 ms
[2024-05-29 11:06:34] [INFO ] Time to serialize properties into /tmp/LTL7420424961521370328.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5390023848684473179.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7420424961521370328.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((i19.i0.i0.u363.p1023==1)||((i6.i0.i0.u111.p313==1)&&(i6.i0.i2.u121.p340==1)))")))))
Formula 0 simplified : XXG!"((i19.i0.i0.u363.p1023==1)||((i6.i0.i0.u111.p313==1)&&(i6.i0.i2.u121.p340==1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17924862141255525951
[2024-05-29 11:06:49] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17924862141255525951
Running compilation step : cd /tmp/ltsmin17924862141255525951;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin17924862141255525951;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin17924862141255525951;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPs-PT-100A-LTLFireability-03 finished in 151945 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F((p0&&G(p1))))||G(p2))))'
Support contains 5 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 301 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2024-05-29 11:06:53] [INFO ] Computed 1101 invariants in 13 ms
[2024-05-29 11:06:55] [INFO ] Implicit Places using invariants in 1881 ms returned []
[2024-05-29 11:06:55] [INFO ] Invariant cache hit.
[2024-05-29 11:06:56] [INFO ] Implicit Places using invariants and state equation in 1785 ms returned []
Implicit Place search using SMT with State Equation took 3668 ms to find 0 implicit places.
[2024-05-29 11:06:56] [INFO ] Redundant transitions in 66 ms returned []
[2024-05-29 11:06:56] [INFO ] Invariant cache hit.
[2024-05-29 11:06:58] [INFO ] Dead Transitions using invariants and state equation in 1703 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5750 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (OR (AND (EQ s2465 1) (EQ s2482 1)) (AND (EQ s2717 1) (EQ s2738 1))) (EQ s2465 1) (EQ s2482 1)), p0:(OR (EQ s2465 0) (EQ s2482 0)), p1:(EQ s1613 0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 14 reset in 1843 ms.
Product exploration explored 100000 steps with 15 reset in 2330 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 90 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 2926 steps, including 0 resets, run visited all 4 properties in 81 ms. (steps per millisecond=36 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT (AND p0 p1))), (F (OR (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 200 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 5 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 150 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2024-05-29 11:07:03] [INFO ] Invariant cache hit.
[2024-05-29 11:07:05] [INFO ] Implicit Places using invariants in 1823 ms returned []
[2024-05-29 11:07:05] [INFO ] Invariant cache hit.
[2024-05-29 11:07:07] [INFO ] Implicit Places using invariants and state equation in 1711 ms returned []
Implicit Place search using SMT with State Equation took 3537 ms to find 0 implicit places.
[2024-05-29 11:07:07] [INFO ] Redundant transitions in 69 ms returned []
[2024-05-29 11:07:07] [INFO ] Invariant cache hit.
[2024-05-29 11:07:09] [INFO ] Dead Transitions using invariants and state equation in 1745 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5517 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 84 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 2819 steps, including 0 resets, run visited all 4 properties in 93 ms. (steps per millisecond=30 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT (AND p0 p1))), (F (OR (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 166 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 15 reset in 1823 ms.
Product exploration explored 100000 steps with 15 reset in 2219 ms.
Built C files in :
/tmp/ltsmin12719504569203005751
[2024-05-29 11:07:14] [INFO ] Too many transitions (2601) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:07:14] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12719504569203005751
Running compilation step : cd /tmp/ltsmin12719504569203005751;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12719504569203005751;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12719504569203005751;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 136 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2024-05-29 11:07:17] [INFO ] Invariant cache hit.
[2024-05-29 11:07:19] [INFO ] Implicit Places using invariants in 1839 ms returned []
[2024-05-29 11:07:19] [INFO ] Invariant cache hit.
[2024-05-29 11:07:21] [INFO ] Implicit Places using invariants and state equation in 1861 ms returned []
Implicit Place search using SMT with State Equation took 3706 ms to find 0 implicit places.
[2024-05-29 11:07:21] [INFO ] Redundant transitions in 65 ms returned []
[2024-05-29 11:07:21] [INFO ] Invariant cache hit.
[2024-05-29 11:07:22] [INFO ] Dead Transitions using invariants and state equation in 1633 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5546 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Built C files in :
/tmp/ltsmin12061017650078557709
[2024-05-29 11:07:22] [INFO ] Too many transitions (2601) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:07:22] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12061017650078557709
Running compilation step : cd /tmp/ltsmin12061017650078557709;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12061017650078557709;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12061017650078557709;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 11:07:25] [INFO ] Flatten gal took : 114 ms
[2024-05-29 11:07:26] [INFO ] Flatten gal took : 111 ms
[2024-05-29 11:07:26] [INFO ] Time to serialize gal into /tmp/LTL7962924596934271283.gal : 11 ms
[2024-05-29 11:07:26] [INFO ] Time to serialize properties into /tmp/LTL13911019205737464387.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7962924596934271283.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11550178393427108357.hoa' '-atoms' '/tmp/LTL13911019205737464387.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13911019205737464387.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11550178393427108357.hoa
Detected timeout of ITS tools.
[2024-05-29 11:07:41] [INFO ] Flatten gal took : 139 ms
[2024-05-29 11:07:41] [INFO ] Flatten gal took : 120 ms
[2024-05-29 11:07:41] [INFO ] Time to serialize gal into /tmp/LTL14356526180363321887.gal : 12 ms
[2024-05-29 11:07:41] [INFO ] Time to serialize properties into /tmp/LTL8262961030906356875.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14356526180363321887.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8262961030906356875.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X(F(("((p2465==0)||(p2482==0))")&&(G("(p1613==0)")))))||(G("(((((p2465==1)&&(p2482==1))||((p2717==1)&&(p2738==1)))&&(p2465==1))&...173
Formula 0 simplified : F(XG(!"((p2465==0)||(p2482==0))" | F!"(p1613==0)") & F!"(((((p2465==1)&&(p2482==1))||((p2717==1)&&(p2738==1)))&&(p2465==1))&&(p2482=...161
Detected timeout of ITS tools.
[2024-05-29 11:07:56] [INFO ] Flatten gal took : 120 ms
[2024-05-29 11:07:56] [INFO ] Applying decomposition
[2024-05-29 11:07:56] [INFO ] Flatten gal took : 121 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15824085102212498120.txt' '-o' '/tmp/graph15824085102212498120.bin' '-w' '/tmp/graph15824085102212498120.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15824085102212498120.bin' '-l' '-1' '-v' '-w' '/tmp/graph15824085102212498120.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:07:56] [INFO ] Decomposing Gal with order
[2024-05-29 11:07:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:07:57] [INFO ] Removed a total of 600 redundant transitions.
[2024-05-29 11:07:57] [INFO ] Flatten gal took : 116 ms
[2024-05-29 11:07:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 151 ms.
[2024-05-29 11:07:57] [INFO ] Time to serialize gal into /tmp/LTL11007199531186977994.gal : 32 ms
[2024-05-29 11:07:57] [INFO ] Time to serialize properties into /tmp/LTL8051544709139043998.ltl : 32 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11007199531186977994.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8051544709139043998.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((X(F(("((i45.i1.i3.u875.p2465==0)||(i45.i1.i3.u880.p2482==0))")&&(G("(i29.i1.i3.u572.p1613==0)")))))||(G("(((((i45.i1.i3.u875.p24...302
Formula 0 simplified : F(XG(!"((i45.i1.i3.u875.p2465==0)||(i45.i1.i3.u880.p2482==0))" | F!"(i29.i1.i3.u572.p1613==0)") & F!"(((((i45.i1.i3.u875.p2465==1)&&...290
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12731083001697225825
[2024-05-29 11:08:12] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12731083001697225825
Running compilation step : cd /tmp/ltsmin12731083001697225825;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12731083001697225825;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12731083001697225825;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPs-PT-100A-LTLFireability-04 finished in 82818 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 262 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
[2024-05-29 11:08:15] [INFO ] Invariant cache hit.
[2024-05-29 11:08:17] [INFO ] Implicit Places using invariants in 1872 ms returned []
[2024-05-29 11:08:17] [INFO ] Invariant cache hit.
[2024-05-29 11:08:19] [INFO ] Implicit Places using invariants and state equation in 1709 ms returned []
Implicit Place search using SMT with State Equation took 3583 ms to find 0 implicit places.
[2024-05-29 11:08:19] [INFO ] Redundant transitions in 69 ms returned []
[2024-05-29 11:08:19] [INFO ] Invariant cache hit.
[2024-05-29 11:08:21] [INFO ] Dead Transitions using invariants and state equation in 1799 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5722 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s2483 1) (EQ s2510 1) (EQ s1446 1) (EQ s1467 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6857 steps with 0 reset in 126 ms.
FORMULA ShieldPPPs-PT-100A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLFireability-05 finished in 5912 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(!p0)||X(p1)) U X((F(p1)&&p2))))'
Support contains 6 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 121 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2024-05-29 11:08:21] [INFO ] Computed 1101 invariants in 9 ms
[2024-05-29 11:08:23] [INFO ] Implicit Places using invariants in 1949 ms returned []
[2024-05-29 11:08:23] [INFO ] Invariant cache hit.
[2024-05-29 11:08:25] [INFO ] Implicit Places using invariants and state equation in 1858 ms returned []
Implicit Place search using SMT with State Equation took 3817 ms to find 0 implicit places.
[2024-05-29 11:08:25] [INFO ] Invariant cache hit.
[2024-05-29 11:08:27] [INFO ] Dead Transitions using invariants and state equation in 1811 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5749 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s809 1) (EQ s836 1)), p2:(AND (EQ s1410 1) (EQ s1452 1)), p1:(AND (EQ s697 1) (EQ s739 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20 reset in 1748 ms.
Product exploration explored 100000 steps with 20 reset in 2234 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 169 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 60836 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 60836 steps, saw 54694 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 8 properties.
[2024-05-29 11:08:36] [INFO ] Invariant cache hit.
[2024-05-29 11:08:37] [INFO ] [Real]Absence check using 1101 positive place invariants in 248 ms returned sat
[2024-05-29 11:08:40] [INFO ] After 3951ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 11:08:41] [INFO ] [Nat]Absence check using 1101 positive place invariants in 242 ms returned sat
[2024-05-29 11:09:05] [INFO ] After 23644ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 11:09:05] [INFO ] After 23654ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-29 11:09:05] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 889 times.
Drop transitions removed 889 transitions
Iterating global reduction 0 with 889 rules applied. Total rules applied 893 place count 3101 transition count 2601
Applied a total of 893 rules in 392 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 392 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 336 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 131 ms. (steps per millisecond=76 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 81696 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 81696 steps, saw 80793 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :2
Running SMT prover for 6 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2024-05-29 11:09:10] [INFO ] Computed 1101 invariants in 22 ms
[2024-05-29 11:09:11] [INFO ] [Real]Absence check using 1045 positive place invariants in 244 ms returned sat
[2024-05-29 11:09:11] [INFO ] [Real]Absence check using 1045 positive and 56 generalized place invariants in 13 ms returned sat
[2024-05-29 11:09:14] [INFO ] After 3925ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 11:09:15] [INFO ] [Nat]Absence check using 1045 positive place invariants in 238 ms returned sat
[2024-05-29 11:09:15] [INFO ] [Nat]Absence check using 1045 positive and 56 generalized place invariants in 13 ms returned sat
[2024-05-29 11:09:39] [INFO ] After 23771ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 11:09:39] [INFO ] After 23776ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-29 11:09:39] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1848 ms.
Support contains 6 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 143 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 89437 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89437 steps, saw 88479 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-29 11:09:45] [INFO ] Invariant cache hit.
[2024-05-29 11:09:46] [INFO ] [Real]Absence check using 1045 positive place invariants in 220 ms returned sat
[2024-05-29 11:09:46] [INFO ] [Real]Absence check using 1045 positive and 56 generalized place invariants in 13 ms returned sat
[2024-05-29 11:09:48] [INFO ] After 3396ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 11:09:49] [INFO ] [Nat]Absence check using 1045 positive place invariants in 233 ms returned sat
[2024-05-29 11:09:49] [INFO ] [Nat]Absence check using 1045 positive and 56 generalized place invariants in 14 ms returned sat
[2024-05-29 11:10:13] [INFO ] After 23797ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 11:10:13] [INFO ] After 23800ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-29 11:10:13] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 150 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 139 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2024-05-29 11:10:14] [INFO ] Invariant cache hit.
[2024-05-29 11:10:16] [INFO ] Implicit Places using invariants in 2269 ms returned []
[2024-05-29 11:10:16] [INFO ] Invariant cache hit.
[2024-05-29 11:10:18] [INFO ] Implicit Places using invariants and state equation in 2252 ms returned []
Implicit Place search using SMT with State Equation took 4522 ms to find 0 implicit places.
[2024-05-29 11:10:18] [INFO ] Redundant transitions in 71 ms returned []
[2024-05-29 11:10:18] [INFO ] Invariant cache hit.
[2024-05-29 11:10:20] [INFO ] Dead Transitions using invariants and state equation in 1855 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6595 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p2), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 14 factoid took 228 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
// Phase 1: matrix 2603 rows 3103 cols
[2024-05-29 11:10:21] [INFO ] Computed 1101 invariants in 7 ms
[2024-05-29 11:10:28] [INFO ] [Real]Absence check using 1101 positive place invariants in 2584 ms returned sat
[2024-05-29 11:10:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:10:36] [INFO ] [Real]Absence check using state equation in 8153 ms returned unknown
Could not prove EG (NOT p2)
[2024-05-29 11:10:36] [INFO ] Invariant cache hit.
[2024-05-29 11:10:42] [INFO ] [Real]Absence check using 1101 positive place invariants in 1955 ms returned sat
[2024-05-29 11:10:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:10:51] [INFO ] [Real]Absence check using state equation in 8794 ms returned unknown
Could not prove EG (NOT p1)
Support contains 6 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 128 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2024-05-29 11:10:51] [INFO ] Invariant cache hit.
[2024-05-29 11:10:53] [INFO ] Implicit Places using invariants in 1838 ms returned []
[2024-05-29 11:10:53] [INFO ] Invariant cache hit.
[2024-05-29 11:10:55] [INFO ] Implicit Places using invariants and state equation in 1846 ms returned []
Implicit Place search using SMT with State Equation took 3693 ms to find 0 implicit places.
[2024-05-29 11:10:55] [INFO ] Invariant cache hit.
[2024-05-29 11:10:56] [INFO ] Dead Transitions using invariants and state equation in 1810 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5634 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p2)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 112 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-29 11:10:58] [INFO ] Invariant cache hit.
[2024-05-29 11:10:59] [INFO ] [Real]Absence check using 1101 positive place invariants in 240 ms returned sat
[2024-05-29 11:11:01] [INFO ] After 3269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 11:11:02] [INFO ] [Nat]Absence check using 1101 positive place invariants in 241 ms returned sat
[2024-05-29 11:11:26] [INFO ] After 23773ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 11:11:26] [INFO ] After 23776ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-29 11:11:26] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 889 times.
Drop transitions removed 889 transitions
Iterating global reduction 0 with 889 rules applied. Total rules applied 893 place count 3101 transition count 2601
Applied a total of 893 rules in 438 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 438 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 87777 steps, run timeout after 3003 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87777 steps, saw 86831 distinct states, run finished after 3003 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2024-05-29 11:11:31] [INFO ] Computed 1101 invariants in 23 ms
[2024-05-29 11:11:32] [INFO ] [Real]Absence check using 1045 positive place invariants in 228 ms returned sat
[2024-05-29 11:11:32] [INFO ] [Real]Absence check using 1045 positive and 56 generalized place invariants in 13 ms returned sat
[2024-05-29 11:11:35] [INFO ] After 3825ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 11:11:36] [INFO ] [Nat]Absence check using 1045 positive place invariants in 234 ms returned sat
[2024-05-29 11:11:36] [INFO ] [Nat]Absence check using 1045 positive and 56 generalized place invariants in 13 ms returned sat
[2024-05-29 11:12:00] [INFO ] After 23723ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 11:12:00] [INFO ] After 23725ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-29 11:12:00] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 142 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 135 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2024-05-29 11:12:00] [INFO ] Invariant cache hit.
[2024-05-29 11:12:02] [INFO ] Implicit Places using invariants in 2316 ms returned []
[2024-05-29 11:12:02] [INFO ] Invariant cache hit.
[2024-05-29 11:12:05] [INFO ] Implicit Places using invariants and state equation in 2254 ms returned []
Implicit Place search using SMT with State Equation took 4572 ms to find 0 implicit places.
[2024-05-29 11:12:05] [INFO ] Redundant transitions in 71 ms returned []
[2024-05-29 11:12:05] [INFO ] Invariant cache hit.
[2024-05-29 11:12:06] [INFO ] Dead Transitions using invariants and state equation in 1837 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6620 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 153 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 6 properties.
[2024-05-29 11:12:07] [INFO ] Invariant cache hit.
[2024-05-29 11:12:08] [INFO ] [Real]Absence check using 1045 positive place invariants in 230 ms returned sat
[2024-05-29 11:12:08] [INFO ] [Real]Absence check using 1045 positive and 56 generalized place invariants in 13 ms returned sat
[2024-05-29 11:12:10] [INFO ] After 3536ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 11:12:11] [INFO ] [Nat]Absence check using 1045 positive place invariants in 200 ms returned sat
[2024-05-29 11:12:11] [INFO ] [Nat]Absence check using 1045 positive and 56 generalized place invariants in 11 ms returned sat
[2024-05-29 11:13:16] [INFO ] After 64542ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 11:13:25] [INFO ] After 73574ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-29 11:13:25] [INFO ] After 74777ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p2)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1) p0))))]
False Knowledge obtained : [(F p2), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 10 factoid took 176 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
// Phase 1: matrix 2603 rows 3103 cols
[2024-05-29 11:13:26] [INFO ] Computed 1101 invariants in 12 ms
[2024-05-29 11:13:32] [INFO ] [Real]Absence check using 1101 positive place invariants in 2544 ms returned sat
[2024-05-29 11:13:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:13:41] [INFO ] [Real]Absence check using state equation in 8440 ms returned unknown
Could not prove EG (NOT p2)
[2024-05-29 11:13:41] [INFO ] Invariant cache hit.
[2024-05-29 11:13:47] [INFO ] [Real]Absence check using 1101 positive place invariants in 2094 ms returned sat
[2024-05-29 11:13:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:13:56] [INFO ] [Real]Absence check using state equation in 8580 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Product exploration explored 100000 steps with 20 reset in 1941 ms.
Product exploration explored 100000 steps with 20 reset in 2408 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Support contains 6 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 11 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3103 transition count 2603
Deduced a syphon composed of 2 places in 14 ms
Applied a total of 2 rules in 278 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2024-05-29 11:14:01] [INFO ] Redundant transitions in 77 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2024-05-29 11:14:01] [INFO ] Computed 1101 invariants in 6 ms
[2024-05-29 11:14:03] [INFO ] Dead Transitions using invariants and state equation in 1816 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3103/3103 places, 2603/2603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2191 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Built C files in :
/tmp/ltsmin3830314687940075059
[2024-05-29 11:14:03] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3830314687940075059
Running compilation step : cd /tmp/ltsmin3830314687940075059;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3830314687940075059;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3830314687940075059;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 134 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2024-05-29 11:14:06] [INFO ] Computed 1101 invariants in 6 ms
[2024-05-29 11:14:08] [INFO ] Implicit Places using invariants in 1913 ms returned []
[2024-05-29 11:14:08] [INFO ] Invariant cache hit.
[2024-05-29 11:14:10] [INFO ] Implicit Places using invariants and state equation in 1896 ms returned []
Implicit Place search using SMT with State Equation took 3811 ms to find 0 implicit places.
[2024-05-29 11:14:10] [INFO ] Invariant cache hit.
[2024-05-29 11:14:12] [INFO ] Dead Transitions using invariants and state equation in 1790 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5738 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Built C files in :
/tmp/ltsmin4617708729844048577
[2024-05-29 11:14:12] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4617708729844048577
Running compilation step : cd /tmp/ltsmin4617708729844048577;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4617708729844048577;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4617708729844048577;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 11:14:15] [INFO ] Flatten gal took : 146 ms
[2024-05-29 11:14:15] [INFO ] Flatten gal took : 133 ms
[2024-05-29 11:14:15] [INFO ] Time to serialize gal into /tmp/LTL16576881985557135570.gal : 11 ms
[2024-05-29 11:14:15] [INFO ] Time to serialize properties into /tmp/LTL14461958061974068922.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16576881985557135570.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9708159641049515960.hoa' '-atoms' '/tmp/LTL14461958061974068922.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14461958061974068922.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9708159641049515960.hoa
Detected timeout of ITS tools.
[2024-05-29 11:14:30] [INFO ] Flatten gal took : 113 ms
[2024-05-29 11:14:30] [INFO ] Flatten gal took : 130 ms
[2024-05-29 11:14:30] [INFO ] Time to serialize gal into /tmp/LTL1180490360136594989.gal : 10 ms
[2024-05-29 11:14:30] [INFO ] Time to serialize properties into /tmp/LTL14305012787922861703.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1180490360136594989.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14305012787922861703.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((((F(!("((p809==1)&&(p836==1))")))||(X("((p697==1)&&(p739==1))")))U(X(("((p1410==1)&&(p1452==1))")&&(F("((p697==1)&&(p739==1))")))))...156
Formula 0 simplified : (G"((p809==1)&&(p836==1))" & X!"((p697==1)&&(p739==1))") R X(!"((p1410==1)&&(p1452==1))" | G!"((p697==1)&&(p739==1))")
Detected timeout of ITS tools.
[2024-05-29 11:14:45] [INFO ] Flatten gal took : 111 ms
[2024-05-29 11:14:45] [INFO ] Applying decomposition
[2024-05-29 11:14:46] [INFO ] Flatten gal took : 117 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2963984567327383335.txt' '-o' '/tmp/graph2963984567327383335.bin' '-w' '/tmp/graph2963984567327383335.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2963984567327383335.bin' '-l' '-1' '-v' '-w' '/tmp/graph2963984567327383335.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:14:46] [INFO ] Decomposing Gal with order
[2024-05-29 11:14:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:14:46] [INFO ] Removed a total of 600 redundant transitions.
[2024-05-29 11:14:46] [INFO ] Flatten gal took : 105 ms
[2024-05-29 11:14:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 134 ms.
[2024-05-29 11:14:46] [INFO ] Time to serialize gal into /tmp/LTL12011040011928017695.gal : 45 ms
[2024-05-29 11:14:46] [INFO ] Time to serialize properties into /tmp/LTL18375916528940250573.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12011040011928017695.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18375916528940250573.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((((F(!("((i14.i1.i0.u287.p809==1)&&(i14.i1.i2.u297.p836==1))")))||(X("((i12.i1.i3.u248.p697==1)&&(i13.i0.i2.u263.p739==1))")))U(X(("...270
Formula 0 simplified : (G"((i14.i1.i0.u287.p809==1)&&(i14.i1.i2.u297.p836==1))" & X!"((i12.i1.i3.u248.p697==1)&&(i13.i0.i2.u263.p739==1))") R X(!"((i25.u50...255
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17794052463037521619
[2024-05-29 11:15:02] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17794052463037521619
Running compilation step : cd /tmp/ltsmin17794052463037521619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin17794052463037521619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin17794052463037521619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPs-PT-100A-LTLFireability-06 finished in 403445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 21 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3101 transition count 2601
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3100 transition count 2600
Applied a total of 4 rules in 490 ms. Remains 3100 /3103 variables (removed 3) and now considering 2600/2603 (removed 3) transitions.
// Phase 1: matrix 2600 rows 3100 cols
[2024-05-29 11:15:05] [INFO ] Computed 1101 invariants in 11 ms
[2024-05-29 11:15:07] [INFO ] Implicit Places using invariants in 1952 ms returned []
[2024-05-29 11:15:07] [INFO ] Invariant cache hit.
[2024-05-29 11:15:09] [INFO ] Implicit Places using invariants and state equation in 2075 ms returned []
Implicit Place search using SMT with State Equation took 4029 ms to find 0 implicit places.
[2024-05-29 11:15:09] [INFO ] Redundant transitions in 69 ms returned []
[2024-05-29 11:15:09] [INFO ] Invariant cache hit.
[2024-05-29 11:15:11] [INFO ] Dead Transitions using invariants and state equation in 2033 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3100/3103 places, 2600/2603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6635 ms. Remains : 3100/3103 places, 2600/2603 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s620 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 15 reset in 1819 ms.
Product exploration explored 100000 steps with 15 reset in 2336 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 83115 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83115 steps, saw 75435 distinct states, run finished after 3003 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 11:15:19] [INFO ] Invariant cache hit.
[2024-05-29 11:15:20] [INFO ] [Real]Absence check using 1101 positive place invariants in 243 ms returned sat
[2024-05-29 11:15:21] [INFO ] After 2445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 11:15:22] [INFO ] [Nat]Absence check using 1101 positive place invariants in 238 ms returned sat
[2024-05-29 11:15:24] [INFO ] After 1558ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 11:15:24] [INFO ] Deduced a trap composed of 17 places in 239 ms of which 1 ms to minimize.
[2024-05-29 11:15:24] [INFO ] Deduced a trap composed of 22 places in 243 ms of which 1 ms to minimize.
[2024-05-29 11:15:25] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 1 ms to minimize.
[2024-05-29 11:15:25] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 1 ms to minimize.
[2024-05-29 11:15:25] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 1 ms to minimize.
[2024-05-29 11:15:26] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 1 ms to minimize.
[2024-05-29 11:15:26] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 0 ms to minimize.
[2024-05-29 11:15:26] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 1 ms to minimize.
[2024-05-29 11:15:26] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 0 ms to minimize.
[2024-05-29 11:15:26] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 0 ms to minimize.
[2024-05-29 11:15:27] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 0 ms to minimize.
[2024-05-29 11:15:27] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-05-29 11:15:27] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 0 ms to minimize.
[2024-05-29 11:15:27] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3170 ms
[2024-05-29 11:15:27] [INFO ] After 4793ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2024-05-29 11:15:27] [INFO ] After 5742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 42 ms.
Support contains 1 out of 3100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Partial Free-agglomeration rule applied 597 times.
Drop transitions removed 597 transitions
Iterating global reduction 0 with 597 rules applied. Total rules applied 597 place count 3100 transition count 2600
Applied a total of 597 rules in 247 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 133362 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133362 steps, saw 132369 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2600 rows 3100 cols
[2024-05-29 11:15:31] [INFO ] Computed 1101 invariants in 26 ms
[2024-05-29 11:15:31] [INFO ] [Real]Absence check using 1101 positive place invariants in 215 ms returned sat
[2024-05-29 11:15:33] [INFO ] After 2269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 11:15:34] [INFO ] [Nat]Absence check using 1101 positive place invariants in 229 ms returned sat
[2024-05-29 11:15:35] [INFO ] After 1545ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 11:15:36] [INFO ] Deduced a trap composed of 17 places in 379 ms of which 1 ms to minimize.
[2024-05-29 11:15:36] [INFO ] Deduced a trap composed of 17 places in 373 ms of which 1 ms to minimize.
[2024-05-29 11:15:37] [INFO ] Deduced a trap composed of 19 places in 371 ms of which 1 ms to minimize.
[2024-05-29 11:15:37] [INFO ] Deduced a trap composed of 17 places in 292 ms of which 1 ms to minimize.
[2024-05-29 11:15:37] [INFO ] Deduced a trap composed of 17 places in 291 ms of which 1 ms to minimize.
[2024-05-29 11:15:38] [INFO ] Deduced a trap composed of 17 places in 283 ms of which 1 ms to minimize.
[2024-05-29 11:15:38] [INFO ] Deduced a trap composed of 28 places in 256 ms of which 1 ms to minimize.
[2024-05-29 11:15:39] [INFO ] Deduced a trap composed of 17 places in 272 ms of which 0 ms to minimize.
[2024-05-29 11:15:39] [INFO ] Deduced a trap composed of 17 places in 279 ms of which 1 ms to minimize.
[2024-05-29 11:15:39] [INFO ] Deduced a trap composed of 17 places in 240 ms of which 1 ms to minimize.
[2024-05-29 11:15:40] [INFO ] Deduced a trap composed of 17 places in 235 ms of which 1 ms to minimize.
[2024-05-29 11:15:40] [INFO ] Deduced a trap composed of 17 places in 239 ms of which 1 ms to minimize.
[2024-05-29 11:15:40] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 1 ms to minimize.
[2024-05-29 11:15:41] [INFO ] Deduced a trap composed of 17 places in 215 ms of which 1 ms to minimize.
[2024-05-29 11:15:41] [INFO ] Deduced a trap composed of 39 places in 201 ms of which 1 ms to minimize.
[2024-05-29 11:15:41] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 1 ms to minimize.
[2024-05-29 11:15:41] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 0 ms to minimize.
[2024-05-29 11:15:42] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 1 ms to minimize.
[2024-05-29 11:15:42] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 0 ms to minimize.
[2024-05-29 11:15:42] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 0 ms to minimize.
[2024-05-29 11:15:42] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2024-05-29 11:15:42] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 0 ms to minimize.
[2024-05-29 11:15:42] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 0 ms to minimize.
[2024-05-29 11:15:43] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2024-05-29 11:15:43] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 7348 ms
[2024-05-29 11:15:43] [INFO ] After 8958ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2024-05-29 11:15:43] [INFO ] After 9837ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 36 ms.
Support contains 1 out of 3100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 138 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 124 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-29 11:15:43] [INFO ] Invariant cache hit.
[2024-05-29 11:15:45] [INFO ] Implicit Places using invariants in 2123 ms returned []
[2024-05-29 11:15:45] [INFO ] Invariant cache hit.
[2024-05-29 11:15:47] [INFO ] Implicit Places using invariants and state equation in 2196 ms returned []
Implicit Place search using SMT with State Equation took 4322 ms to find 0 implicit places.
[2024-05-29 11:15:48] [INFO ] Redundant transitions in 73 ms returned []
[2024-05-29 11:15:48] [INFO ] Invariant cache hit.
[2024-05-29 11:15:49] [INFO ] Dead Transitions using invariants and state equation in 1797 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6326 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 122 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 11:15:49] [INFO ] Invariant cache hit.
[2024-05-29 11:15:50] [INFO ] [Real]Absence check using 1101 positive place invariants in 219 ms returned sat
[2024-05-29 11:15:52] [INFO ] After 2312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 11:15:53] [INFO ] [Nat]Absence check using 1101 positive place invariants in 237 ms returned sat
[2024-05-29 11:15:54] [INFO ] After 1541ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 11:15:54] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 1 ms to minimize.
[2024-05-29 11:15:55] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 0 ms to minimize.
[2024-05-29 11:15:55] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 0 ms to minimize.
[2024-05-29 11:15:55] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 0 ms to minimize.
[2024-05-29 11:15:55] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 0 ms to minimize.
[2024-05-29 11:15:56] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 0 ms to minimize.
[2024-05-29 11:15:56] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 0 ms to minimize.
[2024-05-29 11:15:56] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 1 ms to minimize.
[2024-05-29 11:15:56] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 0 ms to minimize.
[2024-05-29 11:15:56] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 2 ms to minimize.
[2024-05-29 11:15:57] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 1 ms to minimize.
[2024-05-29 11:15:57] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 0 ms to minimize.
[2024-05-29 11:15:57] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 0 ms to minimize.
[2024-05-29 11:15:57] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-05-29 11:15:57] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-05-29 11:15:57] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-29 11:15:58] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 0 ms to minimize.
[2024-05-29 11:15:58] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3579 ms
[2024-05-29 11:15:58] [INFO ] After 5185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2024-05-29 11:15:58] [INFO ] After 6059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 1 out of 3100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 151 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
// Phase 1: matrix 2600 rows 3100 cols
[2024-05-29 11:15:58] [INFO ] Computed 1101 invariants in 11 ms
[2024-05-29 11:16:00] [INFO ] Implicit Places using invariants in 1899 ms returned []
[2024-05-29 11:16:00] [INFO ] Invariant cache hit.
[2024-05-29 11:16:02] [INFO ] Implicit Places using invariants and state equation in 2013 ms returned []
Implicit Place search using SMT with State Equation took 3913 ms to find 0 implicit places.
[2024-05-29 11:16:02] [INFO ] Redundant transitions in 69 ms returned []
[2024-05-29 11:16:02] [INFO ] Invariant cache hit.
[2024-05-29 11:16:04] [INFO ] Dead Transitions using invariants and state equation in 1829 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5972 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 84423 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84423 steps, saw 76618 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 11:16:08] [INFO ] Invariant cache hit.
[2024-05-29 11:16:08] [INFO ] [Real]Absence check using 1101 positive place invariants in 240 ms returned sat
[2024-05-29 11:16:10] [INFO ] After 2449ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 11:16:11] [INFO ] [Nat]Absence check using 1101 positive place invariants in 251 ms returned sat
[2024-05-29 11:16:12] [INFO ] After 1596ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 11:16:13] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 1 ms to minimize.
[2024-05-29 11:16:13] [INFO ] Deduced a trap composed of 22 places in 256 ms of which 1 ms to minimize.
[2024-05-29 11:16:13] [INFO ] Deduced a trap composed of 17 places in 222 ms of which 1 ms to minimize.
[2024-05-29 11:16:14] [INFO ] Deduced a trap composed of 19 places in 259 ms of which 1 ms to minimize.
[2024-05-29 11:16:14] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 1 ms to minimize.
[2024-05-29 11:16:14] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 1 ms to minimize.
[2024-05-29 11:16:14] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 0 ms to minimize.
[2024-05-29 11:16:15] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 0 ms to minimize.
[2024-05-29 11:16:15] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 2 ms to minimize.
[2024-05-29 11:16:15] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 1 ms to minimize.
[2024-05-29 11:16:15] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
[2024-05-29 11:16:15] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 0 ms to minimize.
[2024-05-29 11:16:16] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 0 ms to minimize.
[2024-05-29 11:16:16] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3234 ms
[2024-05-29 11:16:16] [INFO ] After 4895ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2024-05-29 11:16:16] [INFO ] After 5843ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 73 ms.
Support contains 1 out of 3100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Partial Free-agglomeration rule applied 597 times.
Drop transitions removed 597 transitions
Iterating global reduction 0 with 597 rules applied. Total rules applied 597 place count 3100 transition count 2600
Applied a total of 597 rules in 250 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 133180 steps, run timeout after 3004 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133180 steps, saw 132188 distinct states, run finished after 3004 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2600 rows 3100 cols
[2024-05-29 11:16:20] [INFO ] Computed 1101 invariants in 30 ms
[2024-05-29 11:16:20] [INFO ] [Real]Absence check using 1101 positive place invariants in 232 ms returned sat
[2024-05-29 11:16:22] [INFO ] After 2295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 11:16:23] [INFO ] [Nat]Absence check using 1101 positive place invariants in 264 ms returned sat
[2024-05-29 11:16:24] [INFO ] After 1721ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 11:16:25] [INFO ] Deduced a trap composed of 17 places in 390 ms of which 0 ms to minimize.
[2024-05-29 11:16:25] [INFO ] Deduced a trap composed of 17 places in 392 ms of which 2 ms to minimize.
[2024-05-29 11:16:26] [INFO ] Deduced a trap composed of 19 places in 397 ms of which 2 ms to minimize.
[2024-05-29 11:16:26] [INFO ] Deduced a trap composed of 17 places in 382 ms of which 1 ms to minimize.
[2024-05-29 11:16:27] [INFO ] Deduced a trap composed of 17 places in 329 ms of which 1 ms to minimize.
[2024-05-29 11:16:27] [INFO ] Deduced a trap composed of 17 places in 303 ms of which 1 ms to minimize.
[2024-05-29 11:16:28] [INFO ] Deduced a trap composed of 28 places in 286 ms of which 0 ms to minimize.
[2024-05-29 11:16:28] [INFO ] Deduced a trap composed of 17 places in 297 ms of which 1 ms to minimize.
[2024-05-29 11:16:28] [INFO ] Deduced a trap composed of 17 places in 277 ms of which 1 ms to minimize.
[2024-05-29 11:16:29] [INFO ] Deduced a trap composed of 17 places in 268 ms of which 0 ms to minimize.
[2024-05-29 11:16:29] [INFO ] Deduced a trap composed of 17 places in 257 ms of which 1 ms to minimize.
[2024-05-29 11:16:29] [INFO ] Deduced a trap composed of 17 places in 251 ms of which 1 ms to minimize.
[2024-05-29 11:16:30] [INFO ] Deduced a trap composed of 23 places in 249 ms of which 1 ms to minimize.
[2024-05-29 11:16:30] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 0 ms to minimize.
[2024-05-29 11:16:30] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 1 ms to minimize.
[2024-05-29 11:16:30] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 1 ms to minimize.
[2024-05-29 11:16:31] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 0 ms to minimize.
[2024-05-29 11:16:31] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 1 ms to minimize.
[2024-05-29 11:16:31] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 4 ms to minimize.
[2024-05-29 11:16:31] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 0 ms to minimize.
[2024-05-29 11:16:32] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2024-05-29 11:16:32] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 0 ms to minimize.
[2024-05-29 11:16:32] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2024-05-29 11:16:32] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-29 11:16:32] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 7780 ms
[2024-05-29 11:16:32] [INFO ] After 9567ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 98 ms.
[2024-05-29 11:16:32] [INFO ] After 10527ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 37 ms.
Support contains 1 out of 3100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 118 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 117 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-29 11:16:33] [INFO ] Invariant cache hit.
[2024-05-29 11:16:35] [INFO ] Implicit Places using invariants in 2259 ms returned []
[2024-05-29 11:16:35] [INFO ] Invariant cache hit.
[2024-05-29 11:16:37] [INFO ] Implicit Places using invariants and state equation in 2290 ms returned []
Implicit Place search using SMT with State Equation took 4551 ms to find 0 implicit places.
[2024-05-29 11:16:37] [INFO ] Redundant transitions in 73 ms returned []
[2024-05-29 11:16:37] [INFO ] Invariant cache hit.
[2024-05-29 11:16:39] [INFO ] Dead Transitions using invariants and state equation in 1847 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6593 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 117 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 11:16:39] [INFO ] Invariant cache hit.
[2024-05-29 11:16:40] [INFO ] [Real]Absence check using 1101 positive place invariants in 243 ms returned sat
[2024-05-29 11:16:42] [INFO ] After 2380ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 11:16:42] [INFO ] [Nat]Absence check using 1101 positive place invariants in 241 ms returned sat
[2024-05-29 11:16:44] [INFO ] After 1594ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 11:16:44] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 0 ms to minimize.
[2024-05-29 11:16:45] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 1 ms to minimize.
[2024-05-29 11:16:45] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 0 ms to minimize.
[2024-05-29 11:16:45] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 1 ms to minimize.
[2024-05-29 11:16:45] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 0 ms to minimize.
[2024-05-29 11:16:45] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 0 ms to minimize.
[2024-05-29 11:16:46] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 0 ms to minimize.
[2024-05-29 11:16:46] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 0 ms to minimize.
[2024-05-29 11:16:46] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 0 ms to minimize.
[2024-05-29 11:16:46] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 0 ms to minimize.
[2024-05-29 11:16:47] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 0 ms to minimize.
[2024-05-29 11:16:47] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 0 ms to minimize.
[2024-05-29 11:16:47] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 1 ms to minimize.
[2024-05-29 11:16:47] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2024-05-29 11:16:47] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 0 ms to minimize.
[2024-05-29 11:16:47] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2024-05-29 11:16:48] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 0 ms to minimize.
[2024-05-29 11:16:48] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3656 ms
[2024-05-29 11:16:48] [INFO ] After 5320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2024-05-29 11:16:48] [INFO ] After 6209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15 reset in 1823 ms.
Product exploration explored 100000 steps with 15 reset in 2340 ms.
Built C files in :
/tmp/ltsmin6249151594693048379
[2024-05-29 11:16:52] [INFO ] Too many transitions (2600) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:16:52] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6249151594693048379
Running compilation step : cd /tmp/ltsmin6249151594693048379;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin6249151594693048379;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin6249151594693048379;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 3100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 140 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
// Phase 1: matrix 2600 rows 3100 cols
[2024-05-29 11:16:55] [INFO ] Computed 1101 invariants in 11 ms
[2024-05-29 11:16:57] [INFO ] Implicit Places using invariants in 1769 ms returned []
[2024-05-29 11:16:57] [INFO ] Invariant cache hit.
[2024-05-29 11:16:59] [INFO ] Implicit Places using invariants and state equation in 1860 ms returned []
Implicit Place search using SMT with State Equation took 3636 ms to find 0 implicit places.
[2024-05-29 11:16:59] [INFO ] Redundant transitions in 69 ms returned []
[2024-05-29 11:16:59] [INFO ] Invariant cache hit.
[2024-05-29 11:17:01] [INFO ] Dead Transitions using invariants and state equation in 1842 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5696 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Built C files in :
/tmp/ltsmin2466907528010028102
[2024-05-29 11:17:01] [INFO ] Too many transitions (2600) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:17:01] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2466907528010028102
Running compilation step : cd /tmp/ltsmin2466907528010028102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2466907528010028102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2466907528010028102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 11:17:04] [INFO ] Flatten gal took : 65 ms
[2024-05-29 11:17:04] [INFO ] Flatten gal took : 66 ms
[2024-05-29 11:17:04] [INFO ] Time to serialize gal into /tmp/LTL9730300618646432746.gal : 11 ms
[2024-05-29 11:17:04] [INFO ] Time to serialize properties into /tmp/LTL1765854275525324142.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9730300618646432746.gal' '-t' 'CGAL' '-hoa' '/tmp/aut470382717021089990.hoa' '-atoms' '/tmp/LTL1765854275525324142.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL1765854275525324142.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut470382717021089990.hoa
Detected timeout of ITS tools.
[2024-05-29 11:17:19] [INFO ] Flatten gal took : 66 ms
[2024-05-29 11:17:19] [INFO ] Flatten gal took : 67 ms
[2024-05-29 11:17:19] [INFO ] Time to serialize gal into /tmp/LTL8306864744993962087.gal : 10 ms
[2024-05-29 11:17:19] [INFO ] Time to serialize properties into /tmp/LTL4592227472917928610.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8306864744993962087.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4592227472917928610.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(p621==0)"))))
Formula 0 simplified : GF!"(p621==0)"
Detected timeout of ITS tools.
[2024-05-29 11:17:35] [INFO ] Flatten gal took : 67 ms
[2024-05-29 11:17:35] [INFO ] Applying decomposition
[2024-05-29 11:17:35] [INFO ] Flatten gal took : 68 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17587062068976626677.txt' '-o' '/tmp/graph17587062068976626677.bin' '-w' '/tmp/graph17587062068976626677.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17587062068976626677.bin' '-l' '-1' '-v' '-w' '/tmp/graph17587062068976626677.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:17:35] [INFO ] Decomposing Gal with order
[2024-05-29 11:17:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:17:35] [INFO ] Removed a total of 600 redundant transitions.
[2024-05-29 11:17:35] [INFO ] Flatten gal took : 95 ms
[2024-05-29 11:17:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 16 ms.
[2024-05-29 11:17:35] [INFO ] Time to serialize gal into /tmp/LTL8016360550152022941.gal : 21 ms
[2024-05-29 11:17:35] [INFO ] Time to serialize properties into /tmp/LTL4755871909544765828.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8016360550152022941.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4755871909544765828.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("(i11.i0.i3.u220.p621==0)"))))
Formula 0 simplified : GF!"(i11.i0.i3.u220.p621==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4844905880615992711
[2024-05-29 11:17:50] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4844905880615992711
Running compilation step : cd /tmp/ltsmin4844905880615992711;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4844905880615992711;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4844905880615992711;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPs-PT-100A-LTLFireability-07 finished in 168793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 127 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2024-05-29 11:17:53] [INFO ] Computed 1101 invariants in 9 ms
[2024-05-29 11:17:55] [INFO ] Implicit Places using invariants in 1861 ms returned []
[2024-05-29 11:17:55] [INFO ] Invariant cache hit.
[2024-05-29 11:17:57] [INFO ] Implicit Places using invariants and state equation in 1809 ms returned []
Implicit Place search using SMT with State Equation took 3683 ms to find 0 implicit places.
[2024-05-29 11:17:57] [INFO ] Invariant cache hit.
[2024-05-29 11:17:59] [INFO ] Dead Transitions using invariants and state equation in 1769 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5590 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s876 1) (EQ s897 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-100A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLFireability-08 finished in 5713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0))||(F(!p0)&&F(G(p1)))))'
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 252 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2024-05-29 11:17:59] [INFO ] Computed 1101 invariants in 11 ms
[2024-05-29 11:18:01] [INFO ] Implicit Places using invariants in 1837 ms returned []
[2024-05-29 11:18:01] [INFO ] Invariant cache hit.
[2024-05-29 11:18:03] [INFO ] Implicit Places using invariants and state equation in 1693 ms returned []
Implicit Place search using SMT with State Equation took 3531 ms to find 0 implicit places.
[2024-05-29 11:18:03] [INFO ] Redundant transitions in 73 ms returned []
[2024-05-29 11:18:03] [INFO ] Invariant cache hit.
[2024-05-29 11:18:05] [INFO ] Dead Transitions using invariants and state equation in 1809 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5672 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Stuttering acceptance computed with spot in 141 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1258 1) (EQ s1269 1)), p1:(NEQ s2192 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 15 reset in 1925 ms.
Product exploration explored 100000 steps with 15 reset in 2326 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 96 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 72763 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72763 steps, saw 65996 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 11:18:13] [INFO ] Invariant cache hit.
[2024-05-29 11:18:14] [INFO ] [Real]Absence check using 1101 positive place invariants in 270 ms returned sat
[2024-05-29 11:18:16] [INFO ] After 2831ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 11:18:17] [INFO ] [Nat]Absence check using 1101 positive place invariants in 247 ms returned sat
[2024-05-29 11:18:36] [INFO ] After 20395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 0 with 896 rules applied. Total rules applied 896 place count 3101 transition count 2601
Applied a total of 896 rules in 293 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 293 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Finished probabilistic random walk after 52044 steps, run visited all 2 properties in 1512 ms. (steps per millisecond=34 )
Probabilistic random walk after 52044 steps, saw 51347 distinct states, run finished after 1515 ms. (steps per millisecond=34 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND p1 p0))]
Knowledge based reduction with 7 factoid took 156 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 177 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2024-05-29 11:18:39] [INFO ] Invariant cache hit.
[2024-05-29 11:18:41] [INFO ] Implicit Places using invariants in 1886 ms returned []
[2024-05-29 11:18:41] [INFO ] Invariant cache hit.
[2024-05-29 11:18:43] [INFO ] Implicit Places using invariants and state equation in 1851 ms returned []
Implicit Place search using SMT with State Equation took 3740 ms to find 0 implicit places.
[2024-05-29 11:18:43] [INFO ] Redundant transitions in 67 ms returned []
[2024-05-29 11:18:43] [INFO ] Invariant cache hit.
[2024-05-29 11:18:45] [INFO ] Dead Transitions using invariants and state equation in 1810 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5799 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 110 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 71635 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71635 steps, saw 64948 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 11:18:48] [INFO ] Invariant cache hit.
[2024-05-29 11:18:49] [INFO ] [Real]Absence check using 1101 positive place invariants in 241 ms returned sat
[2024-05-29 11:18:51] [INFO ] After 2908ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 11:18:52] [INFO ] [Nat]Absence check using 1101 positive place invariants in 250 ms returned sat
[2024-05-29 11:19:12] [INFO ] After 20448ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 0 with 896 rules applied. Total rules applied 896 place count 3101 transition count 2601
Applied a total of 896 rules in 275 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 275 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Finished probabilistic random walk after 52044 steps, run visited all 2 properties in 1784 ms. (steps per millisecond=29 )
Probabilistic random walk after 52044 steps, saw 51347 distinct states, run finished after 1786 ms. (steps per millisecond=29 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 113 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 14 reset in 2115 ms.
Product exploration explored 100000 steps with 15 reset in 2453 ms.
Built C files in :
/tmp/ltsmin1355742532549448789
[2024-05-29 11:19:19] [INFO ] Too many transitions (2601) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:19:19] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1355742532549448789
Running compilation step : cd /tmp/ltsmin1355742532549448789;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1355742532549448789;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1355742532549448789;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 177 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2024-05-29 11:19:22] [INFO ] Invariant cache hit.
[2024-05-29 11:19:24] [INFO ] Implicit Places using invariants in 1859 ms returned []
[2024-05-29 11:19:24] [INFO ] Invariant cache hit.
[2024-05-29 11:19:26] [INFO ] Implicit Places using invariants and state equation in 1707 ms returned []
Implicit Place search using SMT with State Equation took 3570 ms to find 0 implicit places.
[2024-05-29 11:19:26] [INFO ] Redundant transitions in 70 ms returned []
[2024-05-29 11:19:26] [INFO ] Invariant cache hit.
[2024-05-29 11:19:28] [INFO ] Dead Transitions using invariants and state equation in 1725 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5545 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Built C files in :
/tmp/ltsmin3920455771442045733
[2024-05-29 11:19:28] [INFO ] Too many transitions (2601) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:19:28] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3920455771442045733
Running compilation step : cd /tmp/ltsmin3920455771442045733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3920455771442045733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3920455771442045733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 11:19:31] [INFO ] Flatten gal took : 110 ms
[2024-05-29 11:19:31] [INFO ] Flatten gal took : 134 ms
[2024-05-29 11:19:31] [INFO ] Time to serialize gal into /tmp/LTL9465893286981441694.gal : 10 ms
[2024-05-29 11:19:31] [INFO ] Time to serialize properties into /tmp/LTL1733089150334794700.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9465893286981441694.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13797106085646722351.hoa' '-atoms' '/tmp/LTL1733089150334794700.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1733089150334794700.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13797106085646722351.hoa
Detected timeout of ITS tools.
[2024-05-29 11:19:46] [INFO ] Flatten gal took : 119 ms
[2024-05-29 11:19:47] [INFO ] Flatten gal took : 140 ms
[2024-05-29 11:19:47] [INFO ] Time to serialize gal into /tmp/LTL8374842137451591261.gal : 11 ms
[2024-05-29 11:19:47] [INFO ] Time to serialize properties into /tmp/LTL4671336513281716297.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8374842137451591261.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4671336513281716297.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G(F("((p1258==0)||(p1269==0))")))||((F("((p1258==0)||(p1269==0))"))&&(F(G("(p2192==0)"))))))
Formula 0 simplified : FG!"((p1258==0)||(p1269==0))" & (G!"((p1258==0)||(p1269==0))" | GF!"(p2192==0)")
Detected timeout of ITS tools.
[2024-05-29 11:20:02] [INFO ] Flatten gal took : 112 ms
[2024-05-29 11:20:02] [INFO ] Applying decomposition
[2024-05-29 11:20:02] [INFO ] Flatten gal took : 111 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph18423609912356407597.txt' '-o' '/tmp/graph18423609912356407597.bin' '-w' '/tmp/graph18423609912356407597.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18423609912356407597.bin' '-l' '-1' '-v' '-w' '/tmp/graph18423609912356407597.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:20:02] [INFO ] Decomposing Gal with order
[2024-05-29 11:20:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:20:02] [INFO ] Removed a total of 600 redundant transitions.
[2024-05-29 11:20:02] [INFO ] Flatten gal took : 107 ms
[2024-05-29 11:20:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 139 ms.
[2024-05-29 11:20:03] [INFO ] Time to serialize gal into /tmp/LTL6338544994860033850.gal : 26 ms
[2024-05-29 11:20:03] [INFO ] Time to serialize properties into /tmp/LTL10628990450843641824.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6338544994860033850.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10628990450843641824.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G(F("((i22.i1.i2.u447.p1258==0)||(i22.i1.i2.u450.p1269==0))")))||((F("((i22.i1.i2.u447.p1258==0)||(i22.i1.i2.u450.p1269==0))"))&&(...192
Formula 0 simplified : FG!"((i22.i1.i2.u447.p1258==0)||(i22.i1.i2.u450.p1269==0))" & (G!"((i22.i1.i2.u447.p1258==0)||(i22.i1.i2.u450.p1269==0))" | GF!"(i39...178
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2511827588183948960
[2024-05-29 11:20:18] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2511827588183948960
Running compilation step : cd /tmp/ltsmin2511827588183948960;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2511827588183948960;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2511827588183948960;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPs-PT-100A-LTLFireability-10 finished in 141689 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)||G(p2)))))'
Support contains 6 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 276 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
[2024-05-29 11:20:21] [INFO ] Invariant cache hit.
[2024-05-29 11:20:23] [INFO ] Implicit Places using invariants in 1894 ms returned []
[2024-05-29 11:20:23] [INFO ] Invariant cache hit.
[2024-05-29 11:20:25] [INFO ] Implicit Places using invariants and state equation in 1948 ms returned []
Implicit Place search using SMT with State Equation took 3844 ms to find 0 implicit places.
[2024-05-29 11:20:25] [INFO ] Redundant transitions in 70 ms returned []
[2024-05-29 11:20:25] [INFO ] Invariant cache hit.
[2024-05-29 11:20:27] [INFO ] Dead Transitions using invariants and state equation in 1866 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6060 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s159 1) (EQ s180 1)), p0:(AND (EQ s2083 1) (EQ s2099 1)), p2:(AND (EQ s499 1) (EQ s526 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 10890 steps with 2 reset in 205 ms.
FORMULA ShieldPPPs-PT-100A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLFireability-11 finished in 6436 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!X((G(p0) U p1)) U p2))'
Support contains 6 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 167 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2024-05-29 11:20:27] [INFO ] Computed 1101 invariants in 10 ms
[2024-05-29 11:20:29] [INFO ] Implicit Places using invariants in 1935 ms returned []
[2024-05-29 11:20:29] [INFO ] Invariant cache hit.
[2024-05-29 11:20:31] [INFO ] Implicit Places using invariants and state equation in 1908 ms returned []
Implicit Place search using SMT with State Equation took 3846 ms to find 0 implicit places.
[2024-05-29 11:20:31] [INFO ] Invariant cache hit.
[2024-05-29 11:20:33] [INFO ] Dead Transitions using invariants and state equation in 1857 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5871 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND p0 p1), true, p0, (NOT p2), (OR (NOT p2) p1)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=p1, acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (EQ s415 1) (EQ s417 1)), p1:(AND (EQ s51 1) (EQ s72 1)), p2:(AND (EQ s2484 1) (EQ s2505 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 94 reset in 1669 ms.
Product exploration explored 100000 steps with 93 reset in 2114 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT p1)), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 205 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 249 ms :[true, p0, (OR (NOT p2) p1), (AND p0 p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-29 11:20:39] [INFO ] Invariant cache hit.
[2024-05-29 11:20:40] [INFO ] [Real]Absence check using 1101 positive place invariants in 250 ms returned sat
[2024-05-29 11:20:42] [INFO ] After 2657ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2024-05-29 11:20:43] [INFO ] After 2919ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 11:20:43] [INFO ] After 4129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 11:20:44] [INFO ] [Nat]Absence check using 1101 positive place invariants in 248 ms returned sat
[2024-05-29 11:21:08] [INFO ] After 23842ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 11:21:08] [INFO ] After 23843ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-29 11:21:08] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 97 ms.
Support contains 6 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 893 times.
Drop transitions removed 893 transitions
Iterating global reduction 0 with 893 rules applied. Total rules applied 897 place count 3101 transition count 2601
Applied a total of 897 rules in 396 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 396 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 88474 steps, run timeout after 3005 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88474 steps, saw 87601 distinct states, run finished after 3005 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2024-05-29 11:21:12] [INFO ] Computed 1101 invariants in 34 ms
[2024-05-29 11:21:13] [INFO ] [Real]Absence check using 1045 positive place invariants in 240 ms returned sat
[2024-05-29 11:21:13] [INFO ] [Real]Absence check using 1045 positive and 56 generalized place invariants in 14 ms returned sat
[2024-05-29 11:21:17] [INFO ] After 4371ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 11:21:18] [INFO ] [Nat]Absence check using 1045 positive place invariants in 233 ms returned sat
[2024-05-29 11:21:18] [INFO ] [Nat]Absence check using 1045 positive and 56 generalized place invariants in 14 ms returned sat
[2024-05-29 11:21:42] [INFO ] After 23899ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 11:21:42] [INFO ] After 23909ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-29 11:21:42] [INFO ] After 25054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 211 ms.
Support contains 6 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 139 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 140 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2024-05-29 11:21:42] [INFO ] Invariant cache hit.
[2024-05-29 11:21:44] [INFO ] Implicit Places using invariants in 2299 ms returned []
[2024-05-29 11:21:44] [INFO ] Invariant cache hit.
[2024-05-29 11:21:47] [INFO ] Implicit Places using invariants and state equation in 2140 ms returned []
Implicit Place search using SMT with State Equation took 4445 ms to find 0 implicit places.
[2024-05-29 11:21:47] [INFO ] Redundant transitions in 70 ms returned []
[2024-05-29 11:21:47] [INFO ] Invariant cache hit.
[2024-05-29 11:21:49] [INFO ] Dead Transitions using invariants and state equation in 1811 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6472 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 169 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 5 properties.
[2024-05-29 11:21:49] [INFO ] Invariant cache hit.
[2024-05-29 11:21:50] [INFO ] [Real]Absence check using 1045 positive place invariants in 232 ms returned sat
[2024-05-29 11:21:50] [INFO ] [Real]Absence check using 1045 positive and 56 generalized place invariants in 13 ms returned sat
[2024-05-29 11:21:53] [INFO ] After 4710ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 11:21:54] [INFO ] [Nat]Absence check using 1045 positive place invariants in 233 ms returned sat
[2024-05-29 11:21:54] [INFO ] [Nat]Absence check using 1045 positive and 56 generalized place invariants in 13 ms returned sat
[2024-05-29 11:22:42] [INFO ] After 47126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 11:23:00] [INFO ] After 65311ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-29 11:23:00] [INFO ] After 66476ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT p1)), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2 (NOT p0)))]
Knowledge based reduction with 10 factoid took 177 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 299 ms :[true, p0, (OR (NOT p2) p1), (AND p0 p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 267 ms :[true, p0, (OR (NOT p2) p1), (AND p0 p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
// Phase 1: matrix 2603 rows 3103 cols
[2024-05-29 11:23:01] [INFO ] Computed 1101 invariants in 10 ms
[2024-05-29 11:23:07] [INFO ] [Real]Absence check using 1101 positive place invariants in 2373 ms returned sat
[2024-05-29 11:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:23:16] [INFO ] [Real]Absence check using state equation in 8387 ms returned unknown
Could not prove EG (NOT p2)
Support contains 6 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 300 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2024-05-29 11:23:16] [INFO ] Computed 1101 invariants in 8 ms
[2024-05-29 11:23:18] [INFO ] Implicit Places using invariants in 1914 ms returned []
[2024-05-29 11:23:18] [INFO ] Invariant cache hit.
[2024-05-29 11:23:20] [INFO ] Implicit Places using invariants and state equation in 1891 ms returned []
Implicit Place search using SMT with State Equation took 3806 ms to find 0 implicit places.
[2024-05-29 11:23:20] [INFO ] Redundant transitions in 69 ms returned []
[2024-05-29 11:23:20] [INFO ] Invariant cache hit.
[2024-05-29 11:23:22] [INFO ] Dead Transitions using invariants and state equation in 1775 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5956 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 104 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 317 ms :[true, p0, (OR (NOT p2) p1), (AND p0 p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-29 11:23:23] [INFO ] Invariant cache hit.
[2024-05-29 11:23:24] [INFO ] [Real]Absence check using 1101 positive place invariants in 255 ms returned sat
[2024-05-29 11:23:27] [INFO ] After 2464ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2024-05-29 11:23:27] [INFO ] After 2731ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 11:23:27] [INFO ] After 3911ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 11:23:28] [INFO ] [Nat]Absence check using 1101 positive place invariants in 247 ms returned sat
[2024-05-29 11:23:52] [INFO ] After 23841ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 11:23:52] [INFO ] After 23841ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-29 11:23:52] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 458 ms.
Support contains 6 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 893 times.
Drop transitions removed 893 transitions
Iterating global reduction 0 with 893 rules applied. Total rules applied 893 place count 3101 transition count 2601
Applied a total of 893 rules in 281 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 84170 steps, run timeout after 3002 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84170 steps, saw 83315 distinct states, run finished after 3003 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2024-05-29 11:23:57] [INFO ] Computed 1101 invariants in 30 ms
[2024-05-29 11:23:58] [INFO ] [Real]Absence check using 1045 positive place invariants in 239 ms returned sat
[2024-05-29 11:23:58] [INFO ] [Real]Absence check using 1045 positive and 56 generalized place invariants in 13 ms returned sat
[2024-05-29 11:24:01] [INFO ] After 4402ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 11:24:02] [INFO ] [Nat]Absence check using 1045 positive place invariants in 229 ms returned sat
[2024-05-29 11:24:02] [INFO ] [Nat]Absence check using 1045 positive and 56 generalized place invariants in 13 ms returned sat
[2024-05-29 11:24:26] [INFO ] After 23906ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 11:24:26] [INFO ] After 23910ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-29 11:24:26] [INFO ] After 25050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 161 ms.
Support contains 6 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 157 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 144 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2024-05-29 11:24:27] [INFO ] Invariant cache hit.
[2024-05-29 11:24:29] [INFO ] Implicit Places using invariants in 2357 ms returned []
[2024-05-29 11:24:29] [INFO ] Invariant cache hit.
[2024-05-29 11:24:31] [INFO ] Implicit Places using invariants and state equation in 2267 ms returned []
Implicit Place search using SMT with State Equation took 4626 ms to find 0 implicit places.
[2024-05-29 11:24:32] [INFO ] Redundant transitions in 73 ms returned []
[2024-05-29 11:24:32] [INFO ] Invariant cache hit.
[2024-05-29 11:24:33] [INFO ] Dead Transitions using invariants and state equation in 1847 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6698 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 153 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 5 properties.
[2024-05-29 11:24:34] [INFO ] Invariant cache hit.
[2024-05-29 11:24:35] [INFO ] [Real]Absence check using 1045 positive place invariants in 238 ms returned sat
[2024-05-29 11:24:35] [INFO ] [Real]Absence check using 1045 positive and 56 generalized place invariants in 14 ms returned sat
[2024-05-29 11:24:38] [INFO ] After 4802ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 11:24:39] [INFO ] [Nat]Absence check using 1045 positive place invariants in 235 ms returned sat
[2024-05-29 11:24:39] [INFO ] [Nat]Absence check using 1045 positive and 56 generalized place invariants in 13 ms returned sat
[2024-05-29 11:25:33] [INFO ] After 53796ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 11:25:51] [INFO ] After 71869ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-29 11:25:51] [INFO ] After 73064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2 (NOT p0)))]
Knowledge based reduction with 12 factoid took 173 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 239 ms :[true, p0, (OR (NOT p2) p1), (AND p0 p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 1149 ms :[true, p0, (OR (NOT p2) p1), (AND p0 p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
// Phase 1: matrix 2601 rows 3101 cols
[2024-05-29 11:25:53] [INFO ] Computed 1101 invariants in 5 ms
[2024-05-29 11:25:59] [INFO ] [Real]Absence check using 1101 positive place invariants in 2169 ms returned sat
[2024-05-29 11:25:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:26:08] [INFO ] [Real]Absence check using state equation in 8627 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 240 ms :[true, p0, (OR (NOT p2) p1), (AND p0 p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Product exploration explored 100000 steps with 95 reset in 1801 ms.
Product exploration explored 100000 steps with 95 reset in 2243 ms.
Built C files in :
/tmp/ltsmin13356304855407808741
[2024-05-29 11:26:12] [INFO ] Too many transitions (2601) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:26:12] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13356304855407808741
Running compilation step : cd /tmp/ltsmin13356304855407808741;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13356304855407808741;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13356304855407808741;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 149 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2024-05-29 11:26:16] [INFO ] Invariant cache hit.
[2024-05-29 11:26:17] [INFO ] Implicit Places using invariants in 1924 ms returned []
[2024-05-29 11:26:17] [INFO ] Invariant cache hit.
[2024-05-29 11:26:19] [INFO ] Implicit Places using invariants and state equation in 1919 ms returned []
Implicit Place search using SMT with State Equation took 3843 ms to find 0 implicit places.
[2024-05-29 11:26:19] [INFO ] Redundant transitions in 72 ms returned []
[2024-05-29 11:26:19] [INFO ] Invariant cache hit.
[2024-05-29 11:26:21] [INFO ] Dead Transitions using invariants and state equation in 1870 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5942 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Built C files in :
/tmp/ltsmin16365088429869364916
[2024-05-29 11:26:21] [INFO ] Too many transitions (2601) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:26:21] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16365088429869364916
Running compilation step : cd /tmp/ltsmin16365088429869364916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16365088429869364916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16365088429869364916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 11:26:25] [INFO ] Flatten gal took : 119 ms
[2024-05-29 11:26:25] [INFO ] Flatten gal took : 135 ms
[2024-05-29 11:26:25] [INFO ] Time to serialize gal into /tmp/LTL5741427985157720583.gal : 17 ms
[2024-05-29 11:26:25] [INFO ] Time to serialize properties into /tmp/LTL7479335756633441009.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5741427985157720583.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6161900905918419781.hoa' '-atoms' '/tmp/LTL7479335756633441009.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7479335756633441009.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6161900905918419781.hoa
Detected timeout of ITS tools.
[2024-05-29 11:26:40] [INFO ] Flatten gal took : 129 ms
[2024-05-29 11:26:40] [INFO ] Flatten gal took : 115 ms
[2024-05-29 11:26:40] [INFO ] Time to serialize gal into /tmp/LTL10865678661176820912.gal : 11 ms
[2024-05-29 11:26:40] [INFO ] Time to serialize properties into /tmp/LTL2220283419275809454.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10865678661176820912.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2220283419275809454.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((!(X((G("((p415==1)&&(p417==1))"))U("((p51==1)&&(p72==1))"))))U("((p2484==1)&&(p2505==1))")))
Formula 0 simplified : !"((p2484==1)&&(p2505==1))" & X(!"((p2484==1)&&(p2505==1))" W (G"((p415==1)&&(p417==1))" U "((p51==1)&&(p72==1))"))
Detected timeout of ITS tools.
[2024-05-29 11:26:55] [INFO ] Flatten gal took : 134 ms
[2024-05-29 11:26:55] [INFO ] Applying decomposition
[2024-05-29 11:26:55] [INFO ] Flatten gal took : 131 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5956751002996298641.txt' '-o' '/tmp/graph5956751002996298641.bin' '-w' '/tmp/graph5956751002996298641.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5956751002996298641.bin' '-l' '-1' '-v' '-w' '/tmp/graph5956751002996298641.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:26:56] [INFO ] Decomposing Gal with order
[2024-05-29 11:26:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:26:56] [INFO ] Removed a total of 600 redundant transitions.
[2024-05-29 11:26:56] [INFO ] Flatten gal took : 118 ms
[2024-05-29 11:26:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 131 ms.
[2024-05-29 11:26:56] [INFO ] Time to serialize gal into /tmp/LTL11475114842826544491.gal : 25 ms
[2024-05-29 11:26:56] [INFO ] Time to serialize properties into /tmp/LTL4439988334318085467.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11475114842826544491.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4439988334318085467.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((!(X((G("((i7.i1.i2.u147.p415==1)&&(i7.i1.i3.u148.p417==1))"))U("((i1.i0.i1.u19.p51==1)&&(i1.i1.i1.u26.p72==1))"))))U("((i43.i1.i0....201
Formula 0 simplified : !"((i43.i1.i0.u881.p2484==1)&&(i43.i1.i0.u889.p2505==1))" & X(!"((i43.i1.i0.u881.p2484==1)&&(i43.i1.i0.u889.p2505==1))" W (G"((i7.i1...252
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10729924776950377858
[2024-05-29 11:27:11] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10729924776950377858
Running compilation step : cd /tmp/ltsmin10729924776950377858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10729924776950377858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10729924776950377858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPs-PT-100A-LTLFireability-12 finished in 407108 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1)||X((G(p3)&&p2)))))'
Support contains 7 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 138 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2024-05-29 11:27:14] [INFO ] Computed 1101 invariants in 12 ms
[2024-05-29 11:27:16] [INFO ] Implicit Places using invariants in 1875 ms returned []
[2024-05-29 11:27:16] [INFO ] Invariant cache hit.
[2024-05-29 11:27:18] [INFO ] Implicit Places using invariants and state equation in 1810 ms returned []
Implicit Place search using SMT with State Equation took 3688 ms to find 0 implicit places.
[2024-05-29 11:27:18] [INFO ] Invariant cache hit.
[2024-05-29 11:27:20] [INFO ] Dead Transitions using invariants and state equation in 1943 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5771 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 310 ms :[true, (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p3), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p3), acceptance={} source=3 dest: 0}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p2) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND p2 p3), acceptance={} source=4 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=5 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), acceptance={} source=5 dest: 6}, { cond=(AND p1 p2 p3), acceptance={} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p1) p3), acceptance={} source=7 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND p1 p3), acceptance={} source=7 dest: 7}]], initial=1, aps=[p0:(EQ s2414 1), p1:(OR (EQ s2732 0) (EQ s2753 0)), p3:(AND (EQ s1713 1) (EQ s1734 1)), p2:(AND (EQ s1687 1) (EQ s1706 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 604 steps with 0 reset in 15 ms.
FORMULA ShieldPPPs-PT-100A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLFireability-13 finished in 6137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p1 U p2)||p0)))'
Support contains 6 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 134 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2024-05-29 11:27:21] [INFO ] Invariant cache hit.
[2024-05-29 11:27:23] [INFO ] Implicit Places using invariants in 1990 ms returned []
[2024-05-29 11:27:23] [INFO ] Invariant cache hit.
[2024-05-29 11:27:25] [INFO ] Implicit Places using invariants and state equation in 2015 ms returned []
Implicit Place search using SMT with State Equation took 4021 ms to find 0 implicit places.
[2024-05-29 11:27:25] [INFO ] Invariant cache hit.
[2024-05-29 11:27:27] [INFO ] Dead Transitions using invariants and state equation in 1936 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6091 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(AND (EQ s2306 1) (EQ s2308 1)), p1:(AND (EQ s2686 1) (EQ s2707 1)), p0:(OR (EQ s2557 0) (EQ s2599 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 8236 ms.
Product exploration explored 100000 steps with 50000 reset in 8455 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 22 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-100A-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-100A-LTLFireability-14 finished in 22982 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X(F(p1)))))'
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 138 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2024-05-29 11:27:44] [INFO ] Invariant cache hit.
[2024-05-29 11:27:46] [INFO ] Implicit Places using invariants in 2050 ms returned []
[2024-05-29 11:27:46] [INFO ] Invariant cache hit.
[2024-05-29 11:27:48] [INFO ] Implicit Places using invariants and state equation in 1983 ms returned []
Implicit Place search using SMT with State Equation took 4036 ms to find 0 implicit places.
[2024-05-29 11:27:48] [INFO ] Invariant cache hit.
[2024-05-29 11:27:49] [INFO ] Dead Transitions using invariants and state equation in 1848 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6023 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1103 1) (EQ s1114 1)), p1:(OR (EQ s914 0) (EQ s956 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 8168 ms.
Product exploration explored 100000 steps with 50000 reset in 8210 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-100A-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-100A-LTLFireability-15 finished in 22589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((F(p1)||G(p2))))))'
Found a Shortening insensitive property : ShieldPPPs-PT-100A-LTLFireability-00
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3101 transition count 2601
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3100 transition count 2600
Applied a total of 4 rules in 446 ms. Remains 3100 /3103 variables (removed 3) and now considering 2600/2603 (removed 3) transitions.
// Phase 1: matrix 2600 rows 3100 cols
[2024-05-29 11:28:07] [INFO ] Computed 1101 invariants in 8 ms
[2024-05-29 11:28:09] [INFO ] Implicit Places using invariants in 2003 ms returned []
[2024-05-29 11:28:09] [INFO ] Invariant cache hit.
[2024-05-29 11:28:11] [INFO ] Implicit Places using invariants and state equation in 1952 ms returned []
Implicit Place search using SMT with State Equation took 3959 ms to find 0 implicit places.
[2024-05-29 11:28:11] [INFO ] Invariant cache hit.
[2024-05-29 11:28:12] [INFO ] Dead Transitions using invariants and state equation in 1829 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3100/3103 places, 2600/2603 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6236 ms. Remains : 3100/3103 places, 2600/2603 transitions.
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s264 1) (EQ s266 1)), p1:(EQ s62 1), p2:(AND (OR (EQ s62 1) (AND (EQ s264 1) (EQ s266 1))) (EQ s368 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 17 reset in 1940 ms.
Product exploration explored 100000 steps with 17 reset in 2380 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 469 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 498 ms. (steps per millisecond=20 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 61931 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61931 steps, saw 56095 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 8 properties.
[2024-05-29 11:28:22] [INFO ] Invariant cache hit.
[2024-05-29 11:28:23] [INFO ] [Real]Absence check using 1101 positive place invariants in 242 ms returned sat
[2024-05-29 11:28:25] [INFO ] After 3087ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2024-05-29 11:28:26] [INFO ] [Nat]Absence check using 1101 positive place invariants in 244 ms returned sat
[2024-05-29 11:28:29] [INFO ] After 2134ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2024-05-29 11:28:29] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 1 ms to minimize.
[2024-05-29 11:28:29] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 0 ms to minimize.
[2024-05-29 11:28:29] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 1 ms to minimize.
[2024-05-29 11:28:29] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 1 ms to minimize.
[2024-05-29 11:28:30] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 0 ms to minimize.
[2024-05-29 11:28:30] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 0 ms to minimize.
[2024-05-29 11:28:30] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2024-05-29 11:28:30] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2024-05-29 11:28:30] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2024-05-29 11:28:31] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 0 ms to minimize.
[2024-05-29 11:28:31] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 0 ms to minimize.
[2024-05-29 11:28:31] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 1 ms to minimize.
[2024-05-29 11:28:31] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 0 ms to minimize.
[2024-05-29 11:28:31] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 1 ms to minimize.
[2024-05-29 11:28:32] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-05-29 11:28:32] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2024-05-29 11:28:32] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2024-05-29 11:28:32] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2024-05-29 11:28:32] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-29 11:28:32] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3662 ms
[2024-05-29 11:28:33] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 0 ms to minimize.
[2024-05-29 11:28:33] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2024-05-29 11:28:33] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2024-05-29 11:28:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 650 ms
[2024-05-29 11:28:34] [INFO ] After 7419ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 638 ms.
[2024-05-29 11:28:35] [INFO ] After 9433ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 740 ms.
Support contains 4 out of 3100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 3100 transition count 2600
Applied a total of 596 rules in 293 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 293 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 432 ms. (steps per millisecond=23 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 7) 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 7) seen :0
Interrupted probabilistic random walk after 84272 steps, run timeout after 3006 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84272 steps, saw 83531 distinct states, run finished after 3006 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2600 rows 3100 cols
[2024-05-29 11:28:40] [INFO ] Computed 1101 invariants in 21 ms
[2024-05-29 11:28:41] [INFO ] [Real]Absence check using 1101 positive place invariants in 234 ms returned sat
[2024-05-29 11:28:43] [INFO ] After 3098ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 11:28:44] [INFO ] [Nat]Absence check using 1101 positive place invariants in 241 ms returned sat
[2024-05-29 11:28:47] [INFO ] After 2144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 11:28:47] [INFO ] Deduced a trap composed of 17 places in 414 ms of which 1 ms to minimize.
[2024-05-29 11:28:48] [INFO ] Deduced a trap composed of 17 places in 380 ms of which 1 ms to minimize.
[2024-05-29 11:28:48] [INFO ] Deduced a trap composed of 17 places in 397 ms of which 1 ms to minimize.
[2024-05-29 11:28:48] [INFO ] Deduced a trap composed of 17 places in 345 ms of which 1 ms to minimize.
[2024-05-29 11:28:49] [INFO ] Deduced a trap composed of 17 places in 335 ms of which 1 ms to minimize.
[2024-05-29 11:28:49] [INFO ] Deduced a trap composed of 17 places in 335 ms of which 1 ms to minimize.
[2024-05-29 11:28:50] [INFO ] Deduced a trap composed of 17 places in 365 ms of which 1 ms to minimize.
[2024-05-29 11:28:50] [INFO ] Deduced a trap composed of 17 places in 333 ms of which 1 ms to minimize.
[2024-05-29 11:28:51] [INFO ] Deduced a trap composed of 19 places in 319 ms of which 1 ms to minimize.
[2024-05-29 11:28:51] [INFO ] Deduced a trap composed of 23 places in 331 ms of which 0 ms to minimize.
[2024-05-29 11:28:51] [INFO ] Deduced a trap composed of 17 places in 322 ms of which 0 ms to minimize.
[2024-05-29 11:28:52] [INFO ] Deduced a trap composed of 19 places in 333 ms of which 1 ms to minimize.
[2024-05-29 11:28:52] [INFO ] Deduced a trap composed of 17 places in 377 ms of which 1 ms to minimize.
[2024-05-29 11:28:53] [INFO ] Deduced a trap composed of 19 places in 318 ms of which 1 ms to minimize.
[2024-05-29 11:28:53] [INFO ] Deduced a trap composed of 28 places in 307 ms of which 1 ms to minimize.
[2024-05-29 11:28:53] [INFO ] Deduced a trap composed of 17 places in 238 ms of which 1 ms to minimize.
[2024-05-29 11:28:54] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 1 ms to minimize.
[2024-05-29 11:28:54] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 1 ms to minimize.
[2024-05-29 11:28:54] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 1 ms to minimize.
[2024-05-29 11:28:54] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-29 11:28:55] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2024-05-29 11:28:55] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 0 ms to minimize.
[2024-05-29 11:28:55] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 0 ms to minimize.
[2024-05-29 11:28:55] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 8501 ms
[2024-05-29 11:28:56] [INFO ] After 11759ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 663 ms.
[2024-05-29 11:28:57] [INFO ] After 13744ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 542 ms.
Support contains 4 out of 3100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 127 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 145 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-29 11:28:58] [INFO ] Invariant cache hit.
[2024-05-29 11:29:00] [INFO ] Implicit Places using invariants in 2261 ms returned []
[2024-05-29 11:29:00] [INFO ] Invariant cache hit.
[2024-05-29 11:29:02] [INFO ] Implicit Places using invariants and state equation in 2278 ms returned []
Implicit Place search using SMT with State Equation took 4542 ms to find 0 implicit places.
[2024-05-29 11:29:02] [INFO ] Redundant transitions in 81 ms returned []
[2024-05-29 11:29:02] [INFO ] Invariant cache hit.
[2024-05-29 11:29:04] [INFO ] Dead Transitions using invariants and state equation in 1862 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6637 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 134 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Running SMT prover for 7 properties.
[2024-05-29 11:29:04] [INFO ] Invariant cache hit.
[2024-05-29 11:29:05] [INFO ] [Real]Absence check using 1101 positive place invariants in 244 ms returned sat
[2024-05-29 11:29:07] [INFO ] After 3177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 11:29:09] [INFO ] [Nat]Absence check using 1101 positive place invariants in 242 ms returned sat
[2024-05-29 11:29:11] [INFO ] After 2199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 11:29:11] [INFO ] Deduced a trap composed of 17 places in 220 ms of which 1 ms to minimize.
[2024-05-29 11:29:12] [INFO ] Deduced a trap composed of 17 places in 226 ms of which 1 ms to minimize.
[2024-05-29 11:29:12] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2024-05-29 11:29:12] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 0 ms to minimize.
[2024-05-29 11:29:21] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:29:21] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2024-05-29 11:29:21] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
[2024-05-29 11:29:22] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2024-05-29 11:29:22] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2024-05-29 11:29:22] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2024-05-29 11:29:22] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2024-05-29 11:29:22] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 11130 ms
[2024-05-29 11:29:23] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 0 ms to minimize.
[2024-05-29 11:29:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
[2024-05-29 11:29:23] [INFO ] After 14597ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 693 ms.
[2024-05-29 11:29:24] [INFO ] After 16661ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 110 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 2600 rows 3100 cols
[2024-05-29 11:29:24] [INFO ] Computed 1101 invariants in 6 ms
[2024-05-29 11:29:31] [INFO ] [Real]Absence check using 1101 positive place invariants in 1740 ms returned sat
[2024-05-29 11:29:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:29:39] [INFO ] [Real]Absence check using state equation in 8878 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 3100 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 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 156 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-29 11:29:40] [INFO ] Invariant cache hit.
[2024-05-29 11:29:41] [INFO ] Implicit Places using invariants in 1874 ms returned []
[2024-05-29 11:29:41] [INFO ] Invariant cache hit.
[2024-05-29 11:29:43] [INFO ] Implicit Places using invariants and state equation in 1901 ms returned []
Implicit Place search using SMT with State Equation took 3777 ms to find 0 implicit places.
[2024-05-29 11:29:43] [INFO ] Redundant transitions in 70 ms returned []
[2024-05-29 11:29:43] [INFO ] Invariant cache hit.
[2024-05-29 11:29:45] [INFO ] Dead Transitions using invariants and state equation in 1870 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5878 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 84661 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84661 steps, saw 76838 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 11:29:49] [INFO ] Invariant cache hit.
[2024-05-29 11:29:50] [INFO ] [Real]Absence check using 1101 positive place invariants in 239 ms returned sat
[2024-05-29 11:29:50] [INFO ] After 831ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 11:29:50] [INFO ] [Nat]Absence check using 1101 positive place invariants in 227 ms returned sat
[2024-05-29 11:29:52] [INFO ] After 1517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 11:29:52] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 0 ms to minimize.
[2024-05-29 11:29:52] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 0 ms to minimize.
[2024-05-29 11:29:53] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 1 ms to minimize.
[2024-05-29 11:29:53] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 1 ms to minimize.
[2024-05-29 11:29:53] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 0 ms to minimize.
[2024-05-29 11:29:53] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 1 ms to minimize.
[2024-05-29 11:29:54] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 0 ms to minimize.
[2024-05-29 11:29:54] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 0 ms to minimize.
[2024-05-29 11:29:54] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 0 ms to minimize.
[2024-05-29 11:29:54] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 0 ms to minimize.
[2024-05-29 11:29:54] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2024-05-29 11:29:55] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-05-29 11:29:55] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 0 ms to minimize.
[2024-05-29 11:29:55] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 0 ms to minimize.
[2024-05-29 11:29:55] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
[2024-05-29 11:29:55] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 0 ms to minimize.
[2024-05-29 11:29:55] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3410 ms
[2024-05-29 11:29:55] [INFO ] After 4992ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2024-05-29 11:29:55] [INFO ] After 5834ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 47 ms.
Support contains 3 out of 3100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Partial Free-agglomeration rule applied 597 times.
Drop transitions removed 597 transitions
Iterating global reduction 0 with 597 rules applied. Total rules applied 597 place count 3100 transition count 2600
Applied a total of 597 rules in 260 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 260 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 132456 steps, run timeout after 3002 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132456 steps, saw 131468 distinct states, run finished after 3002 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2600 rows 3100 cols
[2024-05-29 11:29:59] [INFO ] Computed 1101 invariants in 26 ms
[2024-05-29 11:30:00] [INFO ] [Real]Absence check using 1101 positive place invariants in 241 ms returned sat
[2024-05-29 11:30:00] [INFO ] After 812ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 11:30:01] [INFO ] [Nat]Absence check using 1101 positive place invariants in 244 ms returned sat
[2024-05-29 11:30:02] [INFO ] After 1621ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 11:30:03] [INFO ] Deduced a trap composed of 34 places in 366 ms of which 1 ms to minimize.
[2024-05-29 11:30:03] [INFO ] Deduced a trap composed of 28 places in 383 ms of which 1 ms to minimize.
[2024-05-29 11:30:04] [INFO ] Deduced a trap composed of 17 places in 377 ms of which 1 ms to minimize.
[2024-05-29 11:30:04] [INFO ] Deduced a trap composed of 17 places in 388 ms of which 0 ms to minimize.
[2024-05-29 11:30:05] [INFO ] Deduced a trap composed of 17 places in 333 ms of which 1 ms to minimize.
[2024-05-29 11:30:05] [INFO ] Deduced a trap composed of 17 places in 366 ms of which 1 ms to minimize.
[2024-05-29 11:30:06] [INFO ] Deduced a trap composed of 42 places in 341 ms of which 1 ms to minimize.
[2024-05-29 11:30:06] [INFO ] Deduced a trap composed of 17 places in 306 ms of which 1 ms to minimize.
[2024-05-29 11:30:06] [INFO ] Deduced a trap composed of 33 places in 268 ms of which 0 ms to minimize.
[2024-05-29 11:30:07] [INFO ] Deduced a trap composed of 25 places in 283 ms of which 0 ms to minimize.
[2024-05-29 11:30:07] [INFO ] Deduced a trap composed of 17 places in 282 ms of which 2 ms to minimize.
[2024-05-29 11:30:07] [INFO ] Deduced a trap composed of 17 places in 261 ms of which 1 ms to minimize.
[2024-05-29 11:30:08] [INFO ] Deduced a trap composed of 17 places in 247 ms of which 1 ms to minimize.
[2024-05-29 11:30:08] [INFO ] Deduced a trap composed of 17 places in 249 ms of which 1 ms to minimize.
[2024-05-29 11:30:08] [INFO ] Deduced a trap composed of 17 places in 220 ms of which 0 ms to minimize.
[2024-05-29 11:30:09] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 1 ms to minimize.
[2024-05-29 11:30:09] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 1 ms to minimize.
[2024-05-29 11:30:09] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 0 ms to minimize.
[2024-05-29 11:30:09] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 0 ms to minimize.
[2024-05-29 11:30:10] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 1 ms to minimize.
[2024-05-29 11:30:10] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 1 ms to minimize.
[2024-05-29 11:30:10] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 0 ms to minimize.
[2024-05-29 11:30:10] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 0 ms to minimize.
[2024-05-29 11:30:11] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 1 ms to minimize.
[2024-05-29 11:30:11] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 0 ms to minimize.
[2024-05-29 11:30:11] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 1 ms to minimize.
[2024-05-29 11:30:11] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 0 ms to minimize.
[2024-05-29 11:30:12] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 0 ms to minimize.
[2024-05-29 11:30:12] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 0 ms to minimize.
[2024-05-29 11:30:12] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 1 ms to minimize.
[2024-05-29 11:30:12] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2024-05-29 11:30:12] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 0 ms to minimize.
[2024-05-29 11:30:13] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 0 ms to minimize.
[2024-05-29 11:30:13] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 0 ms to minimize.
[2024-05-29 11:30:13] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 10424 ms
[2024-05-29 11:30:13] [INFO ] After 12119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 98 ms.
[2024-05-29 11:30:13] [INFO ] After 13041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 35 ms.
Support contains 3 out of 3100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 154 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 124 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-29 11:30:13] [INFO ] Invariant cache hit.
[2024-05-29 11:30:16] [INFO ] Implicit Places using invariants in 2453 ms returned []
[2024-05-29 11:30:16] [INFO ] Invariant cache hit.
[2024-05-29 11:30:18] [INFO ] Implicit Places using invariants and state equation in 2251 ms returned []
Implicit Place search using SMT with State Equation took 4705 ms to find 0 implicit places.
[2024-05-29 11:30:18] [INFO ] Redundant transitions in 76 ms returned []
[2024-05-29 11:30:18] [INFO ] Invariant cache hit.
[2024-05-29 11:30:20] [INFO ] Dead Transitions using invariants and state equation in 1978 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6891 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 125 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 11:30:20] [INFO ] Invariant cache hit.
[2024-05-29 11:30:21] [INFO ] [Real]Absence check using 1101 positive place invariants in 254 ms returned sat
[2024-05-29 11:30:21] [INFO ] After 882ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 11:30:22] [INFO ] [Nat]Absence check using 1101 positive place invariants in 242 ms returned sat
[2024-05-29 11:30:23] [INFO ] After 1592ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 11:30:24] [INFO ] Deduced a trap composed of 17 places in 376 ms of which 1 ms to minimize.
[2024-05-29 11:30:24] [INFO ] Deduced a trap composed of 19 places in 343 ms of which 1 ms to minimize.
[2024-05-29 11:30:25] [INFO ] Deduced a trap composed of 12 places in 347 ms of which 1 ms to minimize.
[2024-05-29 11:30:25] [INFO ] Deduced a trap composed of 17 places in 315 ms of which 0 ms to minimize.
[2024-05-29 11:30:26] [INFO ] Deduced a trap composed of 22 places in 271 ms of which 1 ms to minimize.
[2024-05-29 11:30:26] [INFO ] Deduced a trap composed of 25 places in 273 ms of which 1 ms to minimize.
[2024-05-29 11:30:26] [INFO ] Deduced a trap composed of 17 places in 265 ms of which 1 ms to minimize.
[2024-05-29 11:30:27] [INFO ] Deduced a trap composed of 17 places in 271 ms of which 1 ms to minimize.
[2024-05-29 11:30:27] [INFO ] Deduced a trap composed of 17 places in 238 ms of which 0 ms to minimize.
[2024-05-29 11:30:27] [INFO ] Deduced a trap composed of 17 places in 215 ms of which 1 ms to minimize.
[2024-05-29 11:30:28] [INFO ] Deduced a trap composed of 17 places in 216 ms of which 0 ms to minimize.
[2024-05-29 11:30:28] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 1 ms to minimize.
[2024-05-29 11:30:28] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 1 ms to minimize.
[2024-05-29 11:30:28] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 1 ms to minimize.
[2024-05-29 11:30:29] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 1 ms to minimize.
[2024-05-29 11:30:29] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 0 ms to minimize.
[2024-05-29 11:30:29] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 0 ms to minimize.
[2024-05-29 11:30:29] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 0 ms to minimize.
[2024-05-29 11:30:30] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 0 ms to minimize.
[2024-05-29 11:30:30] [INFO ] Deduced a trap composed of 56 places in 151 ms of which 1 ms to minimize.
[2024-05-29 11:30:30] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 0 ms to minimize.
[2024-05-29 11:30:30] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 0 ms to minimize.
[2024-05-29 11:30:31] [INFO ] Deduced a trap composed of 57 places in 140 ms of which 1 ms to minimize.
[2024-05-29 11:30:31] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 0 ms to minimize.
[2024-05-29 11:30:31] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 0 ms to minimize.
[2024-05-29 11:30:31] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 7454 ms
[2024-05-29 11:30:31] [INFO ] After 9122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2024-05-29 11:30:31] [INFO ] After 10035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 2600 rows 3100 cols
[2024-05-29 11:30:31] [INFO ] Computed 1101 invariants in 12 ms
[2024-05-29 11:30:37] [INFO ] [Real]Absence check using 1101 positive place invariants in 1732 ms returned sat
[2024-05-29 11:30:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:30:46] [INFO ] [Real]Absence check using state equation in 8997 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 17 reset in 1901 ms.
Product exploration explored 100000 steps with 17 reset in 2393 ms.
Built C files in :
/tmp/ltsmin14868432402944283762
[2024-05-29 11:30:51] [INFO ] Too many transitions (2600) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:30:51] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14868432402944283762
Running compilation step : cd /tmp/ltsmin14868432402944283762;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14868432402944283762;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14868432402944283762;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 3100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 142 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-29 11:30:54] [INFO ] Invariant cache hit.
[2024-05-29 11:30:56] [INFO ] Implicit Places using invariants in 2096 ms returned []
[2024-05-29 11:30:56] [INFO ] Invariant cache hit.
[2024-05-29 11:30:58] [INFO ] Implicit Places using invariants and state equation in 1999 ms returned []
Implicit Place search using SMT with State Equation took 4097 ms to find 0 implicit places.
[2024-05-29 11:30:58] [INFO ] Redundant transitions in 74 ms returned []
[2024-05-29 11:30:58] [INFO ] Invariant cache hit.
[2024-05-29 11:31:00] [INFO ] Dead Transitions using invariants and state equation in 2004 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6332 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Built C files in :
/tmp/ltsmin16706687117927029037
[2024-05-29 11:31:00] [INFO ] Too many transitions (2600) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:31:00] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16706687117927029037
Running compilation step : cd /tmp/ltsmin16706687117927029037;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16706687117927029037;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16706687117927029037;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 11:31:03] [INFO ] Flatten gal took : 70 ms
[2024-05-29 11:31:03] [INFO ] Flatten gal took : 70 ms
[2024-05-29 11:31:03] [INFO ] Time to serialize gal into /tmp/LTL10728130740467578722.gal : 11 ms
[2024-05-29 11:31:03] [INFO ] Time to serialize properties into /tmp/LTL4151174835012198939.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10728130740467578722.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13106547926008932201.hoa' '-atoms' '/tmp/LTL4151174835012198939.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4151174835012198939.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13106547926008932201.hoa
Detected timeout of ITS tools.
[2024-05-29 11:31:18] [INFO ] Flatten gal took : 69 ms
[2024-05-29 11:31:19] [INFO ] Flatten gal took : 70 ms
[2024-05-29 11:31:19] [INFO ] Time to serialize gal into /tmp/LTL3567819761246892970.gal : 11 ms
[2024-05-29 11:31:19] [INFO ] Time to serialize properties into /tmp/LTL16479732606332564670.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3567819761246892970.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16479732606332564670.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((X((F("(p63==1)"))||(G("(((p63==1)||((p265==1)&&(p267==1)))&&(p369==1))"))))||("((p265==1)&&(p267==1))"))))
Formula 0 simplified : G(!"((p265==1)&&(p267==1))" & X(G!"(p63==1)" & F!"(((p63==1)||((p265==1)&&(p267==1)))&&(p369==1))"))
Detected timeout of ITS tools.
[2024-05-29 11:31:34] [INFO ] Flatten gal took : 69 ms
[2024-05-29 11:31:34] [INFO ] Applying decomposition
[2024-05-29 11:31:34] [INFO ] Flatten gal took : 70 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10927398619746460454.txt' '-o' '/tmp/graph10927398619746460454.bin' '-w' '/tmp/graph10927398619746460454.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10927398619746460454.bin' '-l' '-1' '-v' '-w' '/tmp/graph10927398619746460454.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:31:34] [INFO ] Decomposing Gal with order
[2024-05-29 11:31:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:31:34] [INFO ] Removed a total of 600 redundant transitions.
[2024-05-29 11:31:34] [INFO ] Flatten gal took : 111 ms
[2024-05-29 11:31:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 14 ms.
[2024-05-29 11:31:34] [INFO ] Time to serialize gal into /tmp/LTL10816624547647869395.gal : 24 ms
[2024-05-29 11:31:34] [INFO ] Time to serialize properties into /tmp/LTL8364675079402490790.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10816624547647869395.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8364675079402490790.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((X((F("(i0.i1.i3.u22.p63==1)"))||(G("(((i0.i1.i3.u22.p63==1)||((i4.i0.i1.u94.p265==1)&&(i4.i0.i3.u95.p267==1)))&&(i5.i1.i2.u131.p...225
Formula 0 simplified : G(!"((i4.i0.i1.u94.p265==1)&&(i4.i0.i3.u95.p267==1))" & X(G!"(i0.i1.i3.u22.p63==1)" & F!"(((i0.i1.i3.u22.p63==1)||((i4.i0.i1.u94.p26...215
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17674231177746742470
[2024-05-29 11:31:49] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17674231177746742470
Running compilation step : cd /tmp/ltsmin17674231177746742470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin17674231177746742470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin17674231177746742470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPs-PT-100A-LTLFireability-00 finished in 226495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : ShieldPPPs-PT-100A-LTLFireability-03
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 295 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2024-05-29 11:31:53] [INFO ] Computed 1101 invariants in 12 ms
[2024-05-29 11:31:55] [INFO ] Implicit Places using invariants in 2023 ms returned []
[2024-05-29 11:31:55] [INFO ] Invariant cache hit.
[2024-05-29 11:31:57] [INFO ] Implicit Places using invariants and state equation in 2025 ms returned []
Implicit Place search using SMT with State Equation took 4053 ms to find 0 implicit places.
[2024-05-29 11:31:57] [INFO ] Invariant cache hit.
[2024-05-29 11:31:59] [INFO ] Dead Transitions using invariants and state equation in 1793 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6144 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s1023 1) (AND (EQ s313 1) (EQ s340 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22 reset in 1894 ms.
Product exploration explored 100000 steps with 22 reset in 2386 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 79950 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79950 steps, saw 72569 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 11:32:07] [INFO ] Invariant cache hit.
[2024-05-29 11:32:08] [INFO ] [Real]Absence check using 1101 positive place invariants in 259 ms returned sat
[2024-05-29 11:32:08] [INFO ] After 923ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 11:32:09] [INFO ] [Nat]Absence check using 1101 positive place invariants in 259 ms returned sat
[2024-05-29 11:32:19] [INFO ] After 11469ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 894 times.
Drop transitions removed 894 transitions
Iterating global reduction 0 with 894 rules applied. Total rules applied 894 place count 3101 transition count 2601
Applied a total of 894 rules in 289 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 289 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 1) seen :0
Finished probabilistic random walk after 67125 steps, run visited all 1 properties in 1619 ms. (steps per millisecond=41 )
Probabilistic random walk after 67125 steps, saw 66350 distinct states, run finished after 1624 ms. (steps per millisecond=41 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 226 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 11:32:22] [INFO ] Invariant cache hit.
[2024-05-29 11:32:28] [INFO ] [Real]Absence check using 1101 positive place invariants in 2029 ms returned sat
[2024-05-29 11:32:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:32:37] [INFO ] [Real]Absence check using state equation in 8650 ms returned unknown
Could not prove EG (NOT p0)
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 125 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2024-05-29 11:32:37] [INFO ] Invariant cache hit.
[2024-05-29 11:32:39] [INFO ] Implicit Places using invariants in 2071 ms returned []
[2024-05-29 11:32:39] [INFO ] Invariant cache hit.
[2024-05-29 11:32:41] [INFO ] Implicit Places using invariants and state equation in 2076 ms returned []
Implicit Place search using SMT with State Equation took 4148 ms to find 0 implicit places.
[2024-05-29 11:32:41] [INFO ] Invariant cache hit.
[2024-05-29 11:32:43] [INFO ] Dead Transitions using invariants and state equation in 1989 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6263 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 80727 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80727 steps, saw 73268 distinct states, run finished after 3002 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 11:32:47] [INFO ] Invariant cache hit.
[2024-05-29 11:32:48] [INFO ] [Real]Absence check using 1101 positive place invariants in 248 ms returned sat
[2024-05-29 11:32:48] [INFO ] After 820ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 11:32:48] [INFO ] [Nat]Absence check using 1101 positive place invariants in 257 ms returned sat
[2024-05-29 11:32:59] [INFO ] After 11433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 894 times.
Drop transitions removed 894 transitions
Iterating global reduction 0 with 894 rules applied. Total rules applied 894 place count 3101 transition count 2601
Applied a total of 894 rules in 346 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 346 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Finished probabilistic random walk after 67125 steps, run visited all 1 properties in 1631 ms. (steps per millisecond=41 )
Probabilistic random walk after 67125 steps, saw 66350 distinct states, run finished after 1638 ms. (steps per millisecond=40 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 11:33:02] [INFO ] Invariant cache hit.
[2024-05-29 11:33:08] [INFO ] [Real]Absence check using 1101 positive place invariants in 1971 ms returned sat
[2024-05-29 11:33:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:33:17] [INFO ] [Real]Absence check using state equation in 8746 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22 reset in 1813 ms.
Product exploration explored 100000 steps with 21 reset in 2270 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 142 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2024-05-29 11:33:21] [INFO ] Redundant transitions in 68 ms returned []
[2024-05-29 11:33:21] [INFO ] Invariant cache hit.
[2024-05-29 11:33:23] [INFO ] Dead Transitions using invariants and state equation in 1864 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2088 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Built C files in :
/tmp/ltsmin1111934684944617908
[2024-05-29 11:33:23] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1111934684944617908
Running compilation step : cd /tmp/ltsmin1111934684944617908;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1111934684944617908;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1111934684944617908;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 169 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2024-05-29 11:33:27] [INFO ] Invariant cache hit.
[2024-05-29 11:33:29] [INFO ] Implicit Places using invariants in 2099 ms returned []
[2024-05-29 11:33:29] [INFO ] Invariant cache hit.
[2024-05-29 11:33:31] [INFO ] Implicit Places using invariants and state equation in 1898 ms returned []
Implicit Place search using SMT with State Equation took 3997 ms to find 0 implicit places.
[2024-05-29 11:33:31] [INFO ] Invariant cache hit.
[2024-05-29 11:33:32] [INFO ] Dead Transitions using invariants and state equation in 1897 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6065 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Built C files in :
/tmp/ltsmin11138183550045539162
[2024-05-29 11:33:32] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11138183550045539162
Running compilation step : cd /tmp/ltsmin11138183550045539162;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin11138183550045539162;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin11138183550045539162;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 11:33:36] [INFO ] Flatten gal took : 111 ms
[2024-05-29 11:33:36] [INFO ] Flatten gal took : 113 ms
[2024-05-29 11:33:36] [INFO ] Time to serialize gal into /tmp/LTL14801465809788601803.gal : 11 ms
[2024-05-29 11:33:36] [INFO ] Time to serialize properties into /tmp/LTL16668319012379546327.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14801465809788601803.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9716058708082420603.hoa' '-atoms' '/tmp/LTL16668319012379546327.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16668319012379546327.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9716058708082420603.hoa
Detected timeout of ITS tools.
[2024-05-29 11:33:51] [INFO ] Flatten gal took : 140 ms
[2024-05-29 11:33:51] [INFO ] Flatten gal took : 115 ms
[2024-05-29 11:33:51] [INFO ] Time to serialize gal into /tmp/LTL15305585407335372006.gal : 18 ms
[2024-05-29 11:33:51] [INFO ] Time to serialize properties into /tmp/LTL14504571199258708815.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15305585407335372006.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14504571199258708815.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((p1023==1)||((p313==1)&&(p340==1)))")))))
Formula 0 simplified : XXG!"((p1023==1)||((p313==1)&&(p340==1)))"
Detected timeout of ITS tools.
[2024-05-29 11:34:06] [INFO ] Flatten gal took : 116 ms
[2024-05-29 11:34:06] [INFO ] Applying decomposition
[2024-05-29 11:34:06] [INFO ] Flatten gal took : 129 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2880090778434120893.txt' '-o' '/tmp/graph2880090778434120893.bin' '-w' '/tmp/graph2880090778434120893.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2880090778434120893.bin' '-l' '-1' '-v' '-w' '/tmp/graph2880090778434120893.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:34:07] [INFO ] Decomposing Gal with order
[2024-05-29 11:34:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:34:07] [INFO ] Removed a total of 600 redundant transitions.
[2024-05-29 11:34:07] [INFO ] Flatten gal took : 108 ms
[2024-05-29 11:34:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 144 ms.
[2024-05-29 11:34:07] [INFO ] Time to serialize gal into /tmp/LTL11012716682722663695.gal : 26 ms
[2024-05-29 11:34:07] [INFO ] Time to serialize properties into /tmp/LTL7038737141867537738.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11012716682722663695.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7038737141867537738.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((i17.i0.i3.u363.p1023==1)||((i5.i0.i0.u111.p313==1)&&(i5.i0.i2.u121.p340==1)))")))))
Formula 0 simplified : XXG!"((i17.i0.i3.u363.p1023==1)||((i5.i0.i0.u111.p313==1)&&(i5.i0.i2.u121.p340==1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1614643271892351200
[2024-05-29 11:34:22] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1614643271892351200
Running compilation step : cd /tmp/ltsmin1614643271892351200;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1614643271892351200;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1614643271892351200;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPs-PT-100A-LTLFireability-03 finished in 152729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F((p0&&G(p1))))||G(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(!p0)||X(p1)) U X((F(p1)&&p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0))||(F(!p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!X((G(p0) U p1)) U p2))'
Found a Lengthening insensitive property : ShieldPPPs-PT-100A-LTLFireability-12
Stuttering acceptance computed with spot in 169 ms :[(AND p0 p1), true, p0, (NOT p2), (OR (NOT p2) p1)]
Support contains 6 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 281 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
[2024-05-29 11:34:27] [INFO ] Invariant cache hit.
[2024-05-29 11:34:29] [INFO ] Implicit Places using invariants in 1921 ms returned []
[2024-05-29 11:34:29] [INFO ] Invariant cache hit.
[2024-05-29 11:34:30] [INFO ] Implicit Places using invariants and state equation in 1846 ms returned []
Implicit Place search using SMT with State Equation took 3770 ms to find 0 implicit places.
[2024-05-29 11:34:30] [INFO ] Invariant cache hit.
[2024-05-29 11:34:32] [INFO ] Dead Transitions using invariants and state equation in 1863 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5916 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=p1, acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (EQ s415 1) (EQ s417 1)), p1:(AND (EQ s51 1) (EQ s72 1)), p2:(AND (EQ s2484 1) (EQ s2505 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 94 reset in 1699 ms.
Product exploration explored 100000 steps with 94 reset in 2214 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT p1)), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 520 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[true, p0, (OR (NOT p2) p1), (AND p0 p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-29 11:34:38] [INFO ] Invariant cache hit.
[2024-05-29 11:34:39] [INFO ] [Real]Absence check using 1101 positive place invariants in 241 ms returned sat
[2024-05-29 11:34:42] [INFO ] After 2417ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2024-05-29 11:34:42] [INFO ] After 2703ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 11:34:42] [INFO ] After 3884ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 11:34:43] [INFO ] [Nat]Absence check using 1101 positive place invariants in 246 ms returned sat
[2024-05-29 11:35:07] [INFO ] After 23839ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 11:35:07] [INFO ] After 23840ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-29 11:35:07] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 411 ms.
Support contains 6 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 893 times.
Drop transitions removed 893 transitions
Iterating global reduction 0 with 893 rules applied. Total rules applied 893 place count 3101 transition count 2601
Applied a total of 893 rules in 289 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 289 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 81832 steps, run timeout after 3007 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81832 steps, saw 80987 distinct states, run finished after 3007 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2024-05-29 11:35:12] [INFO ] Computed 1101 invariants in 25 ms
[2024-05-29 11:35:13] [INFO ] [Real]Absence check using 1045 positive place invariants in 259 ms returned sat
[2024-05-29 11:35:13] [INFO ] [Real]Absence check using 1045 positive and 56 generalized place invariants in 15 ms returned sat
[2024-05-29 11:35:16] [INFO ] After 4490ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 11:35:17] [INFO ] [Nat]Absence check using 1045 positive place invariants in 250 ms returned sat
[2024-05-29 11:35:17] [INFO ] [Nat]Absence check using 1045 positive and 56 generalized place invariants in 15 ms returned sat
[2024-05-29 11:35:41] [INFO ] After 23789ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 11:35:41] [INFO ] After 23790ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-29 11:35:41] [INFO ] After 25058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 123 ms.
Support contains 6 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 146 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 135 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2024-05-29 11:35:42] [INFO ] Invariant cache hit.
[2024-05-29 11:35:44] [INFO ] Implicit Places using invariants in 2419 ms returned []
[2024-05-29 11:35:44] [INFO ] Invariant cache hit.
[2024-05-29 11:35:47] [INFO ] Implicit Places using invariants and state equation in 2479 ms returned []
Implicit Place search using SMT with State Equation took 4899 ms to find 0 implicit places.
[2024-05-29 11:35:47] [INFO ] Redundant transitions in 76 ms returned []
[2024-05-29 11:35:47] [INFO ] Invariant cache hit.
[2024-05-29 11:35:49] [INFO ] Dead Transitions using invariants and state equation in 1883 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6999 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 145 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 5 properties.
[2024-05-29 11:35:49] [INFO ] Invariant cache hit.
[2024-05-29 11:35:50] [INFO ] [Real]Absence check using 1045 positive place invariants in 235 ms returned sat
[2024-05-29 11:35:50] [INFO ] [Real]Absence check using 1045 positive and 56 generalized place invariants in 14 ms returned sat
[2024-05-29 11:35:54] [INFO ] After 4974ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 11:35:55] [INFO ] [Nat]Absence check using 1045 positive place invariants in 246 ms returned sat
[2024-05-29 11:35:55] [INFO ] [Nat]Absence check using 1045 positive and 56 generalized place invariants in 19 ms returned sat
[2024-05-29 11:36:49] [INFO ] After 53641ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 11:36:54] [INFO ] Deduced a trap composed of 7 places in 296 ms of which 1 ms to minimize.
[2024-05-29 11:36:54] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 1 ms to minimize.
[2024-05-29 11:36:55] [INFO ] Deduced a trap composed of 5 places in 287 ms of which 1 ms to minimize.
[2024-05-29 11:36:55] [INFO ] Deduced a trap composed of 6 places in 288 ms of which 0 ms to minimize.
[2024-05-29 11:36:55] [INFO ] Deduced a trap composed of 5 places in 268 ms of which 0 ms to minimize.
[2024-05-29 11:36:56] [INFO ] Deduced a trap composed of 7 places in 275 ms of which 0 ms to minimize.
[2024-05-29 11:36:56] [INFO ] Deduced a trap composed of 5 places in 252 ms of which 1 ms to minimize.
[2024-05-29 11:36:56] [INFO ] Deduced a trap composed of 5 places in 255 ms of which 1 ms to minimize.
[2024-05-29 11:36:57] [INFO ] Deduced a trap composed of 5 places in 276 ms of which 1 ms to minimize.
[2024-05-29 11:36:57] [INFO ] Deduced a trap composed of 5 places in 238 ms of which 1 ms to minimize.
[2024-05-29 11:36:57] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 1 ms to minimize.
[2024-05-29 11:36:58] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 0 ms to minimize.
[2024-05-29 11:36:58] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 0 ms to minimize.
[2024-05-29 11:36:58] [INFO ] Deduced a trap composed of 5 places in 211 ms of which 0 ms to minimize.
[2024-05-29 11:36:59] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 0 ms to minimize.
[2024-05-29 11:36:59] [INFO ] Deduced a trap composed of 5 places in 211 ms of which 1 ms to minimize.
[2024-05-29 11:36:59] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 0 ms to minimize.
[2024-05-29 11:37:00] [INFO ] Deduced a trap composed of 6 places in 248 ms of which 1 ms to minimize.
[2024-05-29 11:37:00] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 0 ms to minimize.
[2024-05-29 11:37:00] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 1 ms to minimize.
[2024-05-29 11:37:01] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 1 ms to minimize.
[2024-05-29 11:37:01] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 1 ms to minimize.
[2024-05-29 11:37:01] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 1 ms to minimize.
[2024-05-29 11:37:01] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 1 ms to minimize.
[2024-05-29 11:37:02] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 1 ms to minimize.
[2024-05-29 11:37:02] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 1 ms to minimize.
[2024-05-29 11:37:02] [INFO ] Deduced a trap composed of 5 places in 198 ms of which 1 ms to minimize.
[2024-05-29 11:37:03] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 1 ms to minimize.
[2024-05-29 11:37:03] [INFO ] Deduced a trap composed of 7 places in 242 ms of which 1 ms to minimize.
[2024-05-29 11:37:03] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 2 ms to minimize.
[2024-05-29 11:37:04] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 1 ms to minimize.
[2024-05-29 11:37:04] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 0 ms to minimize.
[2024-05-29 11:37:13] [INFO ] Trap strengthening (SAT) tested/added 32/32 trap constraints in 19531 ms
[2024-05-29 11:37:17] [INFO ] Deduced a trap composed of 17 places in 326 ms of which 0 ms to minimize.
[2024-05-29 11:37:18] [INFO ] Deduced a trap composed of 11 places in 297 ms of which 0 ms to minimize.
[2024-05-29 11:37:19] [INFO ] Deduced a trap composed of 11 places in 302 ms of which 1 ms to minimize.
[2024-05-29 11:37:19] [INFO ] Deduced a trap composed of 11 places in 301 ms of which 1 ms to minimize.
[2024-05-29 11:37:20] [INFO ] Deduced a trap composed of 11 places in 285 ms of which 1 ms to minimize.
[2024-05-29 11:37:21] [INFO ] Deduced a trap composed of 11 places in 282 ms of which 0 ms to minimize.
[2024-05-29 11:37:21] [INFO ] Deduced a trap composed of 11 places in 298 ms of which 0 ms to minimize.
[2024-05-29 11:37:22] [INFO ] Deduced a trap composed of 11 places in 271 ms of which 1 ms to minimize.
[2024-05-29 11:37:23] [INFO ] Deduced a trap composed of 11 places in 276 ms of which 0 ms to minimize.
[2024-05-29 11:37:23] [INFO ] Deduced a trap composed of 11 places in 264 ms of which 0 ms to minimize.
[2024-05-29 11:37:24] [INFO ] Deduced a trap composed of 11 places in 260 ms of which 1 ms to minimize.
[2024-05-29 11:37:25] [INFO ] Deduced a trap composed of 11 places in 246 ms of which 1 ms to minimize.
[2024-05-29 11:37:25] [INFO ] Trap strengthening procedure interrupted after too many repetitions 7848 ms
[2024-05-29 11:37:25] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 7849 ms
[2024-05-29 11:37:25] [INFO ] After 89823ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9077 ms.
[2024-05-29 11:37:34] [INFO ] After 100147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT p1)), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2 (NOT p0)))]
Knowledge based reduction with 10 factoid took 204 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 304 ms :[true, p0, (OR (NOT p2) p1), (AND p0 p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 227 ms :[true, p0, (OR (NOT p2) p1), (AND p0 p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
// Phase 1: matrix 2601 rows 3101 cols
[2024-05-29 11:37:35] [INFO ] Computed 1101 invariants in 9 ms
[2024-05-29 11:37:41] [INFO ] [Real]Absence check using 1101 positive place invariants in 2127 ms returned sat
[2024-05-29 11:37:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:37:50] [INFO ] [Real]Absence check using state equation in 8652 ms returned unknown
Could not prove EG (NOT p2)
Support contains 6 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 165 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2024-05-29 11:37:50] [INFO ] Invariant cache hit.
[2024-05-29 11:37:52] [INFO ] Implicit Places using invariants in 1892 ms returned []
[2024-05-29 11:37:52] [INFO ] Invariant cache hit.
[2024-05-29 11:37:54] [INFO ] Implicit Places using invariants and state equation in 1870 ms returned []
Implicit Place search using SMT with State Equation took 3766 ms to find 0 implicit places.
[2024-05-29 11:37:54] [INFO ] Redundant transitions in 73 ms returned []
[2024-05-29 11:37:54] [INFO ] Invariant cache hit.
[2024-05-29 11:37:56] [INFO ] Dead Transitions using invariants and state equation in 1890 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5907 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 140 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 262 ms :[true, p0, (OR (NOT p2) p1), (AND p0 p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 7) seen :2
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 10000 steps, including 2 resets, run finished after 134 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 140 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 130 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-29 11:37:57] [INFO ] Invariant cache hit.
[2024-05-29 11:37:58] [INFO ] [Real]Absence check using 1101 positive place invariants in 255 ms returned sat
[2024-05-29 11:38:01] [INFO ] After 2544ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2024-05-29 11:38:01] [INFO ] After 2809ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 11:38:01] [INFO ] After 4033ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 11:38:02] [INFO ] [Nat]Absence check using 1101 positive place invariants in 251 ms returned sat
[2024-05-29 11:38:26] [INFO ] After 23861ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 11:38:26] [INFO ] After 23862ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-29 11:38:26] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 113 ms.
Support contains 6 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 893 times.
Drop transitions removed 893 transitions
Iterating global reduction 0 with 893 rules applied. Total rules applied 893 place count 3101 transition count 2601
Applied a total of 893 rules in 305 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 305 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) 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 151 ms. (steps per millisecond=66 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 79530 steps, run timeout after 3007 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79530 steps, saw 78695 distinct states, run finished after 3007 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2024-05-29 11:38:31] [INFO ] Computed 1101 invariants in 37 ms
[2024-05-29 11:38:32] [INFO ] [Real]Absence check using 1045 positive place invariants in 238 ms returned sat
[2024-05-29 11:38:32] [INFO ] [Real]Absence check using 1045 positive and 56 generalized place invariants in 13 ms returned sat
[2024-05-29 11:38:35] [INFO ] After 4500ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 11:38:36] [INFO ] [Nat]Absence check using 1045 positive place invariants in 233 ms returned sat
[2024-05-29 11:38:36] [INFO ] [Nat]Absence check using 1045 positive and 56 generalized place invariants in 13 ms returned sat
[2024-05-29 11:39:00] [INFO ] After 23886ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 11:39:00] [INFO ] After 23892ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-29 11:39:00] [INFO ] After 25049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 183 ms.
Support contains 6 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 167 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 134 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2024-05-29 11:39:01] [INFO ] Invariant cache hit.
[2024-05-29 11:39:03] [INFO ] Implicit Places using invariants in 2288 ms returned []
[2024-05-29 11:39:03] [INFO ] Invariant cache hit.
[2024-05-29 11:39:05] [INFO ] Implicit Places using invariants and state equation in 2159 ms returned []
Implicit Place search using SMT with State Equation took 4451 ms to find 0 implicit places.
[2024-05-29 11:39:05] [INFO ] Redundant transitions in 74 ms returned []
[2024-05-29 11:39:05] [INFO ] Invariant cache hit.
[2024-05-29 11:39:07] [INFO ] Dead Transitions using invariants and state equation in 1897 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6565 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 155 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 5 properties.
[2024-05-29 11:39:07] [INFO ] Invariant cache hit.
[2024-05-29 11:39:08] [INFO ] [Real]Absence check using 1045 positive place invariants in 233 ms returned sat
[2024-05-29 11:39:08] [INFO ] [Real]Absence check using 1045 positive and 56 generalized place invariants in 16 ms returned sat
[2024-05-29 11:39:12] [INFO ] After 4931ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 11:39:13] [INFO ] [Nat]Absence check using 1045 positive place invariants in 241 ms returned sat
[2024-05-29 11:39:13] [INFO ] [Nat]Absence check using 1045 positive and 56 generalized place invariants in 15 ms returned sat
[2024-05-29 11:40:17] [INFO ] After 64492ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2 (NOT p0)))]
Knowledge based reduction with 12 factoid took 228 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 239 ms :[true, p0, (OR (NOT p2) p1), (AND p0 p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 246 ms :[true, p0, (OR (NOT p2) p1), (AND p0 p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
// Phase 1: matrix 2601 rows 3101 cols
[2024-05-29 11:40:18] [INFO ] Computed 1101 invariants in 12 ms
[2024-05-29 11:40:24] [INFO ] [Real]Absence check using 1101 positive place invariants in 2238 ms returned sat
[2024-05-29 11:40:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:40:33] [INFO ] [Real]Absence check using state equation in 8631 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 223 ms :[true, p0, (OR (NOT p2) p1), (AND p0 p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Product exploration explored 100000 steps with 94 reset in 1775 ms.
Product exploration explored 100000 steps with 94 reset in 2237 ms.
Built C files in :
/tmp/ltsmin11629017731908150544
[2024-05-29 11:40:37] [INFO ] Too many transitions (2601) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:40:37] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11629017731908150544
Running compilation step : cd /tmp/ltsmin11629017731908150544;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin11629017731908150544;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin11629017731908150544;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 141 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2024-05-29 11:40:40] [INFO ] Invariant cache hit.
[2024-05-29 11:40:42] [INFO ] Implicit Places using invariants in 1892 ms returned []
[2024-05-29 11:40:42] [INFO ] Invariant cache hit.
[2024-05-29 11:40:44] [INFO ] Implicit Places using invariants and state equation in 1957 ms returned []
Implicit Place search using SMT with State Equation took 3851 ms to find 0 implicit places.
[2024-05-29 11:40:44] [INFO ] Redundant transitions in 71 ms returned []
[2024-05-29 11:40:44] [INFO ] Invariant cache hit.
[2024-05-29 11:40:46] [INFO ] Dead Transitions using invariants and state equation in 1897 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5976 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Built C files in :
/tmp/ltsmin3727726452716566307
[2024-05-29 11:40:46] [INFO ] Too many transitions (2601) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:40:46] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3727726452716566307
Running compilation step : cd /tmp/ltsmin3727726452716566307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3727726452716566307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3727726452716566307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 11:40:49] [INFO ] Flatten gal took : 136 ms
[2024-05-29 11:40:49] [INFO ] Flatten gal took : 120 ms
[2024-05-29 11:40:49] [INFO ] Time to serialize gal into /tmp/LTL5323071426599987423.gal : 12 ms
[2024-05-29 11:40:49] [INFO ] Time to serialize properties into /tmp/LTL6127306356486218115.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5323071426599987423.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2150921202339898917.hoa' '-atoms' '/tmp/LTL6127306356486218115.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6127306356486218115.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2150921202339898917.hoa
Detected timeout of ITS tools.
[2024-05-29 11:41:05] [INFO ] Flatten gal took : 124 ms
[2024-05-29 11:41:05] [INFO ] Flatten gal took : 115 ms
[2024-05-29 11:41:05] [INFO ] Time to serialize gal into /tmp/LTL1112920235451783293.gal : 11 ms
[2024-05-29 11:41:05] [INFO ] Time to serialize properties into /tmp/LTL9263194345767903233.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1112920235451783293.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9263194345767903233.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((!(X((G("((p415==1)&&(p417==1))"))U("((p51==1)&&(p72==1))"))))U("((p2484==1)&&(p2505==1))")))
Formula 0 simplified : !"((p2484==1)&&(p2505==1))" & X(!"((p2484==1)&&(p2505==1))" W (G"((p415==1)&&(p417==1))" U "((p51==1)&&(p72==1))"))
Detected timeout of ITS tools.
[2024-05-29 11:41:20] [INFO ] Flatten gal took : 117 ms
[2024-05-29 11:41:20] [INFO ] Applying decomposition
[2024-05-29 11:41:20] [INFO ] Flatten gal took : 118 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10305777804091792496.txt' '-o' '/tmp/graph10305777804091792496.bin' '-w' '/tmp/graph10305777804091792496.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10305777804091792496.bin' '-l' '-1' '-v' '-w' '/tmp/graph10305777804091792496.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:41:20] [INFO ] Decomposing Gal with order
[2024-05-29 11:41:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:41:20] [INFO ] Removed a total of 600 redundant transitions.
[2024-05-29 11:41:21] [INFO ] Flatten gal took : 110 ms
[2024-05-29 11:41:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 153 ms.
[2024-05-29 11:41:21] [INFO ] Time to serialize gal into /tmp/LTL17384473484877977070.gal : 22 ms
[2024-05-29 11:41:21] [INFO ] Time to serialize properties into /tmp/LTL9491437348867343600.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17384473484877977070.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9491437348867343600.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((!(X((G("((i8.u147.p415==1)&&(i8.u148.p417==1))"))U("((i1.i0.i1.u19.p51==1)&&(i1.i1.i1.u26.p72==1))"))))U("((i44.i0.i2.u881.p2484==...189
Formula 0 simplified : !"((i44.i0.i2.u881.p2484==1)&&(i44.i0.i2.u889.p2505==1))" & X(!"((i44.i0.i2.u881.p2484==1)&&(i44.i0.i2.u889.p2505==1))" W (G"((i8.u1...240
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8618486130190875323
[2024-05-29 11:41:36] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8618486130190875323
Running compilation step : cd /tmp/ltsmin8618486130190875323;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin8618486130190875323;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin8618486130190875323;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPs-PT-100A-LTLFireability-12 finished in 432624 ms.
[2024-05-29 11:41:39] [INFO ] Flatten gal took : 130 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11160544672372115642
[2024-05-29 11:41:39] [INFO ] Too many transitions (2603) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:41:39] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11160544672372115642
Running compilation step : cd /tmp/ltsmin11160544672372115642;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '90' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 11:41:39] [INFO ] Applying decomposition
[2024-05-29 11:41:39] [INFO ] Flatten gal took : 136 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11631500996712503633.txt' '-o' '/tmp/graph11631500996712503633.bin' '-w' '/tmp/graph11631500996712503633.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11631500996712503633.bin' '-l' '-1' '-v' '-w' '/tmp/graph11631500996712503633.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:41:39] [INFO ] Decomposing Gal with order
[2024-05-29 11:41:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:41:40] [INFO ] Removed a total of 600 redundant transitions.
[2024-05-29 11:41:40] [INFO ] Flatten gal took : 118 ms
[2024-05-29 11:41:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 1204 labels/synchronizations in 199 ms.
[2024-05-29 11:41:40] [INFO ] Time to serialize gal into /tmp/LTLFireability74591769427578917.gal : 23 ms
[2024-05-29 11:41:40] [INFO ] Time to serialize properties into /tmp/LTLFireability16324627691628907584.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability74591769427578917.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16324627691628907584.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 8 LTL properties
Checking formula 0 : !((F(("((i4.i1.i3.u94.p265==1)&&(i4.i1.i2.u95.p267==1))")||(X((F("(i1.i0.i3.u22.p63==1)"))||(G("(((i1.i0.i3.u22.p63==1)||((i4.i1.i3.u9...225
Formula 0 simplified : G(!"((i4.i1.i3.u94.p265==1)&&(i4.i1.i2.u95.p267==1))" & X(G!"(i1.i0.i3.u22.p63==1)" & F!"(((i1.i0.i3.u22.p63==1)||((i4.i1.i3.u94.p26...215
Compilation finished in 6478 ms.
Running link step : cd /tmp/ltsmin11160544672372115642;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin11160544672372115642;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)||X((<>((LTLAPp1==true))||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>450 s) on command cd /tmp/ltsmin11160544672372115642;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)||X((<>((LTLAPp1==true))||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11160544672372115642;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp3==true)&&[](<>((LTLAPp4==true)))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9213892 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16033316 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-100A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ShieldPPPs-PT-100A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683789000323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-100A.tgz
mv ShieldPPPs-PT-100A execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;