About the Execution of 2023-gold for ShieldIIPs-PT-100A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8511.880 | 3600000.00 | 7126719.00 | 18078.10 | F??FFF??FF??FF?F | 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-171683788500103.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 ShieldIIPs-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-171683788500103
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.8K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 11 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 15:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 15:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 868K 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 ShieldIIPs-PT-100A-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716948067412
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=ShieldIIPs-PT-100A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 02:01:09] [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 02:01:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 02:01:09] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2024-05-29 02:01:09] [INFO ] Transformed 2503 places.
[2024-05-29 02:01:09] [INFO ] Transformed 2403 transitions.
[2024-05-29 02:01:09] [INFO ] Found NUPN structural information;
[2024-05-29 02:01:09] [INFO ] Parsed PT model containing 2503 places and 2403 transitions and 10806 arcs in 316 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 1 formulas.
FORMULA ShieldIIPs-PT-100A-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 245 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2024-05-29 02:01:10] [INFO ] Computed 901 invariants in 40 ms
[2024-05-29 02:01:12] [INFO ] Implicit Places using invariants in 1701 ms returned []
[2024-05-29 02:01:12] [INFO ] Invariant cache hit.
[2024-05-29 02:01:13] [INFO ] Implicit Places using invariants and state equation in 1934 ms returned []
Implicit Place search using SMT with State Equation took 3678 ms to find 0 implicit places.
[2024-05-29 02:01:14] [INFO ] Invariant cache hit.
[2024-05-29 02:01:15] [INFO ] Dead Transitions using invariants and state equation in 1594 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5521 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Support contains 66 out of 2503 places after structural reductions.
[2024-05-29 02:01:16] [INFO ] Flatten gal took : 334 ms
[2024-05-29 02:01:16] [INFO ] Flatten gal took : 195 ms
[2024-05-29 02:01:16] [INFO ] Input system was already deterministic with 2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 712 ms. (steps per millisecond=14 ) properties (out of 35) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 14) 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 14) 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 14) 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 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 14) 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 14) 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 14) 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 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 133 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 131 ms. (steps per millisecond=76 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2024-05-29 02:01:19] [INFO ] Invariant cache hit.
[2024-05-29 02:01:20] [INFO ] [Real]Absence check using 901 positive place invariants in 161 ms returned sat
[2024-05-29 02:01:20] [INFO ] After 1323ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-29 02:01:21] [INFO ] [Nat]Absence check using 901 positive place invariants in 206 ms returned sat
[2024-05-29 02:01:41] [INFO ] After 19263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-05-29 02:01:42] [INFO ] Deduced a trap composed of 9 places in 308 ms of which 7 ms to minimize.
[2024-05-29 02:01:42] [INFO ] Deduced a trap composed of 9 places in 383 ms of which 1 ms to minimize.
[2024-05-29 02:01:42] [INFO ] Deduced a trap composed of 11 places in 293 ms of which 2 ms to minimize.
[2024-05-29 02:01:43] [INFO ] Deduced a trap composed of 11 places in 403 ms of which 2 ms to minimize.
[2024-05-29 02:01:44] [INFO ] Deduced a trap composed of 11 places in 525 ms of which 2 ms to minimize.
[2024-05-29 02:01:44] [INFO ] Deduced a trap composed of 11 places in 272 ms of which 0 ms to minimize.
[2024-05-29 02:01:44] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 6 ms to minimize.
[2024-05-29 02:01:44] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 3 ms to minimize.
[2024-05-29 02:01:45] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 4 ms to minimize.
[2024-05-29 02:01:45] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 0 ms to minimize.
[2024-05-29 02:01:45] [INFO ] Deduced a trap composed of 19 places in 232 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 02:01:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:01:45] [INFO ] After 25131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 2 properties in 3743 ms.
Support contains 23 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 40 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 685 times.
Drop transitions removed 685 transitions
Iterating global reduction 0 with 685 rules applied. Total rules applied 689 place count 2501 transition count 2401
Applied a total of 689 rules in 428 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 428 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 10) 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 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 10) 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 10) 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 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-29 02:01:51] [INFO ] Computed 901 invariants in 174 ms
[2024-05-29 02:01:53] [INFO ] [Real]Absence check using 893 positive place invariants in 183 ms returned sat
[2024-05-29 02:01:53] [INFO ] [Real]Absence check using 893 positive and 8 generalized place invariants in 19 ms returned sat
[2024-05-29 02:01:53] [INFO ] After 1141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-29 02:01:54] [INFO ] [Nat]Absence check using 893 positive place invariants in 201 ms returned sat
[2024-05-29 02:01:54] [INFO ] [Nat]Absence check using 893 positive and 8 generalized place invariants in 8 ms returned sat
[2024-05-29 02:02:18] [INFO ] After 23609ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 02:02:18] [INFO ] State equation strengthened by 4 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 02:02:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:02:18] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 898 ms.
Support contains 20 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2501 transition count 2401
Applied a total of 2 rules in 191 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 10) 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 10) 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 10) 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 10) 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 10) 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 10) 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 10) 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 10) 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 10) 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 10) seen :0
Interrupted probabilistic random walk after 98127 steps, run timeout after 3002 ms. (steps per millisecond=32 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 8=1, 9=1}
Probabilistic random walk after 98127 steps, saw 96615 distinct states, run finished after 3003 ms. (steps per millisecond=32 ) properties seen :8
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-29 02:02:24] [INFO ] Computed 901 invariants in 26 ms
[2024-05-29 02:02:24] [INFO ] [Real]Absence check using 895 positive place invariants in 189 ms returned sat
[2024-05-29 02:02:24] [INFO ] [Real]Absence check using 895 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-29 02:02:26] [INFO ] After 2298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:02:26] [INFO ] [Nat]Absence check using 895 positive place invariants in 189 ms returned sat
[2024-05-29 02:02:26] [INFO ] [Nat]Absence check using 895 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-29 02:02:42] [INFO ] After 15820ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:02:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 02:02:42] [INFO ] After 90ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 02:02:43] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 0 ms to minimize.
[2024-05-29 02:02:43] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 1 ms to minimize.
[2024-05-29 02:02:43] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 1 ms to minimize.
[2024-05-29 02:02:44] [INFO ] Deduced a trap composed of 9 places in 220 ms of which 0 ms to minimize.
[2024-05-29 02:02:44] [INFO ] Deduced a trap composed of 6 places in 220 ms of which 0 ms to minimize.
[2024-05-29 02:02:47] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 4 ms to minimize.
[2024-05-29 02:02:47] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 0 ms to minimize.
[2024-05-29 02:02:48] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 0 ms to minimize.
[2024-05-29 02:02:48] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 0 ms to minimize.
[2024-05-29 02:02:48] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 1 ms to minimize.
[2024-05-29 02:02:48] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
[2024-05-29 02:02:49] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 1 ms to minimize.
[2024-05-29 02:02:49] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 1 ms to minimize.
[2024-05-29 02:02:49] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
[2024-05-29 02:02:49] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 1 ms to minimize.
[2024-05-29 02:02:49] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 0 ms to minimize.
[2024-05-29 02:02:50] [INFO ] Deduced a trap composed of 6 places in 232 ms of which 1 ms to minimize.
[2024-05-29 02:02:51] [INFO ] Trap strengthening (SAT) tested/added 17/17 trap constraints in 8325 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 02:02:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:02:51] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 294 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 2501 transition count 2401
Applied a total of 7 rules in 194 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 325 ms. (steps per millisecond=30 ) 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 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 131328 steps, run timeout after 3002 ms. (steps per millisecond=43 ) properties seen :{1=1}
Probabilistic random walk after 131328 steps, saw 129442 distinct states, run finished after 3005 ms. (steps per millisecond=43 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-29 02:02:55] [INFO ] Computed 901 invariants in 28 ms
[2024-05-29 02:02:56] [INFO ] [Real]Absence check using 900 positive place invariants in 203 ms returned sat
[2024-05-29 02:02:56] [INFO ] [Real]Absence check using 900 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-29 02:02:57] [INFO ] After 2177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:02:58] [INFO ] [Nat]Absence check using 900 positive place invariants in 198 ms returned sat
[2024-05-29 02:02:58] [INFO ] [Nat]Absence check using 900 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-29 02:03:08] [INFO ] After 10989ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2501 transition count 2401
Applied a total of 1 rules in 200 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 2501/2501 places, 2401/2401 transitions.
FORMULA ShieldIIPs-PT-100A-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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(G(p0))||G(p1)))'
Support contains 8 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
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 2 place count 2502 transition count 2402
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 2501 transition count 2401
Applied a total of 4 rules in 214 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-29 02:03:09] [INFO ] Computed 901 invariants in 14 ms
[2024-05-29 02:03:10] [INFO ] Implicit Places using invariants in 1448 ms returned []
[2024-05-29 02:03:10] [INFO ] Invariant cache hit.
[2024-05-29 02:03:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 02:03:13] [INFO ] Implicit Places using invariants and state equation in 2098 ms returned []
Implicit Place search using SMT with State Equation took 3559 ms to find 0 implicit places.
[2024-05-29 02:03:13] [INFO ] Redundant transitions in 445 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2501 cols
[2024-05-29 02:03:13] [INFO ] Computed 901 invariants in 7 ms
[2024-05-29 02:03:14] [INFO ] Dead Transitions using invariants and state equation in 1473 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2503 places, 2400/2403 transitions.
Applied a total of 0 rules in 102 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5802 ms. Remains : 2501/2503 places, 2400/2403 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 206 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (EQ s2411 0) (EQ s2417 0) (EQ s2427 0)) (OR (EQ s461 0) (EQ s467 0) (EQ s477 0))), p0:(AND (EQ s1430 1) (EQ s1443 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4927 steps with 0 reset in 114 ms.
FORMULA ShieldIIPs-PT-100A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLFireability-00 finished in 6207 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&&X(p1)))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 74 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2024-05-29 02:03:15] [INFO ] Computed 901 invariants in 14 ms
[2024-05-29 02:03:17] [INFO ] Implicit Places using invariants in 1481 ms returned []
[2024-05-29 02:03:17] [INFO ] Invariant cache hit.
[2024-05-29 02:03:19] [INFO ] Implicit Places using invariants and state equation in 2058 ms returned []
Implicit Place search using SMT with State Equation took 3549 ms to find 0 implicit places.
[2024-05-29 02:03:19] [INFO ] Invariant cache hit.
[2024-05-29 02:03:20] [INFO ] Dead Transitions using invariants and state equation in 1487 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5112 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s2150 0), p1:(OR (EQ s936 0) (EQ s940 0) (EQ s951 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33419 reset in 6774 ms.
Product exploration explored 100000 steps with 33351 reset in 6619 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 (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 96 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 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 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 02:03:35] [INFO ] Invariant cache hit.
[2024-05-29 02:03:35] [INFO ] [Real]Absence check using 901 positive place invariants in 196 ms returned sat
[2024-05-29 02:03:37] [INFO ] After 2273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:03:37] [INFO ] [Nat]Absence check using 901 positive place invariants in 190 ms returned sat
[2024-05-29 02:03:39] [INFO ] After 1520ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 02:03:39] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-29 02:03:39] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 02:03:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 337 ms
[2024-05-29 02:03:40] [INFO ] After 2133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 315 ms.
[2024-05-29 02:03:40] [INFO ] After 3174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 233 ms.
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
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 2501 transition count 2401
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 0 with 695 rules applied. Total rules applied 699 place count 2501 transition count 2401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 700 place count 2500 transition count 2400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 701 place count 2499 transition count 2400
Applied a total of 701 rules in 377 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 377 ms. Remains : 2499/2503 places, 2400/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 2) 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 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
Interrupted probabilistic random walk after 111775 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 111775 steps, saw 110073 distinct states, run finished after 3003 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2024-05-29 02:03:44] [INFO ] Computed 900 invariants in 22 ms
[2024-05-29 02:03:45] [INFO ] [Real]Absence check using 897 positive place invariants in 183 ms returned sat
[2024-05-29 02:03:45] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:03:46] [INFO ] After 2161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:03:47] [INFO ] [Nat]Absence check using 897 positive place invariants in 185 ms returned sat
[2024-05-29 02:03:47] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:03:49] [INFO ] After 1412ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 02:03:49] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 1 ms to minimize.
[2024-05-29 02:03:49] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 1 ms to minimize.
[2024-05-29 02:03:49] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 4 ms to minimize.
[2024-05-29 02:03:50] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 1 ms to minimize.
[2024-05-29 02:03:50] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 0 ms to minimize.
[2024-05-29 02:03:50] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 0 ms to minimize.
[2024-05-29 02:03:50] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 0 ms to minimize.
[2024-05-29 02:03:51] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 0 ms to minimize.
[2024-05-29 02:03:51] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 1 ms to minimize.
[2024-05-29 02:03:51] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 0 ms to minimize.
[2024-05-29 02:03:52] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 0 ms to minimize.
[2024-05-29 02:03:52] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 0 ms to minimize.
[2024-05-29 02:03:52] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 0 ms to minimize.
[2024-05-29 02:03:52] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 1 ms to minimize.
[2024-05-29 02:03:53] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 0 ms to minimize.
[2024-05-29 02:03:53] [INFO ] Deduced a trap composed of 17 places in 211 ms of which 0 ms to minimize.
[2024-05-29 02:03:53] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 0 ms to minimize.
[2024-05-29 02:03:53] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 0 ms to minimize.
[2024-05-29 02:03:54] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 0 ms to minimize.
[2024-05-29 02:03:54] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 2 ms to minimize.
[2024-05-29 02:03:54] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 0 ms to minimize.
[2024-05-29 02:03:54] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 1 ms to minimize.
[2024-05-29 02:03:54] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 0 ms to minimize.
[2024-05-29 02:03:55] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 1 ms to minimize.
[2024-05-29 02:03:55] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 0 ms to minimize.
[2024-05-29 02:03:55] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2024-05-29 02:03:55] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 0 ms to minimize.
[2024-05-29 02:03:55] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 0 ms to minimize.
[2024-05-29 02:03:55] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2024-05-29 02:03:56] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 0 ms to minimize.
[2024-05-29 02:03:56] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 7177 ms
[2024-05-29 02:03:56] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 0 ms to minimize.
[2024-05-29 02:03:56] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 0 ms to minimize.
[2024-05-29 02:03:56] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 3 ms to minimize.
[2024-05-29 02:03:57] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-05-29 02:03:57] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 3 ms to minimize.
[2024-05-29 02:03:57] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2024-05-29 02:03:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1168 ms
[2024-05-29 02:03:57] [INFO ] After 9908ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 162 ms.
[2024-05-29 02:03:57] [INFO ] After 10800ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 112 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 75 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 86 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-29 02:03:57] [INFO ] Invariant cache hit.
[2024-05-29 02:03:59] [INFO ] Implicit Places using invariants in 1858 ms returned []
[2024-05-29 02:03:59] [INFO ] Invariant cache hit.
[2024-05-29 02:04:04] [INFO ] Implicit Places using invariants and state equation in 4256 ms returned []
Implicit Place search using SMT with State Equation took 6121 ms to find 0 implicit places.
[2024-05-29 02:04:04] [INFO ] Redundant transitions in 220 ms returned []
[2024-05-29 02:04:04] [INFO ] Invariant cache hit.
[2024-05-29 02:04:05] [INFO ] Dead Transitions using invariants and state equation in 1444 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7882 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 77 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-29 02:04:05] [INFO ] Invariant cache hit.
[2024-05-29 02:04:06] [INFO ] [Real]Absence check using 897 positive place invariants in 180 ms returned sat
[2024-05-29 02:04:06] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:04:08] [INFO ] After 2165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:04:08] [INFO ] [Nat]Absence check using 897 positive place invariants in 170 ms returned sat
[2024-05-29 02:04:08] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:04:10] [INFO ] After 2219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 02:04:11] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 4 ms to minimize.
[2024-05-29 02:04:11] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2024-05-29 02:04:11] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2024-05-29 02:04:11] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 0 ms to minimize.
[2024-05-29 02:04:12] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 0 ms to minimize.
[2024-05-29 02:04:12] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 0 ms to minimize.
[2024-05-29 02:04:12] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 1 ms to minimize.
[2024-05-29 02:04:12] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 0 ms to minimize.
[2024-05-29 02:04:13] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 0 ms to minimize.
[2024-05-29 02:04:13] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 1 ms to minimize.
[2024-05-29 02:04:13] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2024-05-29 02:04:13] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 1 ms to minimize.
[2024-05-29 02:04:14] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 1 ms to minimize.
[2024-05-29 02:04:14] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 1 ms to minimize.
[2024-05-29 02:04:14] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 0 ms to minimize.
[2024-05-29 02:04:14] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 0 ms to minimize.
[2024-05-29 02:04:14] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 0 ms to minimize.
[2024-05-29 02:04:15] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 0 ms to minimize.
[2024-05-29 02:04:15] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2024-05-29 02:04:15] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 0 ms to minimize.
[2024-05-29 02:04:15] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 0 ms to minimize.
[2024-05-29 02:04:15] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 0 ms to minimize.
[2024-05-29 02:04:16] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-29 02:04:16] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 1 ms to minimize.
[2024-05-29 02:04:16] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-29 02:04:16] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 02:04:16] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-29 02:04:16] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 5823 ms
[2024-05-29 02:04:16] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 0 ms to minimize.
[2024-05-29 02:04:17] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-29 02:04:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 348 ms
[2024-05-29 02:04:17] [INFO ] After 8527ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 171 ms.
[2024-05-29 02:04:17] [INFO ] After 9407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 7 factoid took 126 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 64 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2024-05-29 02:04:17] [INFO ] Computed 901 invariants in 10 ms
[2024-05-29 02:04:19] [INFO ] Implicit Places using invariants in 1482 ms returned []
[2024-05-29 02:04:19] [INFO ] Invariant cache hit.
[2024-05-29 02:04:21] [INFO ] Implicit Places using invariants and state equation in 2157 ms returned []
Implicit Place search using SMT with State Equation took 3645 ms to find 0 implicit places.
[2024-05-29 02:04:21] [INFO ] Invariant cache hit.
[2024-05-29 02:04:23] [INFO ] Dead Transitions using invariants and state equation in 1450 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5167 ms. Remains : 2503/2503 places, 2403/2403 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 p0 p1), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 113 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 02:04:23] [INFO ] Invariant cache hit.
[2024-05-29 02:04:24] [INFO ] [Real]Absence check using 901 positive place invariants in 188 ms returned sat
[2024-05-29 02:04:25] [INFO ] After 1961ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:04:26] [INFO ] [Nat]Absence check using 901 positive place invariants in 191 ms returned sat
[2024-05-29 02:04:27] [INFO ] After 1353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:04:27] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-29 02:04:28] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 02:04:28] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-29 02:04:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 515 ms
[2024-05-29 02:04:28] [INFO ] After 2051ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 139 ms.
[2024-05-29 02:04:28] [INFO ] After 2875ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 143 ms.
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
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 2501 transition count 2401
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 0 with 695 rules applied. Total rules applied 699 place count 2501 transition count 2401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 700 place count 2500 transition count 2400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 701 place count 2499 transition count 2400
Applied a total of 701 rules in 355 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 356 ms. Remains : 2499/2503 places, 2400/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 136625 steps, run timeout after 3004 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 136625 steps, saw 134676 distinct states, run finished after 3005 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2024-05-29 02:04:32] [INFO ] Computed 900 invariants in 16 ms
[2024-05-29 02:04:33] [INFO ] [Real]Absence check using 897 positive place invariants in 185 ms returned sat
[2024-05-29 02:04:33] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-29 02:04:34] [INFO ] After 2047ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:04:35] [INFO ] [Nat]Absence check using 897 positive place invariants in 187 ms returned sat
[2024-05-29 02:04:35] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:04:36] [INFO ] After 1321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:04:36] [INFO ] Deduced a trap composed of 8 places in 283 ms of which 1 ms to minimize.
[2024-05-29 02:04:37] [INFO ] Deduced a trap composed of 8 places in 286 ms of which 0 ms to minimize.
[2024-05-29 02:04:37] [INFO ] Deduced a trap composed of 24 places in 278 ms of which 1 ms to minimize.
[2024-05-29 02:04:37] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 1 ms to minimize.
[2024-05-29 02:04:38] [INFO ] Deduced a trap composed of 14 places in 251 ms of which 0 ms to minimize.
[2024-05-29 02:04:38] [INFO ] Deduced a trap composed of 17 places in 273 ms of which 1 ms to minimize.
[2024-05-29 02:04:38] [INFO ] Deduced a trap composed of 11 places in 272 ms of which 1 ms to minimize.
[2024-05-29 02:04:39] [INFO ] Deduced a trap composed of 9 places in 262 ms of which 1 ms to minimize.
[2024-05-29 02:04:39] [INFO ] Deduced a trap composed of 17 places in 263 ms of which 1 ms to minimize.
[2024-05-29 02:04:39] [INFO ] Deduced a trap composed of 9 places in 269 ms of which 1 ms to minimize.
[2024-05-29 02:04:40] [INFO ] Deduced a trap composed of 8 places in 271 ms of which 1 ms to minimize.
[2024-05-29 02:04:40] [INFO ] Deduced a trap composed of 17 places in 251 ms of which 1 ms to minimize.
[2024-05-29 02:04:40] [INFO ] Deduced a trap composed of 17 places in 254 ms of which 1 ms to minimize.
[2024-05-29 02:04:41] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 0 ms to minimize.
[2024-05-29 02:04:41] [INFO ] Deduced a trap composed of 8 places in 233 ms of which 1 ms to minimize.
[2024-05-29 02:04:41] [INFO ] Deduced a trap composed of 17 places in 226 ms of which 0 ms to minimize.
[2024-05-29 02:04:42] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 0 ms to minimize.
[2024-05-29 02:04:42] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 0 ms to minimize.
[2024-05-29 02:04:42] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 0 ms to minimize.
[2024-05-29 02:04:42] [INFO ] Deduced a trap composed of 29 places in 156 ms of which 0 ms to minimize.
[2024-05-29 02:04:43] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 1 ms to minimize.
[2024-05-29 02:04:43] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 1 ms to minimize.
[2024-05-29 02:04:43] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 0 ms to minimize.
[2024-05-29 02:04:43] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 0 ms to minimize.
[2024-05-29 02:04:44] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 0 ms to minimize.
[2024-05-29 02:04:44] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 0 ms to minimize.
[2024-05-29 02:04:44] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 1 ms to minimize.
[2024-05-29 02:04:44] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2024-05-29 02:04:44] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 0 ms to minimize.
[2024-05-29 02:04:45] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 1 ms to minimize.
[2024-05-29 02:04:45] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 1 ms to minimize.
[2024-05-29 02:04:45] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 0 ms to minimize.
[2024-05-29 02:04:45] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 1 ms to minimize.
[2024-05-29 02:04:45] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 0 ms to minimize.
[2024-05-29 02:04:45] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 9477 ms
[2024-05-29 02:04:46] [INFO ] After 10862ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2024-05-29 02:04:46] [INFO ] After 11619ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 42 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 77 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 75 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-29 02:04:46] [INFO ] Invariant cache hit.
[2024-05-29 02:04:48] [INFO ] Implicit Places using invariants in 1852 ms returned []
[2024-05-29 02:04:48] [INFO ] Invariant cache hit.
[2024-05-29 02:04:52] [INFO ] Implicit Places using invariants and state equation in 4135 ms returned []
Implicit Place search using SMT with State Equation took 5989 ms to find 0 implicit places.
[2024-05-29 02:04:52] [INFO ] Redundant transitions in 94 ms returned []
[2024-05-29 02:04:52] [INFO ] Invariant cache hit.
[2024-05-29 02:04:53] [INFO ] Dead Transitions using invariants and state equation in 1554 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7727 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 84 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 02:04:54] [INFO ] Invariant cache hit.
[2024-05-29 02:04:54] [INFO ] [Real]Absence check using 897 positive place invariants in 181 ms returned sat
[2024-05-29 02:04:54] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-29 02:04:56] [INFO ] After 1987ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:04:56] [INFO ] [Nat]Absence check using 897 positive place invariants in 186 ms returned sat
[2024-05-29 02:04:56] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:04:58] [INFO ] After 1274ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:04:58] [INFO ] Deduced a trap composed of 8 places in 297 ms of which 1 ms to minimize.
[2024-05-29 02:04:58] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 0 ms to minimize.
[2024-05-29 02:04:58] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
[2024-05-29 02:04:59] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 1 ms to minimize.
[2024-05-29 02:04:59] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 1 ms to minimize.
[2024-05-29 02:04:59] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 0 ms to minimize.
[2024-05-29 02:04:59] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 0 ms to minimize.
[2024-05-29 02:05:00] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 1 ms to minimize.
[2024-05-29 02:05:03] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2024-05-29 02:05:04] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 0 ms to minimize.
[2024-05-29 02:05:04] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 0 ms to minimize.
[2024-05-29 02:05:04] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2024-05-29 02:05:04] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 0 ms to minimize.
[2024-05-29 02:05:05] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2024-05-29 02:05:05] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 1 ms to minimize.
[2024-05-29 02:05:05] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 1 ms to minimize.
[2024-05-29 02:05:05] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 0 ms to minimize.
[2024-05-29 02:05:05] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-29 02:05:05] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 02:05:06] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 0 ms to minimize.
[2024-05-29 02:05:06] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2024-05-29 02:05:06] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 0 ms to minimize.
[2024-05-29 02:05:06] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2024-05-29 02:05:06] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-29 02:05:06] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-29 02:05:07] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2024-05-29 02:05:07] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 0 ms to minimize.
[2024-05-29 02:05:07] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
[2024-05-29 02:05:07] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 9496 ms
[2024-05-29 02:05:07] [INFO ] After 10829ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 169 ms.
[2024-05-29 02:05:07] [INFO ] After 11680ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 7 factoid took 156 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33400 reset in 6396 ms.
Product exploration explored 100000 steps with 33547 reset in 6686 ms.
Built C files in :
/tmp/ltsmin6289385180385185208
[2024-05-29 02:05:21] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6289385180385185208
Running compilation step : cd /tmp/ltsmin6289385180385185208;'/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/ltsmin6289385180385185208;'/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/ltsmin6289385180385185208;'/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 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 82 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2024-05-29 02:05:24] [INFO ] Computed 901 invariants in 8 ms
[2024-05-29 02:05:26] [INFO ] Implicit Places using invariants in 1524 ms returned []
[2024-05-29 02:05:26] [INFO ] Invariant cache hit.
[2024-05-29 02:05:28] [INFO ] Implicit Places using invariants and state equation in 2143 ms returned []
Implicit Place search using SMT with State Equation took 3667 ms to find 0 implicit places.
[2024-05-29 02:05:28] [INFO ] Invariant cache hit.
[2024-05-29 02:05:29] [INFO ] Dead Transitions using invariants and state equation in 1577 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5329 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Built C files in :
/tmp/ltsmin18423916167425419340
[2024-05-29 02:05:30] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18423916167425419340
Running compilation step : cd /tmp/ltsmin18423916167425419340;'/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/ltsmin18423916167425419340;'/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/ltsmin18423916167425419340;'/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 02:05:33] [INFO ] Flatten gal took : 169 ms
[2024-05-29 02:05:33] [INFO ] Flatten gal took : 145 ms
[2024-05-29 02:05:33] [INFO ] Time to serialize gal into /tmp/LTL5894946148238229783.gal : 22 ms
[2024-05-29 02:05:33] [INFO ] Time to serialize properties into /tmp/LTL11936363577082942089.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/LTL5894946148238229783.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1990367682110087888.hoa' '-atoms' '/tmp/LTL11936363577082942089.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/LTL11936363577082942089.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1990367682110087888.hoa
Detected timeout of ITS tools.
[2024-05-29 02:05:48] [INFO ] Flatten gal took : 132 ms
[2024-05-29 02:05:48] [INFO ] Flatten gal took : 130 ms
[2024-05-29 02:05:48] [INFO ] Time to serialize gal into /tmp/LTL13398186623611845375.gal : 17 ms
[2024-05-29 02:05:48] [INFO ] Time to serialize properties into /tmp/LTL15818100539192676185.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/LTL13398186623611845375.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15818100539192676185.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 : !((G(F(("(p2150==0)")&&(X("(((p936==0)||(p940==0))||(p951==0))"))))))
Formula 0 simplified : FG(!"(p2150==0)" | X!"(((p936==0)||(p940==0))||(p951==0))")
Detected timeout of ITS tools.
[2024-05-29 02:06:04] [INFO ] Flatten gal took : 160 ms
[2024-05-29 02:06:04] [INFO ] Applying decomposition
[2024-05-29 02:06:04] [INFO ] Flatten gal took : 145 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/graph18347461874861592316.txt' '-o' '/tmp/graph18347461874861592316.bin' '-w' '/tmp/graph18347461874861592316.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18347461874861592316.bin' '-l' '-1' '-v' '-w' '/tmp/graph18347461874861592316.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:06:04] [INFO ] Decomposing Gal with order
[2024-05-29 02:06:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:06:05] [INFO ] Removed a total of 1600 redundant transitions.
[2024-05-29 02:06:05] [INFO ] Flatten gal took : 272 ms
[2024-05-29 02:06:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 1532 labels/synchronizations in 438 ms.
[2024-05-29 02:06:05] [INFO ] Time to serialize gal into /tmp/LTL4185584393620394143.gal : 45 ms
[2024-05-29 02:06:05] [INFO ] Time to serialize properties into /tmp/LTL14438102276995648394.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/LTL4185584393620394143.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14438102276995648394.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(("(i37.i1.i0.u774.p2150==0)")&&(X("(((i16.i0.i0.u337.p936==0)||(i16.i0.i0.u339.p940==0))||(i16.i0.i2.u342.p951==0))"))))))
Formula 0 simplified : FG(!"(i37.i1.i0.u774.p2150==0)" | X!"(((i16.i0.i0.u337.p936==0)||(i16.i0.i0.u339.p940==0))||(i16.i0.i2.u342.p951==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10050386306426634916
[2024-05-29 02:06:21] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10050386306426634916
Running compilation step : cd /tmp/ltsmin10050386306426634916;'/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/ltsmin10050386306426634916;'/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/ltsmin10050386306426634916;'/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 ShieldIIPs-PT-100A-LTLFireability-01 finished in 188588 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(G(p1)))))'
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
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 4 place count 2501 transition count 2401
Applied a total of 4 rules in 244 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-29 02:06:24] [INFO ] Computed 901 invariants in 6 ms
[2024-05-29 02:06:25] [INFO ] Implicit Places using invariants in 1470 ms returned []
[2024-05-29 02:06:25] [INFO ] Invariant cache hit.
[2024-05-29 02:06:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 02:06:27] [INFO ] Implicit Places using invariants and state equation in 2215 ms returned []
Implicit Place search using SMT with State Equation took 3697 ms to find 0 implicit places.
[2024-05-29 02:06:28] [INFO ] Redundant transitions in 310 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2501 cols
[2024-05-29 02:06:28] [INFO ] Computed 901 invariants in 5 ms
[2024-05-29 02:06:29] [INFO ] Dead Transitions using invariants and state equation in 1549 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2503 places, 2400/2403 transitions.
Applied a total of 0 rules in 82 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5894 ms. Remains : 2501/2503 places, 2400/2403 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s2154 1) (EQ s2169 1)), p1:(NEQ s2315 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 185 reset in 1682 ms.
Product exploration explored 100000 steps with 189 reset in 2015 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 80 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 487 steps, including 0 resets, run visited all 2 properties in 16 ms. (steps per millisecond=30 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 125 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-29 02:06:34] [INFO ] Invariant cache hit.
[2024-05-29 02:06:38] [INFO ] [Real]Absence check using 901 positive place invariants in 1388 ms returned sat
[2024-05-29 02:06:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 02:06:49] [INFO ] [Real]Absence check using state equation in 10715 ms returned unknown
Could not prove EG (NOT p0)
Support contains 3 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 79 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-29 02:06:49] [INFO ] Invariant cache hit.
[2024-05-29 02:06:51] [INFO ] Implicit Places using invariants in 1521 ms returned []
[2024-05-29 02:06:51] [INFO ] Invariant cache hit.
[2024-05-29 02:06:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 02:06:52] [INFO ] Implicit Places using invariants and state equation in 1921 ms returned []
Implicit Place search using SMT with State Equation took 3461 ms to find 0 implicit places.
[2024-05-29 02:06:53] [INFO ] Redundant transitions in 315 ms returned []
[2024-05-29 02:06:53] [INFO ] Invariant cache hit.
[2024-05-29 02:06:54] [INFO ] Dead Transitions using invariants and state equation in 1545 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5411 ms. Remains : 2501/2501 places, 2400/2400 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 99 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 572 steps, including 0 resets, run visited all 2 properties in 13 ms. (steps per millisecond=44 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 134 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-29 02:06:55] [INFO ] Invariant cache hit.
[2024-05-29 02:06:59] [INFO ] [Real]Absence check using 901 positive place invariants in 1359 ms returned sat
[2024-05-29 02:06:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 02:07:10] [INFO ] [Real]Absence check using state equation in 10600 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 189 reset in 1642 ms.
Product exploration explored 100000 steps with 189 reset in 2018 ms.
Built C files in :
/tmp/ltsmin16167048866867244331
[2024-05-29 02:07:14] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:07:14] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16167048866867244331
Running compilation step : cd /tmp/ltsmin16167048866867244331;'/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/ltsmin16167048866867244331;'/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/ltsmin16167048866867244331;'/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 2501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 89 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-29 02:07:17] [INFO ] Invariant cache hit.
[2024-05-29 02:07:18] [INFO ] Implicit Places using invariants in 1431 ms returned []
[2024-05-29 02:07:18] [INFO ] Invariant cache hit.
[2024-05-29 02:07:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 02:07:21] [INFO ] Implicit Places using invariants and state equation in 2155 ms returned []
Implicit Place search using SMT with State Equation took 3596 ms to find 0 implicit places.
[2024-05-29 02:07:21] [INFO ] Redundant transitions in 310 ms returned []
[2024-05-29 02:07:21] [INFO ] Invariant cache hit.
[2024-05-29 02:07:22] [INFO ] Dead Transitions using invariants and state equation in 1531 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5532 ms. Remains : 2501/2501 places, 2400/2400 transitions.
Built C files in :
/tmp/ltsmin4904528826319290473
[2024-05-29 02:07:23] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:07:23] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4904528826319290473
Running compilation step : cd /tmp/ltsmin4904528826319290473;'/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/ltsmin4904528826319290473;'/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/ltsmin4904528826319290473;'/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 02:07:26] [INFO ] Flatten gal took : 132 ms
[2024-05-29 02:07:26] [INFO ] Flatten gal took : 137 ms
[2024-05-29 02:07:26] [INFO ] Time to serialize gal into /tmp/LTL17311895270475203363.gal : 13 ms
[2024-05-29 02:07:26] [INFO ] Time to serialize properties into /tmp/LTL4141590411205404713.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/LTL17311895270475203363.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10484978271409794000.hoa' '-atoms' '/tmp/LTL4141590411205404713.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/LTL4141590411205404713.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10484978271409794000.hoa
Detected timeout of ITS tools.
[2024-05-29 02:07:41] [INFO ] Flatten gal took : 130 ms
[2024-05-29 02:07:41] [INFO ] Flatten gal took : 134 ms
[2024-05-29 02:07:41] [INFO ] Time to serialize gal into /tmp/LTL2157594267838302923.gal : 13 ms
[2024-05-29 02:07:41] [INFO ] Time to serialize properties into /tmp/LTL12433782807795235161.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/LTL2157594267838302923.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12433782807795235161.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((F("((p2154==1)&&(p2169==1))"))&&(F(G("(p2315==0)"))))))
Formula 0 simplified : F(G!"((p2154==1)&&(p2169==1))" | GF!"(p2315==0)")
Detected timeout of ITS tools.
[2024-05-29 02:07:57] [INFO ] Flatten gal took : 130 ms
[2024-05-29 02:07:57] [INFO ] Applying decomposition
[2024-05-29 02:07:57] [INFO ] Flatten gal took : 128 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/graph17322219474305215032.txt' '-o' '/tmp/graph17322219474305215032.bin' '-w' '/tmp/graph17322219474305215032.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17322219474305215032.bin' '-l' '-1' '-v' '-w' '/tmp/graph17322219474305215032.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:07:57] [INFO ] Decomposing Gal with order
[2024-05-29 02:07:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:07:57] [INFO ] Removed a total of 1595 redundant transitions.
[2024-05-29 02:07:57] [INFO ] Flatten gal took : 148 ms
[2024-05-29 02:07:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 1556 labels/synchronizations in 184 ms.
[2024-05-29 02:07:58] [INFO ] Time to serialize gal into /tmp/LTL13668426453156327326.gal : 32 ms
[2024-05-29 02:07:58] [INFO ] Time to serialize properties into /tmp/LTL4768019356936113630.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/LTL13668426453156327326.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4768019356936113630.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("((i37.i1.i0.u775.p2154==1)&&(i37.i1.i0.u781.p2169==1))"))&&(F(G("(i40.i1.i0.u834.p2315==0)"))))))
Formula 0 simplified : F(G!"((i37.i1.i0.u775.p2154==1)&&(i37.i1.i0.u781.p2169==1))" | GF!"(i40.i1.i0.u834.p2315==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2243923725462261489
[2024-05-29 02:08:13] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2243923725462261489
Running compilation step : cd /tmp/ltsmin2243923725462261489;'/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/ltsmin2243923725462261489;'/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/ltsmin2243923725462261489;'/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 ShieldIIPs-PT-100A-LTLFireability-02 finished in 112118 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(p1)&&(p2 U (p3||G(p2))))||X(G(p1))))))'
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 66 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2024-05-29 02:08:16] [INFO ] Computed 901 invariants in 10 ms
[2024-05-29 02:08:17] [INFO ] Implicit Places using invariants in 1399 ms returned []
[2024-05-29 02:08:17] [INFO ] Invariant cache hit.
[2024-05-29 02:08:19] [INFO ] Implicit Places using invariants and state equation in 2150 ms returned []
Implicit Place search using SMT with State Equation took 3551 ms to find 0 implicit places.
[2024-05-29 02:08:19] [INFO ] Invariant cache hit.
[2024-05-29 02:08:21] [INFO ] Dead Transitions using invariants and state equation in 1586 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5204 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 1556 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3) (NOT p2)), true, (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) p1)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={1} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s113 0) (EQ s121 0) (EQ s125 0)), p3:(AND (NOT (AND (EQ s1706 1) (EQ s1717 1))) (EQ s113 1) (EQ s121 1) (EQ s125 1)), p2:(AND (EQ s113 1) (EQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-100A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLFireability-03 finished in 6802 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 (F((!p1&&X(F(p0)))) U X(X(p2)))))'
Support contains 7 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 67 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2024-05-29 02:08:23] [INFO ] Invariant cache hit.
[2024-05-29 02:08:24] [INFO ] Implicit Places using invariants in 1508 ms returned []
[2024-05-29 02:08:24] [INFO ] Invariant cache hit.
[2024-05-29 02:08:29] [INFO ] Implicit Places using invariants and state equation in 4576 ms returned []
Implicit Place search using SMT with State Equation took 6086 ms to find 0 implicit places.
[2024-05-29 02:08:29] [INFO ] Invariant cache hit.
[2024-05-29 02:08:30] [INFO ] Dead Transitions using invariants and state equation in 1560 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7714 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 2725 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p0) p1), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(NOT p0), acceptance={} source=1 dest: 6}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}, { cond=(NOT p0), acceptance={} source=2 dest: 7}, { cond=p0, acceptance={} source=2 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 9}, { cond=(AND p1 p0), acceptance={} source=2 dest: 10}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 6}, { cond=p1, acceptance={} source=3 dest: 11}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 12}, { cond=(AND p1 p0), acceptance={} source=3 dest: 13}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 14}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 5}, { cond=(NOT p2), acceptance={0} source=7 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={0} source=7 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=8 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={0} source=8 dest: 8}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=8 dest: 9}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=8 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=9 dest: 12}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=10 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=10 dest: 12}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=10 dest: 13}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=11 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=11 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={0} source=11 dest: 10}, { cond=(AND p1 (NOT p2)), acceptance={0} source=11 dest: 11}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=12 dest: 14}, { cond=(AND p1 (NOT p2)), acceptance={} source=12 dest: 15}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=13 dest: 14}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=13 dest: 15}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=13 dest: 16}], [{ cond=(NOT p0), acceptance={0} source=14 dest: 14}], [{ cond=(NOT p1), acceptance={0} source=15 dest: 14}, { cond=p1, acceptance={0} source=15 dest: 15}], [{ cond=(NOT p1), acceptance={} source=16 dest: 14}, { cond=(AND p1 (NOT p0)), acceptance={} source=16 dest: 15}, { cond=(AND p1 p0), acceptance={} source=16 dest: 16}]], initial=0, aps=[p1:(AND (EQ s1086 1) (EQ s1090 1) (EQ s1102 1)), p0:(EQ s426 1), p2:(AND (EQ s1188 1) (EQ s1196 1) (EQ s1202 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, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24 reset in 1683 ms.
Product exploration explored 100000 steps with 24 reset in 2017 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 p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 275 ms. Reduced automaton from 17 states, 47 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 388 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p0), (OR (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 02:08:38] [INFO ] Invariant cache hit.
[2024-05-29 02:08:38] [INFO ] [Real]Absence check using 901 positive place invariants in 183 ms returned sat
[2024-05-29 02:08:40] [INFO ] After 2050ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:08:40] [INFO ] [Nat]Absence check using 901 positive place invariants in 184 ms returned sat
[2024-05-29 02:08:42] [INFO ] After 1324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:08:42] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-29 02:08:42] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-29 02:08:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 372 ms
[2024-05-29 02:08:42] [INFO ] After 1764ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2024-05-29 02:08:42] [INFO ] After 2430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 105 ms.
Support contains 1 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
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 2 place count 2502 transition count 2402
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 2501 transition count 2401
Partial Free-agglomeration rule applied 697 times.
Drop transitions removed 697 transitions
Iterating global reduction 0 with 697 rules applied. Total rules applied 701 place count 2501 transition count 2401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 702 place count 2500 transition count 2400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 703 place count 2499 transition count 2400
Applied a total of 703 rules in 338 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 338 ms. Remains : 2499/2503 places, 2400/2403 transitions.
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 119 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21317 steps, run visited all 1 properties in 444 ms. (steps per millisecond=48 )
Probabilistic random walk after 21317 steps, saw 20597 distinct states, run finished after 446 ms. (steps per millisecond=47 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p2) p1)), (F p1), (F (NOT (AND (NOT p2) (NOT p0)))), (F p2), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 12 factoid took 3707 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 347 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p0), (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 1728 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p0), (OR (NOT p0) p1)]
[2024-05-29 02:08:49] [INFO ] Invariant cache hit.
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p2) p1)), (F p1), (F (NOT (AND (NOT p2) (NOT p0)))), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 12 factoid took 3260 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-100A-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100A-LTLFireability-05 finished in 33136 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)||(!p0&&G(F((!p1 U (G(!p1)||(!p1&&G(!p0))))))))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
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 2501 transition count 2401
Applied a total of 4 rules in 186 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-29 02:08:56] [INFO ] Computed 901 invariants in 12 ms
[2024-05-29 02:08:57] [INFO ] Implicit Places using invariants in 1532 ms returned []
[2024-05-29 02:08:57] [INFO ] Invariant cache hit.
[2024-05-29 02:08:58] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 02:08:59] [INFO ] Implicit Places using invariants and state equation in 2033 ms returned []
Implicit Place search using SMT with State Equation took 3580 ms to find 0 implicit places.
[2024-05-29 02:09:00] [INFO ] Redundant transitions in 331 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2501 cols
[2024-05-29 02:09:00] [INFO ] Computed 901 invariants in 10 ms
[2024-05-29 02:09:02] [INFO ] Dead Transitions using invariants and state equation in 1845 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2503 places, 2400/2403 transitions.
Applied a total of 0 rules in 81 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6058 ms. Remains : 2501/2503 places, 2400/2403 transitions.
Stuttering acceptance computed with spot in 152 ms :[p0, (AND p0 p1), (AND p0 p1), p0]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1462 1) (EQ s1495 1)), p1:(AND (EQ s6 1) (EQ s17 1))], nbAcceptance=2, 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 19 reset in 1718 ms.
Product exploration explored 100000 steps with 19 reset in 2093 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (OR p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 165 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 4) 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 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 02:09:07] [INFO ] Invariant cache hit.
[2024-05-29 02:09:07] [INFO ] [Real]Absence check using 901 positive place invariants in 181 ms returned sat
[2024-05-29 02:09:09] [INFO ] After 2089ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:09:09] [INFO ] [Nat]Absence check using 901 positive place invariants in 187 ms returned sat
[2024-05-29 02:09:25] [INFO ] After 15965ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:09:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 02:09:26] [INFO ] After 160ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 02:09:26] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 0 ms to minimize.
[2024-05-29 02:09:26] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 1 ms to minimize.
[2024-05-29 02:09:26] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 0 ms to minimize.
[2024-05-29 02:09:27] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 0 ms to minimize.
[2024-05-29 02:09:27] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 1 ms to minimize.
[2024-05-29 02:09:27] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 1 ms to minimize.
[2024-05-29 02:09:28] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 1 ms to minimize.
[2024-05-29 02:09:28] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 1 ms to minimize.
[2024-05-29 02:09:28] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 10 ms to minimize.
[2024-05-29 02:09:28] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 0 ms to minimize.
[2024-05-29 02:09:28] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2024-05-29 02:09:29] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 1 ms to minimize.
[2024-05-29 02:09:29] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 0 ms to minimize.
[2024-05-29 02:09:29] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 0 ms to minimize.
[2024-05-29 02:09:29] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 0 ms to minimize.
[2024-05-29 02:09:30] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-29 02:09:30] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 0 ms to minimize.
[2024-05-29 02:09:30] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-29 02:09:30] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-29 02:09:30] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 4590 ms
[2024-05-29 02:09:30] [INFO ] After 4864ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 140 ms.
[2024-05-29 02:09:30] [INFO ] After 21771ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 385 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 0 with 696 rules applied. Total rules applied 696 place count 2501 transition count 2400
Applied a total of 696 rules in 150 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 2501/2501 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 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 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 104230 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{0=1}
Probabilistic random walk after 104230 steps, saw 101813 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2501 cols
[2024-05-29 02:09:34] [INFO ] Computed 901 invariants in 20 ms
[2024-05-29 02:09:35] [INFO ] [Real]Absence check using 899 positive place invariants in 179 ms returned sat
[2024-05-29 02:09:35] [INFO ] [Real]Absence check using 899 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 02:09:37] [INFO ] After 2086ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:09:37] [INFO ] [Nat]Absence check using 899 positive place invariants in 216 ms returned sat
[2024-05-29 02:09:37] [INFO ] [Nat]Absence check using 899 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 02:09:48] [INFO ] After 10948ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 94 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 2501/2501 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 212 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 121 ms. (steps per millisecond=82 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 128749 steps, run timeout after 3002 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 128749 steps, saw 125142 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 02:09:51] [INFO ] Invariant cache hit.
[2024-05-29 02:09:52] [INFO ] [Real]Absence check using 899 positive place invariants in 182 ms returned sat
[2024-05-29 02:09:52] [INFO ] [Real]Absence check using 899 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 02:09:53] [INFO ] After 1945ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:09:54] [INFO ] [Nat]Absence check using 899 positive place invariants in 182 ms returned sat
[2024-05-29 02:09:54] [INFO ] [Nat]Absence check using 899 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 02:10:04] [INFO ] After 10883ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 147 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 2501/2501 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 74 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-29 02:10:04] [INFO ] Invariant cache hit.
[2024-05-29 02:10:06] [INFO ] Implicit Places using invariants in 1836 ms returned []
[2024-05-29 02:10:06] [INFO ] Invariant cache hit.
[2024-05-29 02:10:07] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 02:10:12] [INFO ] Implicit Places using invariants and state equation in 6083 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 7973 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 89 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8137 ms. Remains : 2500/2501 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 190 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 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 130730 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 130730 steps, saw 126966 distinct states, run finished after 3002 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2500 cols
[2024-05-29 02:10:15] [INFO ] Computed 900 invariants in 22 ms
[2024-05-29 02:10:16] [INFO ] [Real]Absence check using 898 positive place invariants in 189 ms returned sat
[2024-05-29 02:10:16] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 02:10:18] [INFO ] After 2108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:10:18] [INFO ] [Nat]Absence check using 898 positive place invariants in 182 ms returned sat
[2024-05-29 02:10:18] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 02:10:28] [INFO ] After 10949ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 93 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 100 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-29 02:10:29] [INFO ] Invariant cache hit.
[2024-05-29 02:10:31] [INFO ] Implicit Places using invariants in 1902 ms returned []
[2024-05-29 02:10:31] [INFO ] Invariant cache hit.
[2024-05-29 02:10:36] [INFO ] Implicit Places using invariants and state equation in 5174 ms returned []
Implicit Place search using SMT with State Equation took 7108 ms to find 0 implicit places.
[2024-05-29 02:10:36] [INFO ] Redundant transitions in 192 ms returned []
[2024-05-29 02:10:36] [INFO ] Invariant cache hit.
[2024-05-29 02:10:38] [INFO ] Dead Transitions using invariants and state equation in 1797 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9229 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 87 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 02:10:38] [INFO ] Invariant cache hit.
[2024-05-29 02:10:39] [INFO ] [Real]Absence check using 898 positive place invariants in 173 ms returned sat
[2024-05-29 02:10:39] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 02:10:40] [INFO ] After 2179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:10:41] [INFO ] [Nat]Absence check using 898 positive place invariants in 181 ms returned sat
[2024-05-29 02:10:41] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 02:10:51] [INFO ] After 10850ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (OR p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 13 factoid took 184 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND p0 p1)]
Stuttering acceptance computed with spot in 38 ms :[(AND p0 p1)]
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 82 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2501 cols
[2024-05-29 02:10:51] [INFO ] Computed 901 invariants in 11 ms
[2024-05-29 02:10:53] [INFO ] Implicit Places using invariants in 1508 ms returned []
[2024-05-29 02:10:53] [INFO ] Invariant cache hit.
[2024-05-29 02:10:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 02:10:55] [INFO ] Implicit Places using invariants and state equation in 2013 ms returned []
Implicit Place search using SMT with State Equation took 3545 ms to find 0 implicit places.
[2024-05-29 02:10:56] [INFO ] Redundant transitions in 896 ms returned []
[2024-05-29 02:10:56] [INFO ] Invariant cache hit.
[2024-05-29 02:10:57] [INFO ] Dead Transitions using invariants and state equation in 1556 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6087 ms. Remains : 2501/2501 places, 2400/2400 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 162 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 4) seen :2
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 02:10:58] [INFO ] Invariant cache hit.
[2024-05-29 02:10:59] [INFO ] [Real]Absence check using 901 positive place invariants in 187 ms returned sat
[2024-05-29 02:11:00] [INFO ] After 2097ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:11:01] [INFO ] [Nat]Absence check using 901 positive place invariants in 178 ms returned sat
[2024-05-29 02:11:17] [INFO ] After 16100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:11:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 02:11:22] [INFO ] After 4432ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 02:11:25] [INFO ] After 8194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-29 02:11:25] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 310 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 0 with 696 rules applied. Total rules applied 696 place count 2501 transition count 2400
Applied a total of 696 rules in 143 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 2501/2501 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 239 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 134 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 127452 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{0=1}
Probabilistic random walk after 127452 steps, saw 123939 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2501 cols
[2024-05-29 02:11:29] [INFO ] Computed 901 invariants in 21 ms
[2024-05-29 02:11:30] [INFO ] [Real]Absence check using 899 positive place invariants in 167 ms returned sat
[2024-05-29 02:11:30] [INFO ] [Real]Absence check using 899 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 02:11:31] [INFO ] After 2142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:11:32] [INFO ] [Nat]Absence check using 899 positive place invariants in 181 ms returned sat
[2024-05-29 02:11:32] [INFO ] [Nat]Absence check using 899 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-29 02:11:42] [INFO ] After 10929ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 85 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 2501/2501 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 247 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 121 ms. (steps per millisecond=82 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 127875 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 127875 steps, saw 124332 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 02:11:46] [INFO ] Invariant cache hit.
[2024-05-29 02:11:47] [INFO ] [Real]Absence check using 899 positive place invariants in 182 ms returned sat
[2024-05-29 02:11:47] [INFO ] [Real]Absence check using 899 positive and 2 generalized place invariants in 6 ms returned sat
[2024-05-29 02:11:48] [INFO ] After 2169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:11:49] [INFO ] [Nat]Absence check using 899 positive place invariants in 181 ms returned sat
[2024-05-29 02:11:49] [INFO ] [Nat]Absence check using 899 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 02:11:59] [INFO ] After 10751ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 79 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 2501/2501 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 89 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-29 02:11:59] [INFO ] Invariant cache hit.
[2024-05-29 02:12:01] [INFO ] Implicit Places using invariants in 1896 ms returned []
[2024-05-29 02:12:01] [INFO ] Invariant cache hit.
[2024-05-29 02:12:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 02:12:07] [INFO ] Implicit Places using invariants and state equation in 5715 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 7618 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 72 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7779 ms. Remains : 2500/2501 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 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 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 135418 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 135418 steps, saw 131458 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2500 cols
[2024-05-29 02:12:10] [INFO ] Computed 900 invariants in 21 ms
[2024-05-29 02:12:11] [INFO ] [Real]Absence check using 898 positive place invariants in 176 ms returned sat
[2024-05-29 02:12:11] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-29 02:12:12] [INFO ] After 2039ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:12:13] [INFO ] [Nat]Absence check using 898 positive place invariants in 177 ms returned sat
[2024-05-29 02:12:13] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 02:12:23] [INFO ] After 10854ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 93 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 69 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-29 02:12:23] [INFO ] Invariant cache hit.
[2024-05-29 02:12:25] [INFO ] Implicit Places using invariants in 2175 ms returned []
[2024-05-29 02:12:25] [INFO ] Invariant cache hit.
[2024-05-29 02:12:30] [INFO ] Implicit Places using invariants and state equation in 4952 ms returned []
Implicit Place search using SMT with State Equation took 7158 ms to find 0 implicit places.
[2024-05-29 02:12:30] [INFO ] Redundant transitions in 74 ms returned []
[2024-05-29 02:12:30] [INFO ] Invariant cache hit.
[2024-05-29 02:12:32] [INFO ] Dead Transitions using invariants and state equation in 2145 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9472 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 72 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 02:12:32] [INFO ] Invariant cache hit.
[2024-05-29 02:12:33] [INFO ] [Real]Absence check using 898 positive place invariants in 180 ms returned sat
[2024-05-29 02:12:33] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-29 02:12:35] [INFO ] After 2048ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:12:35] [INFO ] [Nat]Absence check using 898 positive place invariants in 183 ms returned sat
[2024-05-29 02:12:35] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 02:12:45] [INFO ] After 10854ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 207 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(AND p0 p1)]
Stuttering acceptance computed with spot in 36 ms :[(AND p0 p1)]
Stuttering acceptance computed with spot in 34 ms :[(AND p0 p1)]
Product exploration explored 100000 steps with 19 reset in 1655 ms.
Product exploration explored 100000 steps with 19 reset in 2076 ms.
Built C files in :
/tmp/ltsmin18381261669078805178
[2024-05-29 02:12:50] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:12:50] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18381261669078805178
Running compilation step : cd /tmp/ltsmin18381261669078805178;'/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/ltsmin18381261669078805178;'/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/ltsmin18381261669078805178;'/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 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 77 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2501 cols
[2024-05-29 02:12:53] [INFO ] Computed 901 invariants in 11 ms
[2024-05-29 02:12:54] [INFO ] Implicit Places using invariants in 1481 ms returned []
[2024-05-29 02:12:54] [INFO ] Invariant cache hit.
[2024-05-29 02:12:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 02:12:56] [INFO ] Implicit Places using invariants and state equation in 2069 ms returned []
Implicit Place search using SMT with State Equation took 3575 ms to find 0 implicit places.
[2024-05-29 02:12:57] [INFO ] Redundant transitions in 352 ms returned []
[2024-05-29 02:12:57] [INFO ] Invariant cache hit.
[2024-05-29 02:12:58] [INFO ] Dead Transitions using invariants and state equation in 1629 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5676 ms. Remains : 2501/2501 places, 2400/2400 transitions.
Built C files in :
/tmp/ltsmin11167487771101670918
[2024-05-29 02:12:58] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:12:58] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11167487771101670918
Running compilation step : cd /tmp/ltsmin11167487771101670918;'/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/ltsmin11167487771101670918;'/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/ltsmin11167487771101670918;'/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 02:13:02] [INFO ] Flatten gal took : 139 ms
[2024-05-29 02:13:02] [INFO ] Flatten gal took : 161 ms
[2024-05-29 02:13:02] [INFO ] Time to serialize gal into /tmp/LTL15234677226559331393.gal : 23 ms
[2024-05-29 02:13:02] [INFO ] Time to serialize properties into /tmp/LTL2280413341207735628.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/LTL15234677226559331393.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15537558066417846530.hoa' '-atoms' '/tmp/LTL2280413341207735628.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/LTL2280413341207735628.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15537558066417846530.hoa
Detected timeout of ITS tools.
[2024-05-29 02:13:17] [INFO ] Flatten gal took : 125 ms
[2024-05-29 02:13:17] [INFO ] Flatten gal took : 128 ms
[2024-05-29 02:13:17] [INFO ] Time to serialize gal into /tmp/LTL438252277773553556.gal : 18 ms
[2024-05-29 02:13:17] [INFO ] Time to serialize properties into /tmp/LTL11592400791415625152.ltl : 68 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/LTL438252277773553556.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11592400791415625152.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("((p1462==0)||(p1495==0))"))||((G(F((!("((p6==1)&&(p17==1))"))U((G(!("((p6==1)&&(p17==1))")))||((!("((p6==1)&&(p17==1))"))&&(G...223
Formula 0 simplified : G(F!"((p1462==0)||(p1495==0))" & (!"((p1462==0)||(p1495==0))" | FG(F!"((p1462==0)||(p1495==0))" U "((p6==1)&&(p17==1))")))
Detected timeout of ITS tools.
[2024-05-29 02:13:32] [INFO ] Flatten gal took : 123 ms
[2024-05-29 02:13:32] [INFO ] Applying decomposition
[2024-05-29 02:13:33] [INFO ] Flatten gal took : 128 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/graph14933930120220586205.txt' '-o' '/tmp/graph14933930120220586205.bin' '-w' '/tmp/graph14933930120220586205.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14933930120220586205.bin' '-l' '-1' '-v' '-w' '/tmp/graph14933930120220586205.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:13:33] [INFO ] Decomposing Gal with order
[2024-05-29 02:13:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:13:33] [INFO ] Removed a total of 1595 redundant transitions.
[2024-05-29 02:13:33] [INFO ] Flatten gal took : 209 ms
[2024-05-29 02:13:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 1548 labels/synchronizations in 272 ms.
[2024-05-29 02:13:34] [INFO ] Time to serialize gal into /tmp/LTL17093075396730672978.gal : 43 ms
[2024-05-29 02:13:34] [INFO ] Time to serialize properties into /tmp/LTL9352664397386823173.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17093075396730672978.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9352664397386823173.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((G("((i27.i1.i0.u527.p1462==0)||(i28.i0.i0.u539.p1495==0))"))||((G(F((!("((i0.i0.i0.u2.p6==1)&&(i0.i0.i0.u6.p17==1))"))U((G(!("((...385
Formula 0 simplified : G(F!"((i27.i1.i0.u527.p1462==0)||(i28.i0.i0.u539.p1495==0))" & (!"((i27.i1.i0.u527.p1462==0)||(i28.i0.i0.u539.p1495==0))" | FG(F!"((...259
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3561380006169566306
[2024-05-29 02:13:49] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3561380006169566306
Running compilation step : cd /tmp/ltsmin3561380006169566306;'/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/ltsmin3561380006169566306;'/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/ltsmin3561380006169566306;'/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 ShieldIIPs-PT-100A-LTLFireability-06 finished in 296249 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)||F(G((p1||F(p2)))))))'
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 60 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2024-05-29 02:13:52] [INFO ] Computed 901 invariants in 10 ms
[2024-05-29 02:13:53] [INFO ] Implicit Places using invariants in 1460 ms returned []
[2024-05-29 02:13:53] [INFO ] Invariant cache hit.
[2024-05-29 02:13:55] [INFO ] Implicit Places using invariants and state equation in 2018 ms returned []
Implicit Place search using SMT with State Equation took 3497 ms to find 0 implicit places.
[2024-05-29 02:13:55] [INFO ] Invariant cache hit.
[2024-05-29 02:13:57] [INFO ] Dead Transitions using invariants and state equation in 1586 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5173 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(AND (EQ s1482 1) (EQ s1484 1) (EQ s153 1) (EQ s174 1)), p1:(AND (EQ s1482 1) (EQ s1484 1)), p2:(EQ s772 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 29 reset in 1599 ms.
Product exploration explored 100000 steps with 29 reset in 1972 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 p0)), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 113 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 1992 steps, including 0 resets, run visited all 2 properties in 43 ms. (steps per millisecond=46 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 8 factoid took 142 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 72 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2024-05-29 02:14:01] [INFO ] Invariant cache hit.
[2024-05-29 02:14:05] [INFO ] [Real]Absence check using 901 positive place invariants in 1119 ms returned sat
[2024-05-29 02:14:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 02:14:16] [INFO ] [Real]Absence check using state equation in 10896 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 3 out of 2503 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 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
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 2502 transition count 2402
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 2501 transition count 2401
Applied a total of 4 rules in 162 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-29 02:14:17] [INFO ] Computed 901 invariants in 13 ms
[2024-05-29 02:14:18] [INFO ] Implicit Places using invariants in 1644 ms returned []
[2024-05-29 02:14:18] [INFO ] Invariant cache hit.
[2024-05-29 02:14:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 02:14:20] [INFO ] Implicit Places using invariants and state equation in 2026 ms returned []
Implicit Place search using SMT with State Equation took 3699 ms to find 0 implicit places.
[2024-05-29 02:14:21] [INFO ] Redundant transitions in 304 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2501 cols
[2024-05-29 02:14:21] [INFO ] Computed 901 invariants in 4 ms
[2024-05-29 02:14:22] [INFO ] Dead Transitions using invariants and state equation in 1606 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2503 places, 2400/2403 transitions.
Applied a total of 0 rules in 77 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5873 ms. Remains : 2501/2503 places, 2400/2403 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 80 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 69 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 1875 steps, including 0 resets, run visited all 2 properties in 55 ms. (steps per millisecond=34 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 5 factoid took 128 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 71 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2024-05-29 02:14:23] [INFO ] Invariant cache hit.
[2024-05-29 02:14:27] [INFO ] [Real]Absence check using 901 positive place invariants in 1127 ms returned sat
[2024-05-29 02:14:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 02:14:38] [INFO ] [Real]Absence check using state equation in 10894 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 30 reset in 1599 ms.
Product exploration explored 100000 steps with 29 reset in 1976 ms.
Built C files in :
/tmp/ltsmin6570243198475725903
[2024-05-29 02:14:41] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:14:42] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6570243198475725903
Running compilation step : cd /tmp/ltsmin6570243198475725903;'/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/ltsmin6570243198475725903;'/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/ltsmin6570243198475725903;'/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 2501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2499 transition count 2399
Applied a total of 1 rules in 99 ms. Remains 2499 /2501 variables (removed 2) and now considering 2399/2400 (removed 1) transitions.
// Phase 1: matrix 2399 rows 2499 cols
[2024-05-29 02:14:45] [INFO ] Computed 900 invariants in 4 ms
[2024-05-29 02:14:46] [INFO ] Implicit Places using invariants in 1504 ms returned []
[2024-05-29 02:14:46] [INFO ] Invariant cache hit.
[2024-05-29 02:14:48] [INFO ] Implicit Places using invariants and state equation in 2210 ms returned []
Implicit Place search using SMT with State Equation took 3733 ms to find 0 implicit places.
[2024-05-29 02:14:49] [INFO ] Redundant transitions in 326 ms returned []
[2024-05-29 02:14:49] [INFO ] Invariant cache hit.
[2024-05-29 02:14:50] [INFO ] Dead Transitions using invariants and state equation in 1607 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/2501 places, 2399/2400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5771 ms. Remains : 2499/2501 places, 2399/2400 transitions.
Built C files in :
/tmp/ltsmin13834752007172740584
[2024-05-29 02:14:50] [INFO ] Too many transitions (2399) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:14:50] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13834752007172740584
Running compilation step : cd /tmp/ltsmin13834752007172740584;'/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/ltsmin13834752007172740584;'/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/ltsmin13834752007172740584;'/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 02:14:53] [INFO ] Flatten gal took : 71 ms
[2024-05-29 02:14:54] [INFO ] Flatten gal took : 73 ms
[2024-05-29 02:14:54] [INFO ] Time to serialize gal into /tmp/LTL12938412027377981903.gal : 11 ms
[2024-05-29 02:14:54] [INFO ] Time to serialize properties into /tmp/LTL2477694918254398682.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/LTL12938412027377981903.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13185775166359438122.hoa' '-atoms' '/tmp/LTL2477694918254398682.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/LTL2477694918254398682.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13185775166359438122.hoa
Detected timeout of ITS tools.
[2024-05-29 02:15:09] [INFO ] Flatten gal took : 119 ms
[2024-05-29 02:15:09] [INFO ] Flatten gal took : 123 ms
[2024-05-29 02:15:09] [INFO ] Time to serialize gal into /tmp/LTL5815460940806397500.gal : 23 ms
[2024-05-29 02:15:09] [INFO ] Time to serialize properties into /tmp/LTL6764681552285537304.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/LTL5815460940806397500.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6764681552285537304.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("(((p1482==1)&&(p1484==1))&&((p153==1)&&(p174==1)))"))||(F(G(("((p1482==1)&&(p1484==1))")||(F("(p772==1)"))))))))
Formula 0 simplified : X(F!"(((p1482==1)&&(p1484==1))&&((p153==1)&&(p174==1)))" & G(F!"((p1482==1)&&(p1484==1))" & FG!"(p772==1)"))
Detected timeout of ITS tools.
[2024-05-29 02:15:24] [INFO ] Flatten gal took : 121 ms
[2024-05-29 02:15:24] [INFO ] Applying decomposition
[2024-05-29 02:15:24] [INFO ] Flatten gal took : 123 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/graph515714291674038381.txt' '-o' '/tmp/graph515714291674038381.bin' '-w' '/tmp/graph515714291674038381.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph515714291674038381.bin' '-l' '-1' '-v' '-w' '/tmp/graph515714291674038381.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:15:24] [INFO ] Decomposing Gal with order
[2024-05-29 02:15:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:15:25] [INFO ] Removed a total of 1595 redundant transitions.
[2024-05-29 02:15:25] [INFO ] Flatten gal took : 116 ms
[2024-05-29 02:15:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 1528 labels/synchronizations in 380 ms.
[2024-05-29 02:15:25] [INFO ] Time to serialize gal into /tmp/LTL6847965203177855440.gal : 23 ms
[2024-05-29 02:15:25] [INFO ] Time to serialize properties into /tmp/LTL16112232061980724348.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/LTL6847965203177855440.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16112232061980724348.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("(((i29.i0.i0.u533.p1482==1)&&(i29.i0.i2.u534.p1484==1))&&((i3.i1.i0.u55.p153==1)&&(i3.i1.i2.u63.p174==1)))"))||(F(G(("((i29.i...243
Formula 0 simplified : X(F!"(((i29.i0.i0.u533.p1482==1)&&(i29.i0.i2.u534.p1484==1))&&((i3.i1.i0.u55.p153==1)&&(i3.i1.i2.u63.p174==1)))" & G(F!"((i29.i0.i0....232
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5864358563208887396
[2024-05-29 02:15:40] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5864358563208887396
Running compilation step : cd /tmp/ltsmin5864358563208887396;'/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/ltsmin5864358563208887396;'/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/ltsmin5864358563208887396;'/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 ShieldIIPs-PT-100A-LTLFireability-07 finished in 111634 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)&&(F(p1) U p2))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 65 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2024-05-29 02:15:44] [INFO ] Computed 901 invariants in 9 ms
[2024-05-29 02:15:45] [INFO ] Implicit Places using invariants in 1538 ms returned []
[2024-05-29 02:15:45] [INFO ] Invariant cache hit.
[2024-05-29 02:15:47] [INFO ] Implicit Places using invariants and state equation in 1981 ms returned []
Implicit Place search using SMT with State Equation took 3536 ms to find 0 implicit places.
[2024-05-29 02:15:47] [INFO ] Invariant cache hit.
[2024-05-29 02:15:49] [INFO ] Dead Transitions using invariants and state equation in 1535 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5148 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p2 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p2), acceptance={0} source=5 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 1}, { cond=(NOT p0), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(EQ s2041 1), p2:(OR (EQ s2041 1) (AND (EQ s2231 1) (EQ s2242 1))), p1:(EQ s1341 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-100A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLFireability-08 finished in 5380 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((F(p1)&&p0)))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
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 2502 transition count 2402
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 4 place count 2501 transition count 2401
Applied a total of 4 rules in 179 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-29 02:15:49] [INFO ] Computed 901 invariants in 5 ms
[2024-05-29 02:15:50] [INFO ] Implicit Places using invariants in 1457 ms returned []
[2024-05-29 02:15:51] [INFO ] Invariant cache hit.
[2024-05-29 02:15:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 02:15:52] [INFO ] Implicit Places using invariants and state equation in 1971 ms returned []
Implicit Place search using SMT with State Equation took 3452 ms to find 0 implicit places.
[2024-05-29 02:15:53] [INFO ] Redundant transitions in 320 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2501 cols
[2024-05-29 02:15:53] [INFO ] Computed 901 invariants in 5 ms
[2024-05-29 02:15:55] [INFO ] Dead Transitions using invariants and state equation in 1675 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2503 places, 2400/2403 transitions.
Applied a total of 0 rules in 81 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5741 ms. Remains : 2501/2503 places, 2400/2403 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s2481 1) (EQ s2489 1)), p0:(AND (EQ s1639 1) (EQ s1660 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4989 steps with 0 reset in 81 ms.
FORMULA ShieldIIPs-PT-100A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLFireability-09 finished in 6084 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&&X((!p0 U (!p1||G(!p0))))))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 96 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2024-05-29 02:15:55] [INFO ] Computed 901 invariants in 5 ms
[2024-05-29 02:15:57] [INFO ] Implicit Places using invariants in 1568 ms returned []
[2024-05-29 02:15:57] [INFO ] Invariant cache hit.
[2024-05-29 02:15:59] [INFO ] Implicit Places using invariants and state equation in 1878 ms returned []
Implicit Place search using SMT with State Equation took 3457 ms to find 0 implicit places.
[2024-05-29 02:15:59] [INFO ] Invariant cache hit.
[2024-05-29 02:16:00] [INFO ] Dead Transitions using invariants and state equation in 1688 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5256 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 122 ms :[p0, p0, (AND p0 p1)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s656 1) (EQ s666 1)), p1:(AND (EQ s862 1) (EQ s895 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33440 reset in 6823 ms.
Product exploration explored 100000 steps with 33397 reset in 6992 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)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 134 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[p0, p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) 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
Running SMT prover for 2 properties.
[2024-05-29 02:16:15] [INFO ] Invariant cache hit.
[2024-05-29 02:16:16] [INFO ] [Real]Absence check using 901 positive place invariants in 179 ms returned sat
[2024-05-29 02:16:17] [INFO ] After 2171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:16:18] [INFO ] [Nat]Absence check using 901 positive place invariants in 178 ms returned sat
[2024-05-29 02:16:25] [INFO ] After 7452ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 02:16:26] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 0 ms to minimize.
[2024-05-29 02:16:26] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 0 ms to minimize.
[2024-05-29 02:16:26] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 0 ms to minimize.
[2024-05-29 02:16:27] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 0 ms to minimize.
[2024-05-29 02:16:27] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 0 ms to minimize.
[2024-05-29 02:16:27] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 0 ms to minimize.
[2024-05-29 02:16:27] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 0 ms to minimize.
[2024-05-29 02:16:28] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 0 ms to minimize.
[2024-05-29 02:16:28] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 0 ms to minimize.
[2024-05-29 02:16:28] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 0 ms to minimize.
[2024-05-29 02:16:29] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 0 ms to minimize.
[2024-05-29 02:16:29] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 1 ms to minimize.
[2024-05-29 02:16:29] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 1 ms to minimize.
[2024-05-29 02:16:29] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 0 ms to minimize.
[2024-05-29 02:16:30] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 0 ms to minimize.
[2024-05-29 02:16:30] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 0 ms to minimize.
[2024-05-29 02:16:30] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 0 ms to minimize.
[2024-05-29 02:16:30] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 0 ms to minimize.
[2024-05-29 02:16:31] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2024-05-29 02:16:31] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 0 ms to minimize.
[2024-05-29 02:16:31] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 0 ms to minimize.
[2024-05-29 02:16:31] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 0 ms to minimize.
[2024-05-29 02:16:31] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 0 ms to minimize.
[2024-05-29 02:16:32] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 0 ms to minimize.
[2024-05-29 02:16:32] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2024-05-29 02:16:32] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 0 ms to minimize.
[2024-05-29 02:16:32] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 0 ms to minimize.
[2024-05-29 02:16:32] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2024-05-29 02:16:32] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-29 02:16:32] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-29 02:16:33] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 7099 ms
[2024-05-29 02:16:38] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 0 ms to minimize.
[2024-05-29 02:16:42] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 4868 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 02:16:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:16:42] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 686 ms.
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
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 2501 transition count 2401
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 0 with 695 rules applied. Total rules applied 699 place count 2501 transition count 2401
Applied a total of 699 rules in 256 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 256 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 103474 steps, run timeout after 3002 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103474 steps, saw 101222 distinct states, run finished after 3004 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-29 02:16:47] [INFO ] Computed 901 invariants in 21 ms
[2024-05-29 02:16:47] [INFO ] [Real]Absence check using 898 positive place invariants in 187 ms returned sat
[2024-05-29 02:16:47] [INFO ] [Real]Absence check using 898 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:16:49] [INFO ] After 2194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:16:50] [INFO ] [Nat]Absence check using 898 positive place invariants in 180 ms returned sat
[2024-05-29 02:16:50] [INFO ] [Nat]Absence check using 898 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:17:00] [INFO ] After 10281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:17:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 02:17:06] [INFO ] After 5753ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 02:17:08] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 1 ms to minimize.
[2024-05-29 02:17:08] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 0 ms to minimize.
[2024-05-29 02:17:08] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 1 ms to minimize.
[2024-05-29 02:17:09] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 1 ms to minimize.
[2024-05-29 02:17:09] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 1 ms to minimize.
[2024-05-29 02:17:09] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 0 ms to minimize.
[2024-05-29 02:17:09] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 1 ms to minimize.
[2024-05-29 02:17:10] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 1 ms to minimize.
[2024-05-29 02:17:10] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 0 ms to minimize.
[2024-05-29 02:17:10] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 2 ms to minimize.
[2024-05-29 02:17:10] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 0 ms to minimize.
[2024-05-29 02:17:14] [INFO ] Trap strengthening (SAT) tested/added 11/11 trap constraints in 6492 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 02:17:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:17:14] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 212 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 77 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 74 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2024-05-29 02:17:14] [INFO ] Invariant cache hit.
[2024-05-29 02:17:16] [INFO ] Implicit Places using invariants in 1774 ms returned []
[2024-05-29 02:17:16] [INFO ] Invariant cache hit.
[2024-05-29 02:17:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 02:17:23] [INFO ] Implicit Places using invariants and state equation in 6653 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 8431 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 73 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8579 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 242 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 122 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 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 105694 steps, run timeout after 3002 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105694 steps, saw 103407 distinct states, run finished after 3002 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2024-05-29 02:17:26] [INFO ] Computed 900 invariants in 15 ms
[2024-05-29 02:17:27] [INFO ] [Real]Absence check using 897 positive place invariants in 190 ms returned sat
[2024-05-29 02:17:27] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-29 02:17:29] [INFO ] After 2276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:17:29] [INFO ] [Nat]Absence check using 897 positive place invariants in 205 ms returned sat
[2024-05-29 02:17:29] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:17:40] [INFO ] After 10349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:17:49] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 1 ms to minimize.
[2024-05-29 02:17:49] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 1 ms to minimize.
[2024-05-29 02:17:49] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 1 ms to minimize.
[2024-05-29 02:17:50] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 1 ms to minimize.
[2024-05-29 02:17:50] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 1 ms to minimize.
[2024-05-29 02:17:50] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 1 ms to minimize.
[2024-05-29 02:17:50] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 1 ms to minimize.
[2024-05-29 02:17:51] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 0 ms to minimize.
[2024-05-29 02:17:51] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 1 ms to minimize.
[2024-05-29 02:17:51] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 0 ms to minimize.
[2024-05-29 02:17:51] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 1 ms to minimize.
[2024-05-29 02:17:52] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 0 ms to minimize.
[2024-05-29 02:17:52] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 1 ms to minimize.
[2024-05-29 02:17:52] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 2 ms to minimize.
[2024-05-29 02:17:52] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 0 ms to minimize.
[2024-05-29 02:17:53] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 1 ms to minimize.
[2024-05-29 02:17:54] [INFO ] Trap strengthening (SAT) tested/added 16/16 trap constraints in 5044 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 02:17:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:17:54] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 94 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 79 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 87 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2024-05-29 02:17:54] [INFO ] Invariant cache hit.
[2024-05-29 02:17:56] [INFO ] Implicit Places using invariants in 1820 ms returned []
[2024-05-29 02:17:56] [INFO ] Invariant cache hit.
[2024-05-29 02:18:01] [INFO ] Implicit Places using invariants and state equation in 5177 ms returned []
Implicit Place search using SMT with State Equation took 6999 ms to find 0 implicit places.
[2024-05-29 02:18:01] [INFO ] Redundant transitions in 74 ms returned []
[2024-05-29 02:18:01] [INFO ] Invariant cache hit.
[2024-05-29 02:18:03] [INFO ] Dead Transitions using invariants and state equation in 1515 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8681 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0)))]
Knowledge based reduction with 7 factoid took 122 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 117 ms :[p0, p0, (AND p0 p1)]
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 74 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2024-05-29 02:18:03] [INFO ] Computed 901 invariants in 10 ms
[2024-05-29 02:18:05] [INFO ] Implicit Places using invariants in 1603 ms returned []
[2024-05-29 02:18:05] [INFO ] Invariant cache hit.
[2024-05-29 02:18:07] [INFO ] Implicit Places using invariants and state equation in 2099 ms returned []
Implicit Place search using SMT with State Equation took 3705 ms to find 0 implicit places.
[2024-05-29 02:18:07] [INFO ] Invariant cache hit.
[2024-05-29 02:18:08] [INFO ] Dead Transitions using invariants and state equation in 1602 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5382 ms. Remains : 2503/2503 places, 2403/2403 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)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 86 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[p0, p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 3) seen :1
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 151 ms. (steps per millisecond=66 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 02:18:09] [INFO ] Invariant cache hit.
[2024-05-29 02:18:10] [INFO ] [Real]Absence check using 901 positive place invariants in 201 ms returned sat
[2024-05-29 02:18:11] [INFO ] After 2371ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:18:12] [INFO ] [Nat]Absence check using 901 positive place invariants in 189 ms returned sat
[2024-05-29 02:18:20] [INFO ] After 7807ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 02:18:20] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 1 ms to minimize.
[2024-05-29 02:18:21] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 0 ms to minimize.
[2024-05-29 02:18:21] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 0 ms to minimize.
[2024-05-29 02:18:21] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 0 ms to minimize.
[2024-05-29 02:18:21] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 0 ms to minimize.
[2024-05-29 02:18:22] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 0 ms to minimize.
[2024-05-29 02:18:22] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 1 ms to minimize.
[2024-05-29 02:18:22] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 2 ms to minimize.
[2024-05-29 02:18:22] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 3 ms to minimize.
[2024-05-29 02:18:23] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 1 ms to minimize.
[2024-05-29 02:18:23] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 1 ms to minimize.
[2024-05-29 02:18:23] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 0 ms to minimize.
[2024-05-29 02:18:24] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 1 ms to minimize.
[2024-05-29 02:18:24] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 0 ms to minimize.
[2024-05-29 02:18:24] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2024-05-29 02:18:24] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 1 ms to minimize.
[2024-05-29 02:18:24] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 1 ms to minimize.
[2024-05-29 02:18:25] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 1 ms to minimize.
[2024-05-29 02:18:25] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 0 ms to minimize.
[2024-05-29 02:18:25] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 1 ms to minimize.
[2024-05-29 02:18:25] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 0 ms to minimize.
[2024-05-29 02:18:26] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 0 ms to minimize.
[2024-05-29 02:18:26] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-05-29 02:18:26] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 0 ms to minimize.
[2024-05-29 02:18:26] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2024-05-29 02:18:26] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2024-05-29 02:18:26] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-29 02:18:27] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2024-05-29 02:18:27] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-29 02:18:27] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 02:18:27] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 6867 ms
[2024-05-29 02:18:32] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 0 ms to minimize.
[2024-05-29 02:18:36] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 4281 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 02:18:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:18:36] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 856 ms.
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
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 2501 transition count 2401
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 0 with 695 rules applied. Total rules applied 699 place count 2501 transition count 2401
Applied a total of 699 rules in 270 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 336 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 126 ms. (steps per millisecond=79 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 99197 steps, run timeout after 3002 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99197 steps, saw 97011 distinct states, run finished after 3002 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-29 02:18:41] [INFO ] Computed 901 invariants in 24 ms
[2024-05-29 02:18:42] [INFO ] [Real]Absence check using 898 positive place invariants in 193 ms returned sat
[2024-05-29 02:18:42] [INFO ] [Real]Absence check using 898 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:18:44] [INFO ] After 2327ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:18:44] [INFO ] [Nat]Absence check using 898 positive place invariants in 195 ms returned sat
[2024-05-29 02:18:44] [INFO ] [Nat]Absence check using 898 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:18:55] [INFO ] After 10404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:18:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 02:18:56] [INFO ] After 833ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 02:18:56] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 1 ms to minimize.
[2024-05-29 02:18:56] [INFO ] Deduced a trap composed of 5 places in 198 ms of which 1 ms to minimize.
[2024-05-29 02:18:56] [INFO ] Deduced a trap composed of 9 places in 260 ms of which 0 ms to minimize.
[2024-05-29 02:18:57] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 1 ms to minimize.
[2024-05-29 02:18:57] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 0 ms to minimize.
[2024-05-29 02:18:57] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 1 ms to minimize.
[2024-05-29 02:18:58] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 1 ms to minimize.
[2024-05-29 02:18:58] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 1 ms to minimize.
[2024-05-29 02:18:58] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 0 ms to minimize.
[2024-05-29 02:18:58] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 1 ms to minimize.
[2024-05-29 02:18:59] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 0 ms to minimize.
[2024-05-29 02:18:59] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 1 ms to minimize.
[2024-05-29 02:18:59] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 1 ms to minimize.
[2024-05-29 02:18:59] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 0 ms to minimize.
[2024-05-29 02:18:59] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 1 ms to minimize.
[2024-05-29 02:19:00] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-29 02:19:00] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4087 ms
[2024-05-29 02:19:00] [INFO ] After 5011ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 111 ms.
[2024-05-29 02:19:00] [INFO ] After 16262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 282 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 107 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 76 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2024-05-29 02:19:00] [INFO ] Invariant cache hit.
[2024-05-29 02:19:02] [INFO ] Implicit Places using invariants in 1835 ms returned []
[2024-05-29 02:19:02] [INFO ] Invariant cache hit.
[2024-05-29 02:19:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 02:19:09] [INFO ] Implicit Places using invariants and state equation in 6591 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 8432 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 100 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8610 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 320 ms. (steps per millisecond=31 ) 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
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
Interrupted probabilistic random walk after 103409 steps, run timeout after 3002 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103409 steps, saw 101158 distinct states, run finished after 3002 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2024-05-29 02:19:12] [INFO ] Computed 900 invariants in 20 ms
[2024-05-29 02:19:13] [INFO ] [Real]Absence check using 897 positive place invariants in 202 ms returned sat
[2024-05-29 02:19:13] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:19:15] [INFO ] After 2382ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:19:15] [INFO ] [Nat]Absence check using 897 positive place invariants in 201 ms returned sat
[2024-05-29 02:19:15] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:19:26] [INFO ] After 10343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:19:30] [INFO ] Deduced a trap composed of 20 places in 194 ms of which 1 ms to minimize.
[2024-05-29 02:19:31] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 0 ms to minimize.
[2024-05-29 02:19:31] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 1 ms to minimize.
[2024-05-29 02:19:31] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 0 ms to minimize.
[2024-05-29 02:19:33] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 1 ms to minimize.
[2024-05-29 02:19:33] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 1 ms to minimize.
[2024-05-29 02:19:34] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 1 ms to minimize.
[2024-05-29 02:19:34] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 1 ms to minimize.
[2024-05-29 02:19:35] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 0 ms to minimize.
[2024-05-29 02:19:35] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 1 ms to minimize.
[2024-05-29 02:19:35] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 0 ms to minimize.
[2024-05-29 02:19:35] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 0 ms to minimize.
[2024-05-29 02:19:36] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 0 ms to minimize.
[2024-05-29 02:19:36] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 0 ms to minimize.
[2024-05-29 02:19:36] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 0 ms to minimize.
[2024-05-29 02:19:36] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 0 ms to minimize.
[2024-05-29 02:19:36] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 0 ms to minimize.
[2024-05-29 02:19:37] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 1 ms to minimize.
[2024-05-29 02:19:37] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 1 ms to minimize.
[2024-05-29 02:19:37] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2024-05-29 02:19:37] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 0 ms to minimize.
[2024-05-29 02:19:37] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-29 02:19:38] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-29 02:19:38] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-29 02:19:38] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 7771 ms
[2024-05-29 02:19:38] [INFO ] After 22349ms 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 02:19:38] [INFO ] After 23128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 226 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 78 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 83 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2024-05-29 02:19:38] [INFO ] Invariant cache hit.
[2024-05-29 02:19:40] [INFO ] Implicit Places using invariants in 1686 ms returned []
[2024-05-29 02:19:40] [INFO ] Invariant cache hit.
[2024-05-29 02:19:45] [INFO ] Implicit Places using invariants and state equation in 4784 ms returned []
Implicit Place search using SMT with State Equation took 6477 ms to find 0 implicit places.
[2024-05-29 02:19:45] [INFO ] Redundant transitions in 78 ms returned []
[2024-05-29 02:19:45] [INFO ] Invariant cache hit.
[2024-05-29 02:19:46] [INFO ] Dead Transitions using invariants and state equation in 1545 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8197 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 88 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-29 02:19:47] [INFO ] Invariant cache hit.
[2024-05-29 02:19:47] [INFO ] [Real]Absence check using 897 positive place invariants in 198 ms returned sat
[2024-05-29 02:19:47] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-29 02:19:49] [INFO ] After 2387ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:19:50] [INFO ] [Nat]Absence check using 897 positive place invariants in 191 ms returned sat
[2024-05-29 02:19:50] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-29 02:20:00] [INFO ] After 10354ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:20:08] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 0 ms to minimize.
[2024-05-29 02:20:17] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 9305 ms
[2024-05-29 02:20:17] [INFO ] After 27383ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-29 02:20:17] [INFO ] After 28139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0)))]
Knowledge based reduction with 7 factoid took 145 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 98 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 95 ms :[p0, p0, (AND p0 p1)]
Product exploration explored 100000 steps with 33361 reset in 6765 ms.
Product exploration explored 100000 steps with 33343 reset in 6964 ms.
Built C files in :
/tmp/ltsmin18374274623495578195
[2024-05-29 02:20:31] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18374274623495578195
Running compilation step : cd /tmp/ltsmin18374274623495578195;'/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/ltsmin18374274623495578195;'/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/ltsmin18374274623495578195;'/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 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 68 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2024-05-29 02:20:34] [INFO ] Computed 901 invariants in 13 ms
[2024-05-29 02:20:36] [INFO ] Implicit Places using invariants in 1750 ms returned []
[2024-05-29 02:20:36] [INFO ] Invariant cache hit.
[2024-05-29 02:20:38] [INFO ] Implicit Places using invariants and state equation in 2008 ms returned []
Implicit Place search using SMT with State Equation took 3772 ms to find 0 implicit places.
[2024-05-29 02:20:38] [INFO ] Invariant cache hit.
[2024-05-29 02:20:40] [INFO ] Dead Transitions using invariants and state equation in 1645 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5501 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Built C files in :
/tmp/ltsmin10287827684115607395
[2024-05-29 02:20:40] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10287827684115607395
Running compilation step : cd /tmp/ltsmin10287827684115607395;'/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/ltsmin10287827684115607395;'/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/ltsmin10287827684115607395;'/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 02:20:43] [INFO ] Flatten gal took : 155 ms
[2024-05-29 02:20:43] [INFO ] Flatten gal took : 144 ms
[2024-05-29 02:20:43] [INFO ] Time to serialize gal into /tmp/LTL2468491685436934144.gal : 13 ms
[2024-05-29 02:20:43] [INFO ] Time to serialize properties into /tmp/LTL3637387237708360630.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/LTL2468491685436934144.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14564072116255464662.hoa' '-atoms' '/tmp/LTL3637387237708360630.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/LTL3637387237708360630.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14564072116255464662.hoa
Detected timeout of ITS tools.
[2024-05-29 02:20:59] [INFO ] Flatten gal took : 119 ms
[2024-05-29 02:20:59] [INFO ] Flatten gal took : 128 ms
[2024-05-29 02:20:59] [INFO ] Time to serialize gal into /tmp/LTL4897621104607621985.gal : 11 ms
[2024-05-29 02:20:59] [INFO ] Time to serialize properties into /tmp/LTL3182981852207471010.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/LTL4897621104607621985.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3182981852207471010.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((X((!("((p656==1)&&(p666==1))"))U((!("((p862==1)&&(p895==1))"))||(G(!("((p656==1)&&(p666==1))"))))))&&("((p656==0)||(p666==0))"...160
Formula 0 simplified : FG(!"((p656==0)||(p666==0))" | X("((p656==1)&&(p666==1))" M "((p862==1)&&(p895==1))"))
Detected timeout of ITS tools.
[2024-05-29 02:21:14] [INFO ] Flatten gal took : 120 ms
[2024-05-29 02:21:14] [INFO ] Applying decomposition
[2024-05-29 02:21:14] [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/graph16271936868608174960.txt' '-o' '/tmp/graph16271936868608174960.bin' '-w' '/tmp/graph16271936868608174960.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16271936868608174960.bin' '-l' '-1' '-v' '-w' '/tmp/graph16271936868608174960.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:21:14] [INFO ] Decomposing Gal with order
[2024-05-29 02:21:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:21:15] [INFO ] Removed a total of 1600 redundant transitions.
[2024-05-29 02:21:15] [INFO ] Flatten gal took : 111 ms
[2024-05-29 02:21:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 1540 labels/synchronizations in 302 ms.
[2024-05-29 02:21:15] [INFO ] Time to serialize gal into /tmp/LTL6747378664350632874.gal : 45 ms
[2024-05-29 02:21:15] [INFO ] Time to serialize properties into /tmp/LTL6444965900063846825.ltl : 16 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/LTL6747378664350632874.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6444965900063846825.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 : !((G(F((X((!("((i11.i0.i1.u236.p656==1)&&(i11.i0.i1.u240.p666==1))"))U((!("((i15.i0.i1.u311.p862==1)&&(i15.i1.i1.u323.p895==1))"))||(G...280
Formula 0 simplified : FG(!"((i11.i0.i1.u236.p656==0)||(i11.i0.i1.u240.p666==0))" | X("((i11.i0.i1.u236.p656==1)&&(i11.i0.i1.u240.p666==1))" M "((i15.i0.i1...199
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6971560559948507585
[2024-05-29 02:21:30] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6971560559948507585
Running compilation step : cd /tmp/ltsmin6971560559948507585;'/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/ltsmin6971560559948507585;'/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/ltsmin6971560559948507585;'/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 ShieldIIPs-PT-100A-LTLFireability-10 finished in 338247 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' '!(((p0||X(F(p1))) U X(p1)))'
Support contains 1 out of 2503 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 75 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2024-05-29 02:21:33] [INFO ] Invariant cache hit.
[2024-05-29 02:21:35] [INFO ] Implicit Places using invariants in 1538 ms returned []
[2024-05-29 02:21:35] [INFO ] Invariant cache hit.
[2024-05-29 02:21:37] [INFO ] Implicit Places using invariants and state equation in 2215 ms returned []
Implicit Place search using SMT with State Equation took 3756 ms to find 0 implicit places.
[2024-05-29 02:21:37] [INFO ] Invariant cache hit.
[2024-05-29 02:21:38] [INFO ] Dead Transitions using invariants and state equation in 1413 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5247 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s515 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][false, false]]
Product exploration explored 100000 steps with 25 reset in 1664 ms.
Product exploration explored 100000 steps with 25 reset in 2028 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 p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 108019 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 108019 steps, saw 101258 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 02:21:46] [INFO ] Invariant cache hit.
[2024-05-29 02:21:46] [INFO ] [Real]Absence check using 901 positive place invariants in 189 ms returned sat
[2024-05-29 02:21:48] [INFO ] After 1969ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:21:48] [INFO ] [Nat]Absence check using 901 positive place invariants in 198 ms returned sat
[2024-05-29 02:21:50] [INFO ] After 1331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:21:50] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-29 02:21:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2024-05-29 02:21:50] [INFO ] After 1611ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2024-05-29 02:21:50] [INFO ] After 2387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 107 ms.
Support contains 1 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
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 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 697 times.
Drop transitions removed 697 transitions
Iterating global reduction 0 with 697 rules applied. Total rules applied 701 place count 2501 transition count 2401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 702 place count 2500 transition count 2400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 703 place count 2499 transition count 2400
Applied a total of 703 rules in 357 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 357 ms. Remains : 2499/2503 places, 2400/2403 transitions.
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 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :0
Finished probabilistic random walk after 63268 steps, run visited all 1 properties in 1353 ms. (steps per millisecond=46 )
Probabilistic random walk after 63268 steps, saw 62124 distinct states, run finished after 1357 ms. (steps per millisecond=46 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
[2024-05-29 02:21:52] [INFO ] Invariant cache hit.
[2024-05-29 02:21:56] [INFO ] [Real]Absence check using 901 positive place invariants in 1116 ms returned sat
[2024-05-29 02:21:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 02:22:07] [INFO ] [Real]Absence check using state equation in 11182 ms returned unknown
Could not prove EG (NOT p1)
Support contains 1 out of 2503 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 : 2503/2503 places, 2403/2403 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2502 transition count 2401
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2500 transition count 2401
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 5 place count 2499 transition count 2400
Applied a total of 5 rules in 220 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2024-05-29 02:22:08] [INFO ] Computed 900 invariants in 10 ms
[2024-05-29 02:22:09] [INFO ] Implicit Places using invariants in 1471 ms returned []
[2024-05-29 02:22:09] [INFO ] Invariant cache hit.
[2024-05-29 02:22:11] [INFO ] Implicit Places using invariants and state equation in 2075 ms returned []
Implicit Place search using SMT with State Equation took 3557 ms to find 0 implicit places.
[2024-05-29 02:22:12] [INFO ] Redundant transitions in 328 ms returned [2394]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2399 rows 2499 cols
[2024-05-29 02:22:12] [INFO ] Computed 900 invariants in 15 ms
[2024-05-29 02:22:13] [INFO ] Dead Transitions using invariants and state equation in 1577 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/2503 places, 2399/2403 transitions.
Applied a total of 0 rules in 97 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5794 ms. Remains : 2499/2503 places, 2399/2403 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 : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 102613 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102613 steps, saw 96064 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 02:22:17] [INFO ] Invariant cache hit.
[2024-05-29 02:22:17] [INFO ] [Real]Absence check using 900 positive place invariants in 190 ms returned sat
[2024-05-29 02:22:19] [INFO ] After 1984ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:22:19] [INFO ] [Nat]Absence check using 900 positive place invariants in 183 ms returned sat
[2024-05-29 02:22:21] [INFO ] After 1331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:22:21] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2024-05-29 02:22:21] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-05-29 02:22:21] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 0 ms to minimize.
[2024-05-29 02:22:21] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-29 02:22:22] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-29 02:22:22] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2024-05-29 02:22:22] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2024-05-29 02:22:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1121 ms
[2024-05-29 02:22:22] [INFO ] After 2508ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 101 ms.
[2024-05-29 02:22:22] [INFO ] After 3306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 88 ms.
Support contains 1 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2399/2399 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 2499 transition count 2399
Applied a total of 597 rules in 202 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 2499/2499 places, 2399/2399 transitions.
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 137 ms. (steps per millisecond=73 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 138325 steps, run timeout after 3003 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 138325 steps, saw 136566 distinct states, run finished after 3005 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2399 rows 2499 cols
[2024-05-29 02:22:26] [INFO ] Computed 900 invariants in 13 ms
[2024-05-29 02:22:26] [INFO ] [Real]Absence check using 900 positive place invariants in 190 ms returned sat
[2024-05-29 02:22:28] [INFO ] After 2084ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:22:28] [INFO ] [Nat]Absence check using 900 positive place invariants in 183 ms returned sat
[2024-05-29 02:22:30] [INFO ] After 1293ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:22:30] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 1 ms to minimize.
[2024-05-29 02:22:30] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 0 ms to minimize.
[2024-05-29 02:22:30] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 0 ms to minimize.
[2024-05-29 02:22:31] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 0 ms to minimize.
[2024-05-29 02:22:31] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 0 ms to minimize.
[2024-05-29 02:22:31] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2024-05-29 02:22:31] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2024-05-29 02:22:31] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 0 ms to minimize.
[2024-05-29 02:22:31] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-29 02:22:32] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2024-05-29 02:22:32] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2024-05-29 02:22:32] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2024-05-29 02:22:32] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2024-05-29 02:22:32] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 0 ms to minimize.
[2024-05-29 02:22:32] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 0 ms to minimize.
[2024-05-29 02:22:32] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-05-29 02:22:32] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 0 ms to minimize.
[2024-05-29 02:22:33] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-29 02:22:33] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
[2024-05-29 02:22:33] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3036 ms
[2024-05-29 02:22:33] [INFO ] After 4392ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2024-05-29 02:22:33] [INFO ] After 5121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2399/2399 transitions.
Applied a total of 0 rules in 77 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 2499/2499 places, 2399/2399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2399/2399 transitions.
Applied a total of 0 rules in 81 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
[2024-05-29 02:22:33] [INFO ] Invariant cache hit.
[2024-05-29 02:22:35] [INFO ] Implicit Places using invariants in 1905 ms returned []
[2024-05-29 02:22:35] [INFO ] Invariant cache hit.
[2024-05-29 02:22:38] [INFO ] Implicit Places using invariants and state equation in 2612 ms returned []
Implicit Place search using SMT with State Equation took 4519 ms to find 0 implicit places.
[2024-05-29 02:22:38] [INFO ] Redundant transitions in 79 ms returned []
[2024-05-29 02:22:38] [INFO ] Invariant cache hit.
[2024-05-29 02:22:39] [INFO ] Dead Transitions using invariants and state equation in 1575 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6268 ms. Remains : 2499/2499 places, 2399/2399 transitions.
Applied a total of 0 rules in 75 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 02:22:39] [INFO ] Invariant cache hit.
[2024-05-29 02:22:40] [INFO ] [Real]Absence check using 900 positive place invariants in 185 ms returned sat
[2024-05-29 02:22:41] [INFO ] After 2008ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:22:42] [INFO ] [Nat]Absence check using 900 positive place invariants in 196 ms returned sat
[2024-05-29 02:22:43] [INFO ] After 1374ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:22:44] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 0 ms to minimize.
[2024-05-29 02:22:44] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 0 ms to minimize.
[2024-05-29 02:22:44] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-29 02:22:44] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 1 ms to minimize.
[2024-05-29 02:22:44] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-29 02:22:45] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-05-29 02:22:45] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-29 02:22:45] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2024-05-29 02:22:45] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2024-05-29 02:22:45] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-29 02:22:45] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1743 ms
[2024-05-29 02:22:45] [INFO ] After 3180ms 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 02:22:45] [INFO ] After 3952ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
// Phase 1: matrix 2399 rows 2499 cols
[2024-05-29 02:22:46] [INFO ] Computed 900 invariants in 13 ms
[2024-05-29 02:22:49] [INFO ] [Real]Absence check using 900 positive place invariants in 1052 ms returned sat
[2024-05-29 02:22:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 02:23:01] [INFO ] [Real]Absence check using state equation in 11094 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Product exploration explored 100000 steps with 25 reset in 1742 ms.
Product exploration explored 100000 steps with 25 reset in 2186 ms.
Built C files in :
/tmp/ltsmin15157559898029676980
[2024-05-29 02:23:05] [INFO ] Too many transitions (2399) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:23:05] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15157559898029676980
Running compilation step : cd /tmp/ltsmin15157559898029676980;'/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/ltsmin15157559898029676980;'/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/ltsmin15157559898029676980;'/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 2499 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2499/2499 places, 2399/2399 transitions.
Applied a total of 0 rules in 94 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
[2024-05-29 02:23:08] [INFO ] Invariant cache hit.
[2024-05-29 02:23:09] [INFO ] Implicit Places using invariants in 1425 ms returned []
[2024-05-29 02:23:09] [INFO ] Invariant cache hit.
[2024-05-29 02:23:11] [INFO ] Implicit Places using invariants and state equation in 2090 ms returned []
Implicit Place search using SMT with State Equation took 3517 ms to find 0 implicit places.
[2024-05-29 02:23:12] [INFO ] Redundant transitions in 336 ms returned []
[2024-05-29 02:23:12] [INFO ] Invariant cache hit.
[2024-05-29 02:23:13] [INFO ] Dead Transitions using invariants and state equation in 1493 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5461 ms. Remains : 2499/2499 places, 2399/2399 transitions.
Built C files in :
/tmp/ltsmin362031344120567522
[2024-05-29 02:23:13] [INFO ] Too many transitions (2399) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:23:13] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin362031344120567522
Running compilation step : cd /tmp/ltsmin362031344120567522;'/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/ltsmin362031344120567522;'/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/ltsmin362031344120567522;'/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 02:23:16] [INFO ] Flatten gal took : 67 ms
[2024-05-29 02:23:16] [INFO ] Flatten gal took : 73 ms
[2024-05-29 02:23:16] [INFO ] Time to serialize gal into /tmp/LTL281502829104349864.gal : 10 ms
[2024-05-29 02:23:16] [INFO ] Time to serialize properties into /tmp/LTL3080539174122068881.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/LTL281502829104349864.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17333478805911226502.hoa' '-atoms' '/tmp/LTL3080539174122068881.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/LTL3080539174122068881.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17333478805911226502.hoa
Detected timeout of ITS tools.
[2024-05-29 02:23:32] [INFO ] Flatten gal took : 81 ms
[2024-05-29 02:23:32] [INFO ] Flatten gal took : 72 ms
[2024-05-29 02:23:32] [INFO ] Time to serialize gal into /tmp/LTL6615637120338969027.gal : 11 ms
[2024-05-29 02:23:32] [INFO ] Time to serialize properties into /tmp/LTL11219411838889089698.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/LTL6615637120338969027.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11219411838889089698.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 : !(((("(p666==1)")||(X(F("(p515==1)"))))U(X("(p515==1)"))))
Formula 0 simplified : (!"(p666==1)" & XG!"(p515==1)") R X!"(p515==1)"
Detected timeout of ITS tools.
[2024-05-29 02:23:47] [INFO ] Flatten gal took : 90 ms
[2024-05-29 02:23:47] [INFO ] Applying decomposition
[2024-05-29 02:23:47] [INFO ] Flatten gal took : 87 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/graph15455672240537351728.txt' '-o' '/tmp/graph15455672240537351728.bin' '-w' '/tmp/graph15455672240537351728.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15455672240537351728.bin' '-l' '-1' '-v' '-w' '/tmp/graph15455672240537351728.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:23:47] [INFO ] Decomposing Gal with order
[2024-05-29 02:23:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:23:47] [INFO ] Removed a total of 1595 redundant transitions.
[2024-05-29 02:23:47] [INFO ] Flatten gal took : 115 ms
[2024-05-29 02:23:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 1560 labels/synchronizations in 24 ms.
[2024-05-29 02:23:47] [INFO ] Time to serialize gal into /tmp/LTL8217792793134161262.gal : 20 ms
[2024-05-29 02:23:47] [INFO ] Time to serialize properties into /tmp/LTL14945727320173599214.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/LTL8217792793134161262.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14945727320173599214.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 : !(((("(i11.i0.i2.u240.p666==1)")||(X(F("(i9.i0.i2.u186.p515==1)"))))U(X("(i9.i0.i2.u186.p515==1)"))))
Formula 0 simplified : (!"(i11.i0.i2.u240.p666==1)" & XG!"(i9.i0.i2.u186.p515==1)") R X!"(i9.i0.i2.u186.p515==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8140946136838488867
[2024-05-29 02:24:03] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8140946136838488867
Running compilation step : cd /tmp/ltsmin8140946136838488867;'/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/ltsmin8140946136838488867;'/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/ltsmin8140946136838488867;'/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 ShieldIIPs-PT-100A-LTLFireability-11 finished in 152421 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((F(p0)&&(p0 U p1))))'
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2502 transition count 2401
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2500 transition count 2401
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 5 place count 2499 transition count 2400
Applied a total of 5 rules in 193 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2024-05-29 02:24:06] [INFO ] Computed 900 invariants in 8 ms
[2024-05-29 02:24:07] [INFO ] Implicit Places using invariants in 1431 ms returned []
[2024-05-29 02:24:07] [INFO ] Invariant cache hit.
[2024-05-29 02:24:09] [INFO ] Implicit Places using invariants and state equation in 1964 ms returned []
Implicit Place search using SMT with State Equation took 3430 ms to find 0 implicit places.
[2024-05-29 02:24:10] [INFO ] Redundant transitions in 344 ms returned [2394]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2399 rows 2499 cols
[2024-05-29 02:24:10] [INFO ] Computed 900 invariants in 8 ms
[2024-05-29 02:24:11] [INFO ] Dead Transitions using invariants and state equation in 1544 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/2503 places, 2399/2403 transitions.
Applied a total of 0 rules in 92 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5617 ms. Remains : 2499/2503 places, 2399/2403 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(EQ s190 1), p1:(AND (EQ s1856 1) (EQ s1858 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 14363 steps with 2 reset in 272 ms.
FORMULA ShieldIIPs-PT-100A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLFireability-12 finished in 6055 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)))'
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
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 2501 transition count 2401
Applied a total of 4 rules in 179 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-29 02:24:12] [INFO ] Computed 901 invariants in 10 ms
[2024-05-29 02:24:13] [INFO ] Implicit Places using invariants in 1375 ms returned []
[2024-05-29 02:24:13] [INFO ] Invariant cache hit.
[2024-05-29 02:24:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 02:24:15] [INFO ] Implicit Places using invariants and state equation in 2031 ms returned []
Implicit Place search using SMT with State Equation took 3406 ms to find 0 implicit places.
[2024-05-29 02:24:16] [INFO ] Redundant transitions in 324 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2501 cols
[2024-05-29 02:24:16] [INFO ] Computed 901 invariants in 10 ms
[2024-05-29 02:24:17] [INFO ] Dead Transitions using invariants and state equation in 1621 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2503 places, 2400/2403 transitions.
Applied a total of 0 rules in 97 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5646 ms. Remains : 2501/2503 places, 2400/2403 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1139 1) (EQ s1160 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 37 reset in 1757 ms.
Product exploration explored 100000 steps with 37 reset in 2086 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 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 p0), (NOT p0)]
Finished random walk after 2673 steps, including 0 resets, run visited all 1 properties in 49 ms. (steps per millisecond=54 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 104 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 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
[2024-05-29 02:24:22] [INFO ] Invariant cache hit.
[2024-05-29 02:24:26] [INFO ] [Real]Absence check using 901 positive place invariants in 1593 ms returned sat
[2024-05-29 02:24:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 02:24:37] [INFO ] [Real]Absence check using state equation in 10521 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 93 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-29 02:24:37] [INFO ] Invariant cache hit.
[2024-05-29 02:24:38] [INFO ] Implicit Places using invariants in 1502 ms returned []
[2024-05-29 02:24:38] [INFO ] Invariant cache hit.
[2024-05-29 02:24:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 02:24:41] [INFO ] Implicit Places using invariants and state equation in 2205 ms returned []
Implicit Place search using SMT with State Equation took 3710 ms to find 0 implicit places.
[2024-05-29 02:24:41] [INFO ] Redundant transitions in 326 ms returned []
[2024-05-29 02:24:41] [INFO ] Invariant cache hit.
[2024-05-29 02:24:43] [INFO ] Dead Transitions using invariants and state equation in 1614 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5754 ms. Remains : 2501/2501 places, 2400/2400 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 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 75 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2725 steps, including 0 resets, run visited all 1 properties in 58 ms. (steps per millisecond=46 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 104 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 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
[2024-05-29 02:24:43] [INFO ] Invariant cache hit.
[2024-05-29 02:24:48] [INFO ] [Real]Absence check using 901 positive place invariants in 1636 ms returned sat
[2024-05-29 02:24:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 02:24:58] [INFO ] [Real]Absence check using state equation in 10151 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 37 reset in 1616 ms.
Product exploration explored 100000 steps with 37 reset in 2015 ms.
Built C files in :
/tmp/ltsmin15915469140154540164
[2024-05-29 02:25:02] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:25:02] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15915469140154540164
Running compilation step : cd /tmp/ltsmin15915469140154540164;'/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/ltsmin15915469140154540164;'/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/ltsmin15915469140154540164;'/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 2 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 79 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-29 02:25:05] [INFO ] Invariant cache hit.
[2024-05-29 02:25:07] [INFO ] Implicit Places using invariants in 1445 ms returned []
[2024-05-29 02:25:07] [INFO ] Invariant cache hit.
[2024-05-29 02:25:07] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 02:25:09] [INFO ] Implicit Places using invariants and state equation in 2139 ms returned []
Implicit Place search using SMT with State Equation took 3586 ms to find 0 implicit places.
[2024-05-29 02:25:09] [INFO ] Redundant transitions in 302 ms returned []
[2024-05-29 02:25:09] [INFO ] Invariant cache hit.
[2024-05-29 02:25:11] [INFO ] Dead Transitions using invariants and state equation in 1494 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5472 ms. Remains : 2501/2501 places, 2400/2400 transitions.
Built C files in :
/tmp/ltsmin11845869378120350219
[2024-05-29 02:25:11] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:25:11] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11845869378120350219
Running compilation step : cd /tmp/ltsmin11845869378120350219;'/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/ltsmin11845869378120350219;'/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/ltsmin11845869378120350219;'/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 02:25:14] [INFO ] Flatten gal took : 120 ms
[2024-05-29 02:25:14] [INFO ] Flatten gal took : 121 ms
[2024-05-29 02:25:14] [INFO ] Time to serialize gal into /tmp/LTL6413171559318884696.gal : 12 ms
[2024-05-29 02:25:14] [INFO ] Time to serialize properties into /tmp/LTL14270502163051729540.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/LTL6413171559318884696.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10451105677186463037.hoa' '-atoms' '/tmp/LTL14270502163051729540.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/LTL14270502163051729540.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10451105677186463037.hoa
Detected timeout of ITS tools.
[2024-05-29 02:25:29] [INFO ] Flatten gal took : 120 ms
[2024-05-29 02:25:29] [INFO ] Flatten gal took : 123 ms
[2024-05-29 02:25:29] [INFO ] Time to serialize gal into /tmp/LTL12584537235736838295.gal : 12 ms
[2024-05-29 02:25:29] [INFO ] Time to serialize properties into /tmp/LTL1244510148000845710.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/LTL12584537235736838295.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1244510148000845710.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(F("((p1139==1)&&(p1160==1))"))))
Formula 0 simplified : FG!"((p1139==1)&&(p1160==1))"
Detected timeout of ITS tools.
[2024-05-29 02:25:44] [INFO ] Flatten gal took : 154 ms
[2024-05-29 02:25:44] [INFO ] Applying decomposition
[2024-05-29 02:25:45] [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/graph322961499933248188.txt' '-o' '/tmp/graph322961499933248188.bin' '-w' '/tmp/graph322961499933248188.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph322961499933248188.bin' '-l' '-1' '-v' '-w' '/tmp/graph322961499933248188.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:25:45] [INFO ] Decomposing Gal with order
[2024-05-29 02:25:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:25:45] [INFO ] Removed a total of 1595 redundant transitions.
[2024-05-29 02:25:45] [INFO ] Flatten gal took : 113 ms
[2024-05-29 02:25:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 1560 labels/synchronizations in 168 ms.
[2024-05-29 02:25:45] [INFO ] Time to serialize gal into /tmp/LTL17300222716316063026.gal : 23 ms
[2024-05-29 02:25:45] [INFO ] Time to serialize properties into /tmp/LTL14478078634696367410.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17300222716316063026.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14478078634696367410.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 : !((G(F("((i20.i1.i1.u411.p1139==1)&&(i21.i0.i1.u418.p1160==1))"))))
Formula 0 simplified : FG!"((i20.i1.i1.u411.p1139==1)&&(i21.i0.i1.u418.p1160==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16693629161231596327
[2024-05-29 02:26:00] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16693629161231596327
Running compilation step : cd /tmp/ltsmin16693629161231596327;'/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/ltsmin16693629161231596327;'/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/ltsmin16693629161231596327;'/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 ShieldIIPs-PT-100A-LTLFireability-14 finished in 111786 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(p0) U G(!p1)) U p0)))'
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 62 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2024-05-29 02:26:04] [INFO ] Computed 901 invariants in 10 ms
[2024-05-29 02:26:05] [INFO ] Implicit Places using invariants in 1432 ms returned []
[2024-05-29 02:26:05] [INFO ] Invariant cache hit.
[2024-05-29 02:26:07] [INFO ] Implicit Places using invariants and state equation in 1908 ms returned []
Implicit Place search using SMT with State Equation took 3344 ms to find 0 implicit places.
[2024-05-29 02:26:07] [INFO ] Invariant cache hit.
[2024-05-29 02:26:08] [INFO ] Dead Transitions using invariants and state equation in 1486 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4894 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), p1, true, (AND p0 p1)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s1311 1) (EQ s1317 1) (EQ s1326 1)), p1:(AND (EQ s288 1) (EQ s298 1) (EQ s300 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20679 reset in 4522 ms.
Product exploration explored 100000 steps with 20731 reset in 4854 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)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) 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 12 factoid took 148 ms. Reduced automaton from 7 states, 19 edges and 2 AP (stutter sensitive) to 6 states, 16 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), p1, true, (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 6) 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 4) 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 4) 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 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2024-05-29 02:26:19] [INFO ] Invariant cache hit.
[2024-05-29 02:26:20] [INFO ] [Real]Absence check using 901 positive place invariants in 198 ms returned sat
[2024-05-29 02:26:22] [INFO ] After 2560ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 02:26:23] [INFO ] [Nat]Absence check using 901 positive place invariants in 190 ms returned sat
[2024-05-29 02:26:34] [INFO ] After 11557ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 02:26:38] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 1 ms to minimize.
[2024-05-29 02:26:38] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2024-05-29 02:26:38] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 1 ms to minimize.
[2024-05-29 02:26:38] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 0 ms to minimize.
[2024-05-29 02:26:39] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 0 ms to minimize.
[2024-05-29 02:26:39] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 1 ms to minimize.
[2024-05-29 02:26:39] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 0 ms to minimize.
[2024-05-29 02:26:39] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 0 ms to minimize.
[2024-05-29 02:26:40] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2024-05-29 02:26:40] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2024-05-29 02:26:40] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2024-05-29 02:26:40] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-05-29 02:26:40] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2024-05-29 02:26:41] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 0 ms to minimize.
[2024-05-29 02:26:41] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-29 02:26:41] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-29 02:26:41] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2024-05-29 02:26:41] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-29 02:26:41] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-05-29 02:26:42] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 4211 ms
[2024-05-29 02:26:45] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 0 ms to minimize.
[2024-05-29 02:26:45] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 0 ms to minimize.
[2024-05-29 02:26:45] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 1 ms to minimize.
[2024-05-29 02:26:45] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 1 ms to minimize.
[2024-05-29 02:26:46] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 1 ms to minimize.
[2024-05-29 02:26:46] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 1 ms to minimize.
[2024-05-29 02:26:46] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 1 ms to minimize.
[2024-05-29 02:26:47] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 0 ms to minimize.
[2024-05-29 02:26:47] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 0 ms to minimize.
[2024-05-29 02:26:47] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 02:26:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:26:47] [INFO ] After 25130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 1919 ms.
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
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 2502 transition count 2402
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 2501 transition count 2401
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 0 with 696 rules applied. Total rules applied 700 place count 2501 transition count 2401
Applied a total of 700 rules in 241 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 4) 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 4) 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 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 106442 steps, run timeout after 3002 ms. (steps per millisecond=35 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 106442 steps, saw 104821 distinct states, run finished after 3002 ms. (steps per millisecond=35 ) properties seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-29 02:26:53] [INFO ] Computed 901 invariants in 20 ms
[2024-05-29 02:26:54] [INFO ] [Real]Absence check using 900 positive place invariants in 193 ms returned sat
[2024-05-29 02:26:54] [INFO ] [Real]Absence check using 900 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-29 02:26:55] [INFO ] After 2042ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:26:56] [INFO ] [Nat]Absence check using 900 positive place invariants in 184 ms returned sat
[2024-05-29 02:26:56] [INFO ] [Nat]Absence check using 900 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-29 02:27:06] [INFO ] After 10851ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 80 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 2501/2501 places, 2401/2401 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 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 138120 steps, run timeout after 3002 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 138120 steps, saw 136171 distinct states, run finished after 3003 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 02:27:09] [INFO ] Invariant cache hit.
[2024-05-29 02:27:10] [INFO ] [Real]Absence check using 900 positive place invariants in 193 ms returned sat
[2024-05-29 02:27:10] [INFO ] [Real]Absence check using 900 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-29 02:27:12] [INFO ] After 2097ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:27:12] [INFO ] [Nat]Absence check using 900 positive place invariants in 191 ms returned sat
[2024-05-29 02:27:12] [INFO ] [Nat]Absence check using 900 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-29 02:27:23] [INFO ] After 10933ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 100 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 96 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2024-05-29 02:27:23] [INFO ] Invariant cache hit.
[2024-05-29 02:27:25] [INFO ] Implicit Places using invariants in 1880 ms returned []
[2024-05-29 02:27:25] [INFO ] Invariant cache hit.
[2024-05-29 02:27:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 02:27:31] [INFO ] Implicit Places using invariants and state equation in 6373 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 8256 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 74 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8427 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 141191 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 141191 steps, saw 139209 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2024-05-29 02:27:34] [INFO ] Computed 900 invariants in 25 ms
[2024-05-29 02:27:35] [INFO ] [Real]Absence check using 899 positive place invariants in 185 ms returned sat
[2024-05-29 02:27:35] [INFO ] [Real]Absence check using 899 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-29 02:27:36] [INFO ] After 2078ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:27:37] [INFO ] [Nat]Absence check using 899 positive place invariants in 183 ms returned sat
[2024-05-29 02:27:37] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-29 02:27:47] [INFO ] After 10851ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 86 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 72 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2024-05-29 02:27:47] [INFO ] Invariant cache hit.
[2024-05-29 02:27:49] [INFO ] Implicit Places using invariants in 1829 ms returned []
[2024-05-29 02:27:49] [INFO ] Invariant cache hit.
[2024-05-29 02:27:54] [INFO ] Implicit Places using invariants and state equation in 4796 ms returned []
Implicit Place search using SMT with State Equation took 6626 ms to find 0 implicit places.
[2024-05-29 02:27:54] [INFO ] Redundant transitions in 77 ms returned []
[2024-05-29 02:27:54] [INFO ] Invariant cache hit.
[2024-05-29 02:27:56] [INFO ] Dead Transitions using invariants and state equation in 1544 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8325 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 91 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 02:27:56] [INFO ] Invariant cache hit.
[2024-05-29 02:27:56] [INFO ] [Real]Absence check using 899 positive place invariants in 189 ms returned sat
[2024-05-29 02:27:56] [INFO ] [Real]Absence check using 899 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-29 02:27:58] [INFO ] After 2108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:27:59] [INFO ] [Nat]Absence check using 899 positive place invariants in 189 ms returned sat
[2024-05-29 02:27:59] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-29 02:28:09] [INFO ] After 10911ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0)), (F (NOT (OR (NOT p1) p0))), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 12 factoid took 158 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-100A-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100A-LTLFireability-15 finished in 125603 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&&X(p1)))))'
Found a Shortening insensitive property : ShieldIIPs-PT-100A-LTLFireability-01
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2502 transition count 2401
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2500 transition count 2401
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 5 place count 2499 transition count 2400
Applied a total of 5 rules in 188 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2024-05-29 02:28:09] [INFO ] Computed 900 invariants in 8 ms
[2024-05-29 02:28:11] [INFO ] Implicit Places using invariants in 1503 ms returned []
[2024-05-29 02:28:11] [INFO ] Invariant cache hit.
[2024-05-29 02:28:13] [INFO ] Implicit Places using invariants and state equation in 2109 ms returned []
Implicit Place search using SMT with State Equation took 3622 ms to find 0 implicit places.
[2024-05-29 02:28:13] [INFO ] Invariant cache hit.
[2024-05-29 02:28:15] [INFO ] Dead Transitions using invariants and state equation in 1580 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2499/2503 places, 2400/2403 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5392 ms. Remains : 2499/2503 places, 2400/2403 transitions.
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s2149 0), p1:(OR (EQ s935 0) (EQ s939 0) (EQ s950 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33380 reset in 2497 ms.
Product exploration explored 100000 steps with 33364 reset in 2796 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 p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 120 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 02:28:21] [INFO ] Invariant cache hit.
[2024-05-29 02:28:21] [INFO ] [Real]Absence check using 900 positive place invariants in 204 ms returned sat
[2024-05-29 02:28:23] [INFO ] After 2081ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:28:23] [INFO ] [Nat]Absence check using 900 positive place invariants in 201 ms returned sat
[2024-05-29 02:28:25] [INFO ] After 1346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:28:25] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-29 02:28:25] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2024-05-29 02:28:25] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-05-29 02:28:25] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-29 02:28:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 616 ms
[2024-05-29 02:28:25] [INFO ] After 2031ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 86 ms.
[2024-05-29 02:28:26] [INFO ] After 2836ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 52 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Partial Free-agglomeration rule applied 595 times.
Drop transitions removed 595 transitions
Iterating global reduction 0 with 595 rules applied. Total rules applied 595 place count 2499 transition count 2400
Applied a total of 595 rules in 170 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 209 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 129 ms. (steps per millisecond=77 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 133574 steps, run timeout after 3003 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133574 steps, saw 131860 distinct states, run finished after 3005 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2024-05-29 02:28:29] [INFO ] Computed 900 invariants in 19 ms
[2024-05-29 02:28:30] [INFO ] [Real]Absence check using 900 positive place invariants in 189 ms returned sat
[2024-05-29 02:28:31] [INFO ] After 2038ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:28:32] [INFO ] [Nat]Absence check using 900 positive place invariants in 191 ms returned sat
[2024-05-29 02:28:33] [INFO ] After 1322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:28:33] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 0 ms to minimize.
[2024-05-29 02:28:34] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 0 ms to minimize.
[2024-05-29 02:28:34] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 0 ms to minimize.
[2024-05-29 02:28:34] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2024-05-29 02:28:34] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 0 ms to minimize.
[2024-05-29 02:28:34] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 0 ms to minimize.
[2024-05-29 02:28:35] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 0 ms to minimize.
[2024-05-29 02:28:35] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 0 ms to minimize.
[2024-05-29 02:28:35] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-29 02:28:35] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 0 ms to minimize.
[2024-05-29 02:28:35] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-29 02:28:35] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 0 ms to minimize.
[2024-05-29 02:28:36] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2024-05-29 02:28:36] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2024-05-29 02:28:36] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-29 02:28:36] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2685 ms
[2024-05-29 02:28:36] [INFO ] After 4073ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2024-05-29 02:28:36] [INFO ] After 4850ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 43 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 82 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 100 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-29 02:28:36] [INFO ] Invariant cache hit.
[2024-05-29 02:28:38] [INFO ] Implicit Places using invariants in 1879 ms returned []
[2024-05-29 02:28:38] [INFO ] Invariant cache hit.
[2024-05-29 02:28:41] [INFO ] Implicit Places using invariants and state equation in 2643 ms returned []
Implicit Place search using SMT with State Equation took 4523 ms to find 0 implicit places.
[2024-05-29 02:28:41] [INFO ] Redundant transitions in 104 ms returned []
[2024-05-29 02:28:41] [INFO ] Invariant cache hit.
[2024-05-29 02:28:43] [INFO ] Dead Transitions using invariants and state equation in 1591 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6329 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 78 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 02:28:43] [INFO ] Invariant cache hit.
[2024-05-29 02:28:43] [INFO ] [Real]Absence check using 900 positive place invariants in 197 ms returned sat
[2024-05-29 02:28:45] [INFO ] After 2053ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:28:45] [INFO ] [Nat]Absence check using 900 positive place invariants in 184 ms returned sat
[2024-05-29 02:28:47] [INFO ] After 1346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:28:47] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 0 ms to minimize.
[2024-05-29 02:28:47] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2024-05-29 02:28:47] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 0 ms to minimize.
[2024-05-29 02:28:48] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 0 ms to minimize.
[2024-05-29 02:28:48] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 0 ms to minimize.
[2024-05-29 02:28:48] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 0 ms to minimize.
[2024-05-29 02:28:48] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 0 ms to minimize.
[2024-05-29 02:28:49] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 0 ms to minimize.
[2024-05-29 02:28:49] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 0 ms to minimize.
[2024-05-29 02:28:49] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 0 ms to minimize.
[2024-05-29 02:28:49] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 1 ms to minimize.
[2024-05-29 02:28:49] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
[2024-05-29 02:28:49] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2024-05-29 02:28:50] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-29 02:28:50] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2024-05-29 02:28:50] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-29 02:28:50] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2024-05-29 02:28:50] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-29 02:28:50] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3717 ms
[2024-05-29 02:28:50] [INFO ] After 5132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 129 ms.
[2024-05-29 02:28:51] [INFO ] After 5918ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 7 factoid took 185 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 68 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2024-05-29 02:28:51] [INFO ] Computed 900 invariants in 8 ms
[2024-05-29 02:28:53] [INFO ] Implicit Places using invariants in 1523 ms returned []
[2024-05-29 02:28:53] [INFO ] Invariant cache hit.
[2024-05-29 02:28:55] [INFO ] Implicit Places using invariants and state equation in 2028 ms returned []
Implicit Place search using SMT with State Equation took 3553 ms to find 0 implicit places.
[2024-05-29 02:28:55] [INFO ] Invariant cache hit.
[2024-05-29 02:28:56] [INFO ] Dead Transitions using invariants and state equation in 1438 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5060 ms. Remains : 2499/2499 places, 2400/2400 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 p0 p1), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 91 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 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 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 02:28:57] [INFO ] Invariant cache hit.
[2024-05-29 02:28:58] [INFO ] [Real]Absence check using 900 positive place invariants in 193 ms returned sat
[2024-05-29 02:28:59] [INFO ] After 2226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:29:00] [INFO ] [Nat]Absence check using 900 positive place invariants in 182 ms returned sat
[2024-05-29 02:29:01] [INFO ] After 1400ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 02:29:01] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2024-05-29 02:29:02] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2024-05-29 02:29:02] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
[2024-05-29 02:29:02] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-29 02:29:02] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2024-05-29 02:29:02] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 0 ms to minimize.
[2024-05-29 02:29:02] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 0 ms to minimize.
[2024-05-29 02:29:03] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 0 ms to minimize.
[2024-05-29 02:29:03] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1303 ms
[2024-05-29 02:29:03] [INFO ] After 2911ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 168 ms.
[2024-05-29 02:29:03] [INFO ] After 3790ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 245 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Partial Free-agglomeration rule applied 595 times.
Drop transitions removed 595 transitions
Iterating global reduction 0 with 595 rules applied. Total rules applied 595 place count 2499 transition count 2400
Applied a total of 595 rules in 156 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 108659 steps, run timeout after 3002 ms. (steps per millisecond=36 ) properties seen :{1=1}
Probabilistic random walk after 108659 steps, saw 107184 distinct states, run finished after 3003 ms. (steps per millisecond=36 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2024-05-29 02:29:07] [INFO ] Computed 900 invariants in 19 ms
[2024-05-29 02:29:08] [INFO ] [Real]Absence check using 900 positive place invariants in 186 ms returned sat
[2024-05-29 02:29:09] [INFO ] After 2043ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:29:10] [INFO ] [Nat]Absence check using 900 positive place invariants in 176 ms returned sat
[2024-05-29 02:29:11] [INFO ] After 1284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:29:11] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 0 ms to minimize.
[2024-05-29 02:29:11] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 1 ms to minimize.
[2024-05-29 02:29:12] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 0 ms to minimize.
[2024-05-29 02:29:12] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2024-05-29 02:29:12] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 0 ms to minimize.
[2024-05-29 02:29:12] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 0 ms to minimize.
[2024-05-29 02:29:12] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 0 ms to minimize.
[2024-05-29 02:29:13] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 0 ms to minimize.
[2024-05-29 02:29:13] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 0 ms to minimize.
[2024-05-29 02:29:13] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-05-29 02:29:13] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2024-05-29 02:29:13] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 0 ms to minimize.
[2024-05-29 02:29:13] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2024-05-29 02:29:14] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-29 02:29:14] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-29 02:29:14] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2785 ms
[2024-05-29 02:29:14] [INFO ] After 4130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 96 ms.
[2024-05-29 02:29:14] [INFO ] After 4840ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 56 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 71 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 206 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 132 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 142691 steps, run timeout after 3002 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 142691 steps, saw 140896 distinct states, run finished after 3002 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 02:29:17] [INFO ] Invariant cache hit.
[2024-05-29 02:29:18] [INFO ] [Real]Absence check using 900 positive place invariants in 181 ms returned sat
[2024-05-29 02:29:19] [INFO ] After 1891ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:29:20] [INFO ] [Nat]Absence check using 900 positive place invariants in 179 ms returned sat
[2024-05-29 02:29:21] [INFO ] After 1277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:29:21] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 1 ms to minimize.
[2024-05-29 02:29:22] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 1 ms to minimize.
[2024-05-29 02:29:22] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 0 ms to minimize.
[2024-05-29 02:29:22] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 1 ms to minimize.
[2024-05-29 02:29:22] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 0 ms to minimize.
[2024-05-29 02:29:23] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 0 ms to minimize.
[2024-05-29 02:29:23] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 1 ms to minimize.
[2024-05-29 02:29:23] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 1 ms to minimize.
[2024-05-29 02:29:23] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 0 ms to minimize.
[2024-05-29 02:29:23] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 0 ms to minimize.
[2024-05-29 02:29:24] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2024-05-29 02:29:24] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 0 ms to minimize.
[2024-05-29 02:29:24] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 0 ms to minimize.
[2024-05-29 02:29:24] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2024-05-29 02:29:24] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2024-05-29 02:29:24] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2024-05-29 02:29:25] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-29 02:29:25] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-29 02:29:25] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3673 ms
[2024-05-29 02:29:25] [INFO ] After 5013ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 129 ms.
[2024-05-29 02:29:25] [INFO ] After 5753ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 73 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 72 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 84 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-29 02:29:25] [INFO ] Invariant cache hit.
[2024-05-29 02:29:27] [INFO ] Implicit Places using invariants in 1836 ms returned []
[2024-05-29 02:29:27] [INFO ] Invariant cache hit.
[2024-05-29 02:29:30] [INFO ] Implicit Places using invariants and state equation in 2639 ms returned []
Implicit Place search using SMT with State Equation took 4479 ms to find 0 implicit places.
[2024-05-29 02:29:30] [INFO ] Redundant transitions in 98 ms returned []
[2024-05-29 02:29:30] [INFO ] Invariant cache hit.
[2024-05-29 02:29:31] [INFO ] Dead Transitions using invariants and state equation in 1465 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6138 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 74 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 02:29:31] [INFO ] Invariant cache hit.
[2024-05-29 02:29:32] [INFO ] [Real]Absence check using 900 positive place invariants in 193 ms returned sat
[2024-05-29 02:29:33] [INFO ] After 2076ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:29:34] [INFO ] [Nat]Absence check using 900 positive place invariants in 192 ms returned sat
[2024-05-29 02:29:35] [INFO ] After 1287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:29:36] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 0 ms to minimize.
[2024-05-29 02:29:36] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 0 ms to minimize.
[2024-05-29 02:29:36] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 0 ms to minimize.
[2024-05-29 02:29:36] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 1 ms to minimize.
[2024-05-29 02:29:37] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 1 ms to minimize.
[2024-05-29 02:29:37] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 0 ms to minimize.
[2024-05-29 02:29:37] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 1 ms to minimize.
[2024-05-29 02:29:37] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 1 ms to minimize.
[2024-05-29 02:29:37] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 0 ms to minimize.
[2024-05-29 02:29:38] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 0 ms to minimize.
[2024-05-29 02:29:38] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 0 ms to minimize.
[2024-05-29 02:29:38] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2024-05-29 02:29:38] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
[2024-05-29 02:29:38] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2024-05-29 02:29:39] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 02:29:39] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-29 02:29:39] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2024-05-29 02:29:39] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-29 02:29:39] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3684 ms
[2024-05-29 02:29:39] [INFO ] After 5038ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 136 ms.
[2024-05-29 02:29:39] [INFO ] After 5850ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 7 factoid took 144 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33388 reset in 2590 ms.
Product exploration explored 100000 steps with 33217 reset in 2843 ms.
Built C files in :
/tmp/ltsmin12276750850923894329
[2024-05-29 02:29:45] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12276750850923894329
Running compilation step : cd /tmp/ltsmin12276750850923894329;'/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/ltsmin12276750850923894329;'/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/ltsmin12276750850923894329;'/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 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 67 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2024-05-29 02:29:48] [INFO ] Computed 900 invariants in 7 ms
[2024-05-29 02:29:50] [INFO ] Implicit Places using invariants in 1346 ms returned []
[2024-05-29 02:29:50] [INFO ] Invariant cache hit.
[2024-05-29 02:29:52] [INFO ] Implicit Places using invariants and state equation in 2102 ms returned []
Implicit Place search using SMT with State Equation took 3449 ms to find 0 implicit places.
[2024-05-29 02:29:52] [INFO ] Invariant cache hit.
[2024-05-29 02:29:53] [INFO ] Dead Transitions using invariants and state equation in 1435 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4952 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Built C files in :
/tmp/ltsmin1563751232185847402
[2024-05-29 02:29:53] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1563751232185847402
Running compilation step : cd /tmp/ltsmin1563751232185847402;'/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/ltsmin1563751232185847402;'/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/ltsmin1563751232185847402;'/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 02:29:57] [INFO ] Flatten gal took : 70 ms
[2024-05-29 02:29:57] [INFO ] Flatten gal took : 80 ms
[2024-05-29 02:29:57] [INFO ] Time to serialize gal into /tmp/LTL12325395991209007631.gal : 11 ms
[2024-05-29 02:29:57] [INFO ] Time to serialize properties into /tmp/LTL11188471241730004791.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/LTL12325395991209007631.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10898758139240431528.hoa' '-atoms' '/tmp/LTL11188471241730004791.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...320
Loading property file /tmp/LTL11188471241730004791.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10898758139240431528.hoa
Detected timeout of ITS tools.
[2024-05-29 02:30:12] [INFO ] Flatten gal took : 69 ms
[2024-05-29 02:30:12] [INFO ] Flatten gal took : 129 ms
[2024-05-29 02:30:12] [INFO ] Time to serialize gal into /tmp/LTL9232153340971410364.gal : 29 ms
[2024-05-29 02:30:12] [INFO ] Time to serialize properties into /tmp/LTL16404299579388376297.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/LTL9232153340971410364.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16404299579388376297.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(F(("(p2150==0)")&&(X("(((p936==0)||(p940==0))||(p951==0))"))))))
Formula 0 simplified : FG(!"(p2150==0)" | X!"(((p936==0)||(p940==0))||(p951==0))")
Detected timeout of ITS tools.
[2024-05-29 02:30:27] [INFO ] Flatten gal took : 70 ms
[2024-05-29 02:30:27] [INFO ] Applying decomposition
[2024-05-29 02:30:27] [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/graph3421500365077046010.txt' '-o' '/tmp/graph3421500365077046010.bin' '-w' '/tmp/graph3421500365077046010.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3421500365077046010.bin' '-l' '-1' '-v' '-w' '/tmp/graph3421500365077046010.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:30:27] [INFO ] Decomposing Gal with order
[2024-05-29 02:30:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:30:28] [INFO ] Removed a total of 1597 redundant transitions.
[2024-05-29 02:30:28] [INFO ] Flatten gal took : 105 ms
[2024-05-29 02:30:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 1568 labels/synchronizations in 17 ms.
[2024-05-29 02:30:28] [INFO ] Time to serialize gal into /tmp/LTL12894660898176061571.gal : 18 ms
[2024-05-29 02:30:28] [INFO ] Time to serialize properties into /tmp/LTL10344852529622318401.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/LTL12894660898176061571.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10344852529622318401.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 : !((G(F(("(i39.i0.i0.u774.p2150==0)")&&(X("(((i17.i0.i0.u337.p936==0)||(i17.i0.i0.u339.p940==0))||(i17.i0.i2.u342.p951==0))"))))))
Formula 0 simplified : FG(!"(i39.i0.i0.u774.p2150==0)" | X!"(((i17.i0.i0.u337.p936==0)||(i17.i0.i0.u339.p940==0))||(i17.i0.i2.u342.p951==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13953705852263719794
[2024-05-29 02:30:43] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13953705852263719794
Running compilation step : cd /tmp/ltsmin13953705852263719794;'/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/ltsmin13953705852263719794;'/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/ltsmin13953705852263719794;'/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 ShieldIIPs-PT-100A-LTLFireability-01 finished in 156834 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(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' '!(F((G(!p0)||(!p0&&G(F((!p1 U (G(!p1)||(!p1&&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' '!(X((G(p0)||F(G((p1||F(p2)))))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-100A-LTLFireability-07
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
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 2502 transition count 2402
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 4 place count 2501 transition count 2401
Applied a total of 4 rules in 205 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-29 02:30:47] [INFO ] Computed 901 invariants in 14 ms
[2024-05-29 02:30:48] [INFO ] Implicit Places using invariants in 1487 ms returned []
[2024-05-29 02:30:48] [INFO ] Invariant cache hit.
[2024-05-29 02:30:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 02:30:50] [INFO ] Implicit Places using invariants and state equation in 2174 ms returned []
Implicit Place search using SMT with State Equation took 3661 ms to find 0 implicit places.
[2024-05-29 02:30:50] [INFO ] Invariant cache hit.
[2024-05-29 02:30:52] [INFO ] Dead Transitions using invariants and state equation in 1550 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2501/2503 places, 2401/2403 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5421 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(AND (EQ s1482 1) (EQ s1484 1) (EQ s153 1) (EQ s174 1)), p1:(AND (EQ s1482 1) (EQ s1484 1)), p2:(EQ s772 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 30 reset in 1753 ms.
Product exploration explored 100000 steps with 30 reset in 2092 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 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 p0)), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 112 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 1887 steps, including 0 resets, run visited all 2 properties in 44 ms. (steps per millisecond=42 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 8 factoid took 133 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 76 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2024-05-29 02:30:56] [INFO ] Invariant cache hit.
[2024-05-29 02:31:01] [INFO ] [Real]Absence check using 901 positive place invariants in 1175 ms returned sat
[2024-05-29 02:31:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 02:31:11] [INFO ] [Real]Absence check using state equation in 10690 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 3 out of 2501 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 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 89 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2024-05-29 02:31:11] [INFO ] Invariant cache hit.
[2024-05-29 02:31:13] [INFO ] Implicit Places using invariants in 1487 ms returned []
[2024-05-29 02:31:13] [INFO ] Invariant cache hit.
[2024-05-29 02:31:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 02:31:15] [INFO ] Implicit Places using invariants and state equation in 2136 ms returned []
Implicit Place search using SMT with State Equation took 3626 ms to find 0 implicit places.
[2024-05-29 02:31:15] [INFO ] Redundant transitions in 324 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2501 cols
[2024-05-29 02:31:15] [INFO ] Computed 901 invariants in 15 ms
[2024-05-29 02:31:17] [INFO ] Dead Transitions using invariants and state equation in 1542 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2501 places, 2400/2401 transitions.
Applied a total of 0 rules in 78 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5668 ms. Remains : 2501/2501 places, 2400/2401 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 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 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 1884 steps, including 0 resets, run visited all 2 properties in 55 ms. (steps per millisecond=34 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 5 factoid took 122 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 74 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2024-05-29 02:31:17] [INFO ] Invariant cache hit.
[2024-05-29 02:31:22] [INFO ] [Real]Absence check using 901 positive place invariants in 1249 ms returned sat
[2024-05-29 02:31:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 02:31:33] [INFO ] [Real]Absence check using state equation in 10649 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 30 reset in 1698 ms.
Product exploration explored 100000 steps with 30 reset in 2098 ms.
Built C files in :
/tmp/ltsmin2644953364362785157
[2024-05-29 02:31:36] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:31:36] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2644953364362785157
Running compilation step : cd /tmp/ltsmin2644953364362785157;'/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/ltsmin2644953364362785157;'/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/ltsmin2644953364362785157;'/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 2501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2499 transition count 2399
Applied a total of 1 rules in 106 ms. Remains 2499 /2501 variables (removed 2) and now considering 2399/2400 (removed 1) transitions.
// Phase 1: matrix 2399 rows 2499 cols
[2024-05-29 02:31:40] [INFO ] Computed 900 invariants in 10 ms
[2024-05-29 02:31:41] [INFO ] Implicit Places using invariants in 1489 ms returned []
[2024-05-29 02:31:41] [INFO ] Invariant cache hit.
[2024-05-29 02:31:43] [INFO ] Implicit Places using invariants and state equation in 2011 ms returned []
Implicit Place search using SMT with State Equation took 3502 ms to find 0 implicit places.
[2024-05-29 02:31:43] [INFO ] Redundant transitions in 323 ms returned []
[2024-05-29 02:31:43] [INFO ] Invariant cache hit.
[2024-05-29 02:31:45] [INFO ] Dead Transitions using invariants and state equation in 1429 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/2501 places, 2399/2400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5381 ms. Remains : 2499/2501 places, 2399/2400 transitions.
Built C files in :
/tmp/ltsmin1463003327522754589
[2024-05-29 02:31:45] [INFO ] Too many transitions (2399) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:31:45] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1463003327522754589
Running compilation step : cd /tmp/ltsmin1463003327522754589;'/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/ltsmin1463003327522754589;'/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/ltsmin1463003327522754589;'/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 02:31:48] [INFO ] Flatten gal took : 70 ms
[2024-05-29 02:31:48] [INFO ] Flatten gal took : 69 ms
[2024-05-29 02:31:48] [INFO ] Time to serialize gal into /tmp/LTL15918829242372876309.gal : 11 ms
[2024-05-29 02:31:48] [INFO ] Time to serialize properties into /tmp/LTL15077562469430721785.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/LTL15918829242372876309.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13345279218204652008.hoa' '-atoms' '/tmp/LTL15077562469430721785.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...320
Loading property file /tmp/LTL15077562469430721785.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13345279218204652008.hoa
Detected timeout of ITS tools.
[2024-05-29 02:32:03] [INFO ] Flatten gal took : 146 ms
[2024-05-29 02:32:04] [INFO ] Flatten gal took : 114 ms
[2024-05-29 02:32:04] [INFO ] Time to serialize gal into /tmp/LTL8173962075521411223.gal : 11 ms
[2024-05-29 02:32:04] [INFO ] Time to serialize properties into /tmp/LTL3933772033810409589.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/LTL8173962075521411223.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3933772033810409589.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("(((p1482==1)&&(p1484==1))&&((p153==1)&&(p174==1)))"))||(F(G(("((p1482==1)&&(p1484==1))")||(F("(p772==1)"))))))))
Formula 0 simplified : X(F!"(((p1482==1)&&(p1484==1))&&((p153==1)&&(p174==1)))" & G(F!"((p1482==1)&&(p1484==1))" & FG!"(p772==1)"))
Detected timeout of ITS tools.
[2024-05-29 02:32:19] [INFO ] Flatten gal took : 121 ms
[2024-05-29 02:32:19] [INFO ] Applying decomposition
[2024-05-29 02:32:19] [INFO ] Flatten gal took : 126 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/graph4314680470551387195.txt' '-o' '/tmp/graph4314680470551387195.bin' '-w' '/tmp/graph4314680470551387195.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4314680470551387195.bin' '-l' '-1' '-v' '-w' '/tmp/graph4314680470551387195.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:32:19] [INFO ] Decomposing Gal with order
[2024-05-29 02:32:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:32:19] [INFO ] Removed a total of 1595 redundant transitions.
[2024-05-29 02:32:19] [INFO ] Flatten gal took : 123 ms
[2024-05-29 02:32:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 1552 labels/synchronizations in 170 ms.
[2024-05-29 02:32:20] [INFO ] Time to serialize gal into /tmp/LTL9077011690728786476.gal : 23 ms
[2024-05-29 02:32:20] [INFO ] Time to serialize properties into /tmp/LTL17116328305017331540.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9077011690728786476.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17116328305017331540.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("(((i27.i0.i2.u533.p1482==1)&&(i27.i0.i1.u534.p1484==1))&&((i3.i1.i1.u55.p153==1)&&(i3.i1.i2.u63.p174==1)))"))||(F(G(("((i27.i...243
Formula 0 simplified : X(F!"(((i27.i0.i2.u533.p1482==1)&&(i27.i0.i1.u534.p1484==1))&&((i3.i1.i1.u55.p153==1)&&(i3.i1.i2.u63.p174==1)))" & G(F!"((i27.i0.i2....232
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14442842859210339207
[2024-05-29 02:32:35] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14442842859210339207
Running compilation step : cd /tmp/ltsmin14442842859210339207;'/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/ltsmin14442842859210339207;'/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/ltsmin14442842859210339207;'/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 ShieldIIPs-PT-100A-LTLFireability-07 finished in 111655 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&&X((!p0 U (!p1||G(!p0))))))))'
Found a Shortening insensitive property : ShieldIIPs-PT-100A-LTLFireability-10
Stuttering acceptance computed with spot in 110 ms :[p0, p0, (AND p0 p1)]
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 18 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 22 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 184 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-29 02:32:38] [INFO ] Computed 901 invariants in 10 ms
[2024-05-29 02:32:40] [INFO ] Implicit Places using invariants in 1521 ms returned []
[2024-05-29 02:32:40] [INFO ] Invariant cache hit.
[2024-05-29 02:32:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 02:32:42] [INFO ] Implicit Places using invariants and state equation in 2220 ms returned []
Implicit Place search using SMT with State Equation took 3743 ms to find 0 implicit places.
[2024-05-29 02:32:42] [INFO ] Invariant cache hit.
[2024-05-29 02:32:43] [INFO ] Dead Transitions using invariants and state equation in 1514 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2501/2503 places, 2401/2403 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5441 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s656 1) (EQ s666 1)), p1:(AND (EQ s862 1) (EQ s895 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33351 reset in 6677 ms.
Product exploration explored 100000 steps with 33185 reset in 6888 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 99 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[p0, p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 02:32:58] [INFO ] Invariant cache hit.
[2024-05-29 02:32:58] [INFO ] [Real]Absence check using 901 positive place invariants in 185 ms returned sat
[2024-05-29 02:33:00] [INFO ] After 2253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:33:01] [INFO ] [Nat]Absence check using 901 positive place invariants in 202 ms returned sat
[2024-05-29 02:33:10] [INFO ] After 9091ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 02:33:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 02:33:12] [INFO ] After 2246ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 02:33:12] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2024-05-29 02:33:13] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 0 ms to minimize.
[2024-05-29 02:33:13] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2024-05-29 02:33:13] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2024-05-29 02:33:13] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 0 ms to minimize.
[2024-05-29 02:33:14] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 0 ms to minimize.
[2024-05-29 02:33:14] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2024-05-29 02:33:14] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 0 ms to minimize.
[2024-05-29 02:33:14] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 0 ms to minimize.
[2024-05-29 02:33:14] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2024-05-29 02:33:14] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 0 ms to minimize.
[2024-05-29 02:33:15] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 0 ms to minimize.
[2024-05-29 02:33:15] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2024-05-29 02:33:15] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 0 ms to minimize.
[2024-05-29 02:33:15] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 0 ms to minimize.
[2024-05-29 02:33:15] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 0 ms to minimize.
[2024-05-29 02:33:15] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-29 02:33:16] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 3 ms to minimize.
[2024-05-29 02:33:16] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3467 ms
[2024-05-29 02:33:23] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 1 ms to minimize.
[2024-05-29 02:33:25] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 2631 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 02:33:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:33:25] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 852 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 0 with 695 rules applied. Total rules applied 695 place count 2501 transition count 2401
Applied a total of 695 rules in 147 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 102386 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102386 steps, saw 100151 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-29 02:33:30] [INFO ] Computed 901 invariants in 22 ms
[2024-05-29 02:33:30] [INFO ] [Real]Absence check using 898 positive place invariants in 197 ms returned sat
[2024-05-29 02:33:30] [INFO ] [Real]Absence check using 898 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:33:32] [INFO ] After 2328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:33:33] [INFO ] [Nat]Absence check using 898 positive place invariants in 190 ms returned sat
[2024-05-29 02:33:33] [INFO ] [Nat]Absence check using 898 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:33:43] [INFO ] After 10332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:33:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 02:33:44] [INFO ] After 971ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 02:33:45] [INFO ] Deduced a trap composed of 5 places in 258 ms of which 0 ms to minimize.
[2024-05-29 02:33:45] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 0 ms to minimize.
[2024-05-29 02:33:53] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 0 ms to minimize.
[2024-05-29 02:33:53] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 0 ms to minimize.
[2024-05-29 02:33:54] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 0 ms to minimize.
[2024-05-29 02:33:54] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 1 ms to minimize.
[2024-05-29 02:33:54] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 1 ms to minimize.
[2024-05-29 02:33:54] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 0 ms to minimize.
[2024-05-29 02:33:55] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 0 ms to minimize.
[2024-05-29 02:33:57] [INFO ] Trap strengthening (SAT) tested/added 9/9 trap constraints in 12905 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 02:33:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:33:57] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 238 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 74 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 77 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2024-05-29 02:33:57] [INFO ] Invariant cache hit.
[2024-05-29 02:33:59] [INFO ] Implicit Places using invariants in 1871 ms returned []
[2024-05-29 02:33:59] [INFO ] Invariant cache hit.
[2024-05-29 02:34:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 02:34:06] [INFO ] Implicit Places using invariants and state equation in 6535 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 8411 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 78 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8567 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 343 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 125 ms. (steps per millisecond=80 ) 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
Interrupted probabilistic random walk after 95877 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95877 steps, saw 93741 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2024-05-29 02:34:10] [INFO ] Computed 900 invariants in 15 ms
[2024-05-29 02:34:10] [INFO ] [Real]Absence check using 897 positive place invariants in 199 ms returned sat
[2024-05-29 02:34:10] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:34:12] [INFO ] After 2303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:34:13] [INFO ] [Nat]Absence check using 897 positive place invariants in 208 ms returned sat
[2024-05-29 02:34:13] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:34:23] [INFO ] After 10402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:34:26] [INFO ] Deduced a trap composed of 6 places in 279 ms of which 0 ms to minimize.
[2024-05-29 02:34:27] [INFO ] Deduced a trap composed of 8 places in 277 ms of which 0 ms to minimize.
[2024-05-29 02:34:27] [INFO ] Deduced a trap composed of 5 places in 276 ms of which 1 ms to minimize.
[2024-05-29 02:34:27] [INFO ] Deduced a trap composed of 6 places in 271 ms of which 1 ms to minimize.
[2024-05-29 02:34:28] [INFO ] Deduced a trap composed of 19 places in 295 ms of which 1 ms to minimize.
[2024-05-29 02:34:28] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 0 ms to minimize.
[2024-05-29 02:34:28] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 0 ms to minimize.
[2024-05-29 02:34:29] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 0 ms to minimize.
[2024-05-29 02:34:32] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 0 ms to minimize.
[2024-05-29 02:34:35] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 1 ms to minimize.
[2024-05-29 02:34:35] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 1 ms to minimize.
[2024-05-29 02:34:36] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 1 ms to minimize.
[2024-05-29 02:34:36] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 0 ms to minimize.
[2024-05-29 02:34:36] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-05-29 02:34:37] [INFO ] Trap strengthening (SAT) tested/added 14/14 trap constraints in 11083 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 02:34:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:34:37] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 103 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 95 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 75 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2024-05-29 02:34:37] [INFO ] Invariant cache hit.
[2024-05-29 02:34:39] [INFO ] Implicit Places using invariants in 1807 ms returned []
[2024-05-29 02:34:39] [INFO ] Invariant cache hit.
[2024-05-29 02:34:44] [INFO ] Implicit Places using invariants and state equation in 5015 ms returned []
Implicit Place search using SMT with State Equation took 6857 ms to find 0 implicit places.
[2024-05-29 02:34:44] [INFO ] Redundant transitions in 74 ms returned []
[2024-05-29 02:34:44] [INFO ] Invariant cache hit.
[2024-05-29 02:34:46] [INFO ] Dead Transitions using invariants and state equation in 1653 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8667 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0)))]
Knowledge based reduction with 7 factoid took 119 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 113 ms :[p0, p0, (AND p0 p1)]
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 69 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-29 02:34:46] [INFO ] Computed 901 invariants in 4 ms
[2024-05-29 02:34:48] [INFO ] Implicit Places using invariants in 1454 ms returned []
[2024-05-29 02:34:48] [INFO ] Invariant cache hit.
[2024-05-29 02:34:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 02:34:50] [INFO ] Implicit Places using invariants and state equation in 2009 ms returned []
Implicit Place search using SMT with State Equation took 3469 ms to find 0 implicit places.
[2024-05-29 02:34:50] [INFO ] Invariant cache hit.
[2024-05-29 02:34:51] [INFO ] Dead Transitions using invariants and state equation in 1552 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5098 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 82 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[p0, p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 02:34:52] [INFO ] Invariant cache hit.
[2024-05-29 02:34:53] [INFO ] [Real]Absence check using 901 positive place invariants in 172 ms returned sat
[2024-05-29 02:34:54] [INFO ] After 2093ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:34:55] [INFO ] [Nat]Absence check using 901 positive place invariants in 207 ms returned sat
[2024-05-29 02:35:05] [INFO ] After 9834ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 02:35:05] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 02:35:07] [INFO ] After 2169ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 02:35:07] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 0 ms to minimize.
[2024-05-29 02:35:07] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
[2024-05-29 02:35:08] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 1 ms to minimize.
[2024-05-29 02:35:08] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 1 ms to minimize.
[2024-05-29 02:35:08] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 0 ms to minimize.
[2024-05-29 02:35:08] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2024-05-29 02:35:08] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 1 ms to minimize.
[2024-05-29 02:35:09] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 0 ms to minimize.
[2024-05-29 02:35:09] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 0 ms to minimize.
[2024-05-29 02:35:09] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2024-05-29 02:35:09] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 0 ms to minimize.
[2024-05-29 02:35:09] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2024-05-29 02:35:10] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2024-05-29 02:35:10] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 0 ms to minimize.
[2024-05-29 02:35:10] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 0 ms to minimize.
[2024-05-29 02:35:10] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 0 ms to minimize.
[2024-05-29 02:35:10] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-05-29 02:35:10] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2024-05-29 02:35:10] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3450 ms
[2024-05-29 02:35:18] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 0 ms to minimize.
[2024-05-29 02:35:19] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1041 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 02:35:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:35:19] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 736 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 0 with 695 rules applied. Total rules applied 695 place count 2501 transition count 2401
Applied a total of 695 rules in 151 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 2) 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 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
Interrupted probabilistic random walk after 95007 steps, run timeout after 3002 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95007 steps, saw 92884 distinct states, run finished after 3002 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-29 02:35:24] [INFO ] Computed 901 invariants in 32 ms
[2024-05-29 02:35:24] [INFO ] [Real]Absence check using 898 positive place invariants in 190 ms returned sat
[2024-05-29 02:35:24] [INFO ] [Real]Absence check using 898 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-29 02:35:26] [INFO ] After 2337ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:35:27] [INFO ] [Nat]Absence check using 898 positive place invariants in 191 ms returned sat
[2024-05-29 02:35:27] [INFO ] [Nat]Absence check using 898 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-29 02:35:37] [INFO ] After 10374ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:35:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 02:35:38] [INFO ] After 562ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 02:35:39] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 0 ms to minimize.
[2024-05-29 02:35:39] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2024-05-29 02:35:39] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 0 ms to minimize.
[2024-05-29 02:35:39] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-29 02:35:39] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2024-05-29 02:35:40] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 0 ms to minimize.
[2024-05-29 02:35:40] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-29 02:35:40] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2024-05-29 02:35:40] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 0 ms to minimize.
[2024-05-29 02:35:40] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-29 02:35:40] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2024-05-29 02:35:41] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-29 02:35:41] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-29 02:35:41] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-29 02:35:41] [INFO ] Deduced a trap composed of 6 places in 192 ms of which 1 ms to minimize.
[2024-05-29 02:35:46] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 1 ms to minimize.
[2024-05-29 02:35:47] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 1 ms to minimize.
[2024-05-29 02:35:47] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 1 ms to minimize.
[2024-05-29 02:35:47] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 0 ms to minimize.
[2024-05-29 02:35:48] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 1 ms to minimize.
[2024-05-29 02:35:51] [INFO ] Trap strengthening (SAT) tested/added 20/20 trap constraints in 12513 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 02:35:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:35:51] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 301 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 76 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 70 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2024-05-29 02:35:51] [INFO ] Invariant cache hit.
[2024-05-29 02:35:53] [INFO ] Implicit Places using invariants in 1735 ms returned []
[2024-05-29 02:35:53] [INFO ] Invariant cache hit.
[2024-05-29 02:35:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 02:36:00] [INFO ] Implicit Places using invariants and state equation in 6561 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 8300 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 75 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8446 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 105506 steps, run timeout after 3002 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105506 steps, saw 103222 distinct states, run finished after 3002 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2024-05-29 02:36:03] [INFO ] Computed 900 invariants in 23 ms
[2024-05-29 02:36:04] [INFO ] [Real]Absence check using 897 positive place invariants in 184 ms returned sat
[2024-05-29 02:36:04] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:36:06] [INFO ] After 2168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:36:06] [INFO ] [Nat]Absence check using 897 positive place invariants in 187 ms returned sat
[2024-05-29 02:36:06] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:36:17] [INFO ] After 10292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:36:17] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 0 ms to minimize.
[2024-05-29 02:36:19] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 1 ms to minimize.
[2024-05-29 02:36:19] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 1 ms to minimize.
[2024-05-29 02:36:19] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 0 ms to minimize.
[2024-05-29 02:36:20] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 1 ms to minimize.
[2024-05-29 02:36:20] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 0 ms to minimize.
[2024-05-29 02:36:20] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 1 ms to minimize.
[2024-05-29 02:36:20] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 0 ms to minimize.
[2024-05-29 02:36:21] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 1 ms to minimize.
[2024-05-29 02:36:21] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 0 ms to minimize.
[2024-05-29 02:36:21] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 0 ms to minimize.
[2024-05-29 02:36:21] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 1 ms to minimize.
[2024-05-29 02:36:22] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 0 ms to minimize.
[2024-05-29 02:36:22] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 0 ms to minimize.
[2024-05-29 02:36:22] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 1 ms to minimize.
[2024-05-29 02:36:23] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 0 ms to minimize.
[2024-05-29 02:36:23] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 0 ms to minimize.
[2024-05-29 02:36:23] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 0 ms to minimize.
[2024-05-29 02:36:23] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2024-05-29 02:36:23] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 0 ms to minimize.
[2024-05-29 02:36:24] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2024-05-29 02:36:24] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 0 ms to minimize.
[2024-05-29 02:36:24] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 0 ms to minimize.
[2024-05-29 02:36:24] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2024-05-29 02:36:24] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-29 02:36:24] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 0 ms to minimize.
[2024-05-29 02:36:25] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-29 02:36:25] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-29 02:36:25] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-29 02:36:25] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 8228 ms
[2024-05-29 02:36:25] [INFO ] After 18885ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 118 ms.
[2024-05-29 02:36:25] [INFO ] After 19716ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 141 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 88 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 72 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2024-05-29 02:36:26] [INFO ] Invariant cache hit.
[2024-05-29 02:36:27] [INFO ] Implicit Places using invariants in 1627 ms returned []
[2024-05-29 02:36:27] [INFO ] Invariant cache hit.
[2024-05-29 02:36:29] [INFO ] Implicit Places using invariants and state equation in 1847 ms returned []
Implicit Place search using SMT with State Equation took 3477 ms to find 0 implicit places.
[2024-05-29 02:36:29] [INFO ] Redundant transitions in 76 ms returned []
[2024-05-29 02:36:29] [INFO ] Invariant cache hit.
[2024-05-29 02:36:31] [INFO ] Dead Transitions using invariants and state equation in 1547 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5182 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 73 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-29 02:36:31] [INFO ] Invariant cache hit.
[2024-05-29 02:36:31] [INFO ] [Real]Absence check using 897 positive place invariants in 205 ms returned sat
[2024-05-29 02:36:31] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-29 02:36:33] [INFO ] After 2391ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:36:34] [INFO ] [Nat]Absence check using 897 positive place invariants in 159 ms returned sat
[2024-05-29 02:36:34] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:36:44] [INFO ] After 10298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:36:45] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 0 ms to minimize.
[2024-05-29 02:36:45] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 0 ms to minimize.
[2024-05-29 02:36:45] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 0 ms to minimize.
[2024-05-29 02:36:46] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 0 ms to minimize.
[2024-05-29 02:36:46] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 0 ms to minimize.
[2024-05-29 02:36:46] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 1 ms to minimize.
[2024-05-29 02:36:47] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 0 ms to minimize.
[2024-05-29 02:36:47] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 1 ms to minimize.
[2024-05-29 02:36:48] [INFO ] Deduced a trap composed of 6 places in 238 ms of which 1 ms to minimize.
[2024-05-29 02:36:50] [INFO ] Deduced a trap composed of 5 places in 238 ms of which 1 ms to minimize.
[2024-05-29 02:36:50] [INFO ] Deduced a trap composed of 5 places in 219 ms of which 1 ms to minimize.
[2024-05-29 02:36:51] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 0 ms to minimize.
[2024-05-29 02:36:51] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 1 ms to minimize.
[2024-05-29 02:36:51] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 1 ms to minimize.
[2024-05-29 02:36:51] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 0 ms to minimize.
[2024-05-29 02:36:56] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 1 ms to minimize.
[2024-05-29 02:36:56] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 0 ms to minimize.
[2024-05-29 02:36:56] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 0 ms to minimize.
[2024-05-29 02:36:57] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 0 ms to minimize.
[2024-05-29 02:36:57] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 1 ms to minimize.
[2024-05-29 02:36:57] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 1 ms to minimize.
[2024-05-29 02:36:58] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 1 ms to minimize.
[2024-05-29 02:36:58] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 1 ms to minimize.
[2024-05-29 02:36:58] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 0 ms to minimize.
[2024-05-29 02:36:58] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 1 ms to minimize.
[2024-05-29 02:36:58] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 1 ms to minimize.
[2024-05-29 02:36:59] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 0 ms to minimize.
[2024-05-29 02:36:59] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 1 ms to minimize.
[2024-05-29 02:37:05] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 0 ms to minimize.
[2024-05-29 02:37:06] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 1 ms to minimize.
[2024-05-29 02:37:06] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 0 ms to minimize.
[2024-05-29 02:37:06] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 1 ms to minimize.
[2024-05-29 02:37:06] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 1 ms to minimize.
[2024-05-29 02:37:06] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 1 ms to minimize.
[2024-05-29 02:37:15] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 0 ms to minimize.
[2024-05-29 02:37:16] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 0 ms to minimize.
[2024-05-29 02:37:16] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 0 ms to minimize.
[2024-05-29 02:37:16] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 1 ms to minimize.
[2024-05-29 02:37:16] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 0 ms to minimize.
[2024-05-29 02:37:17] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 1 ms to minimize.
[2024-05-29 02:37:17] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 0 ms to minimize.
[2024-05-29 02:37:17] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 0 ms to minimize.
[2024-05-29 02:37:17] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 0 ms to minimize.
[2024-05-29 02:37:17] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2024-05-29 02:37:18] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 0 ms to minimize.
[2024-05-29 02:37:20] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 0 ms to minimize.
[2024-05-29 02:37:20] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 0 ms to minimize.
[2024-05-29 02:37:20] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 0 ms to minimize.
[2024-05-29 02:37:28] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 0 ms to minimize.
[2024-05-29 02:37:28] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 0 ms to minimize.
[2024-05-29 02:37:28] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 1 ms to minimize.
[2024-05-29 02:37:28] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 1 ms to minimize.
[2024-05-29 02:37:29] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 1 ms to minimize.
[2024-05-29 02:37:29] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 1 ms to minimize.
[2024-05-29 02:37:29] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2024-05-29 02:37:29] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 0 ms to minimize.
[2024-05-29 02:37:30] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 0 ms to minimize.
[2024-05-29 02:37:30] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 0 ms to minimize.
[2024-05-29 02:37:30] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 1 ms to minimize.
[2024-05-29 02:37:31] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 0 ms to minimize.
[2024-05-29 02:37:31] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 0 ms to minimize.
[2024-05-29 02:37:31] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 1 ms to minimize.
[2024-05-29 02:37:32] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 0 ms to minimize.
[2024-05-29 02:37:32] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 1 ms to minimize.
[2024-05-29 02:37:32] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 1 ms to minimize.
[2024-05-29 02:37:32] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 1 ms to minimize.
[2024-05-29 02:37:32] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 0 ms to minimize.
[2024-05-29 02:37:33] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 0 ms to minimize.
[2024-05-29 02:37:33] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2024-05-29 02:37:33] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-29 02:37:33] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-29 02:37:33] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-29 02:37:34] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-29 02:37:34] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 0 ms to minimize.
[2024-05-29 02:37:39] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 1 ms to minimize.
[2024-05-29 02:37:40] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 0 ms to minimize.
[2024-05-29 02:37:41] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 0 ms to minimize.
[2024-05-29 02:37:41] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 0 ms to minimize.
[2024-05-29 02:37:41] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 0 ms to minimize.
[2024-05-29 02:37:45] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 1 ms to minimize.
[2024-05-29 02:37:45] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 0 ms to minimize.
[2024-05-29 02:37:45] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 1 ms to minimize.
[2024-05-29 02:37:45] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2024-05-29 02:37:46] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 1 ms to minimize.
[2024-05-29 02:37:46] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 0 ms to minimize.
[2024-05-29 02:37:46] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2024-05-29 02:37:47] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 1 ms to minimize.
[2024-05-29 02:37:48] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
[2024-05-29 02:37:48] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2024-05-29 02:37:48] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2024-05-29 02:37:48] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2024-05-29 02:37:48] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 0 ms to minimize.
[2024-05-29 02:37:50] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 0 ms to minimize.
[2024-05-29 02:37:54] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 0 ms to minimize.
[2024-05-29 02:37:55] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 0 ms to minimize.
[2024-05-29 02:37:55] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 1 ms to minimize.
[2024-05-29 02:37:55] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 1 ms to minimize.
[2024-05-29 02:37:55] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 1 ms to minimize.
[2024-05-29 02:37:56] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2024-05-29 02:37:56] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 0 ms to minimize.
[2024-05-29 02:37:56] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2024-05-29 02:37:56] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2024-05-29 02:37:57] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 0 ms to minimize.
[2024-05-29 02:37:57] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 1 ms to minimize.
[2024-05-29 02:37:57] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 0 ms to minimize.
[2024-05-29 02:37:57] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2024-05-29 02:37:58] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 0 ms to minimize.
[2024-05-29 02:37:58] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 0 ms to minimize.
[2024-05-29 02:37:58] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
[2024-05-29 02:37:58] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2024-05-29 02:37:58] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2024-05-29 02:37:59] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-05-29 02:37:59] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2024-05-29 02:37:59] [INFO ] Trap strengthening (SAT) tested/added 114/113 trap constraints in 74135 ms
[2024-05-29 02:37:59] [INFO ] After 85092ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6820 ms.
[2024-05-29 02:38:06] [INFO ] After 92634ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0)))]
Knowledge based reduction with 7 factoid took 118 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 121 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 127 ms :[p0, p0, (AND p0 p1)]
Product exploration explored 100000 steps with 33440 reset in 6594 ms.
Product exploration explored 100000 steps with 33198 reset in 6754 ms.
Built C files in :
/tmp/ltsmin1703059921491671581
[2024-05-29 02:38:20] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1703059921491671581
Running compilation step : cd /tmp/ltsmin1703059921491671581;'/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/ltsmin1703059921491671581;'/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/ltsmin1703059921491671581;'/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 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 68 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-29 02:38:23] [INFO ] Computed 901 invariants in 9 ms
[2024-05-29 02:38:24] [INFO ] Implicit Places using invariants in 1537 ms returned []
[2024-05-29 02:38:24] [INFO ] Invariant cache hit.
[2024-05-29 02:38:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 02:38:26] [INFO ] Implicit Places using invariants and state equation in 2052 ms returned []
Implicit Place search using SMT with State Equation took 3606 ms to find 0 implicit places.
[2024-05-29 02:38:26] [INFO ] Invariant cache hit.
[2024-05-29 02:38:28] [INFO ] Dead Transitions using invariants and state equation in 1440 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5115 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Built C files in :
/tmp/ltsmin12319901210354645739
[2024-05-29 02:38:28] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12319901210354645739
Running compilation step : cd /tmp/ltsmin12319901210354645739;'/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/ltsmin12319901210354645739;'/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/ltsmin12319901210354645739;'/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 02:38:31] [INFO ] Flatten gal took : 130 ms
[2024-05-29 02:38:31] [INFO ] Flatten gal took : 128 ms
[2024-05-29 02:38:31] [INFO ] Time to serialize gal into /tmp/LTL4312072996399844529.gal : 12 ms
[2024-05-29 02:38:31] [INFO ] Time to serialize properties into /tmp/LTL18300819246691187155.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/LTL4312072996399844529.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4742653446683587622.hoa' '-atoms' '/tmp/LTL18300819246691187155.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/LTL18300819246691187155.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4742653446683587622.hoa
Detected timeout of ITS tools.
[2024-05-29 02:38:46] [INFO ] Flatten gal took : 147 ms
[2024-05-29 02:38:47] [INFO ] Flatten gal took : 165 ms
[2024-05-29 02:38:47] [INFO ] Time to serialize gal into /tmp/LTL726813332895444884.gal : 11 ms
[2024-05-29 02:38:47] [INFO ] Time to serialize properties into /tmp/LTL16866629870378089988.ltl : 10 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/LTL726813332895444884.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16866629870378089988.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((X((!("((p656==1)&&(p666==1))"))U((!("((p862==1)&&(p895==1))"))||(G(!("((p656==1)&&(p666==1))"))))))&&("((p656==0)||(p666==0))"...160
Formula 0 simplified : FG(!"((p656==0)||(p666==0))" | X("((p656==1)&&(p666==1))" M "((p862==1)&&(p895==1))"))
Detected timeout of ITS tools.
[2024-05-29 02:39:02] [INFO ] Flatten gal took : 126 ms
[2024-05-29 02:39:02] [INFO ] Applying decomposition
[2024-05-29 02:39:02] [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/graph18057696394906019739.txt' '-o' '/tmp/graph18057696394906019739.bin' '-w' '/tmp/graph18057696394906019739.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18057696394906019739.bin' '-l' '-1' '-v' '-w' '/tmp/graph18057696394906019739.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:39:02] [INFO ] Decomposing Gal with order
[2024-05-29 02:39:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:39:02] [INFO ] Removed a total of 1597 redundant transitions.
[2024-05-29 02:39:03] [INFO ] Flatten gal took : 128 ms
[2024-05-29 02:39:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 1540 labels/synchronizations in 173 ms.
[2024-05-29 02:39:03] [INFO ] Time to serialize gal into /tmp/LTL16732968158905080128.gal : 21 ms
[2024-05-29 02:39:03] [INFO ] Time to serialize properties into /tmp/LTL16558585703292251741.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/LTL16732968158905080128.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16558585703292251741.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 : !((G(F((X((!("((i13.i0.i0.u236.p656==1)&&(i13.i0.i0.u240.p666==1))"))U((!("((i16.i1.i2.u311.p862==1)&&(i17.i0.i1.u323.p895==1))"))||(G...280
Formula 0 simplified : FG(!"((i13.i0.i0.u236.p656==0)||(i13.i0.i0.u240.p666==0))" | X("((i13.i0.i0.u236.p656==1)&&(i13.i0.i0.u240.p666==1))" M "((i16.i1.i2...199
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10420354110764001925
[2024-05-29 02:39:18] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10420354110764001925
Running compilation step : cd /tmp/ltsmin10420354110764001925;'/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/ltsmin10420354110764001925;'/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/ltsmin10420354110764001925;'/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 ShieldIIPs-PT-100A-LTLFireability-10 finished in 403100 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' '!(((p0||X(F(p1))) U X(p1)))'
Found a Shortening insensitive property : ShieldIIPs-PT-100A-LTLFireability-11
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 2503 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2502 transition count 2401
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2500 transition count 2401
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 5 place count 2499 transition count 2400
Applied a total of 5 rules in 187 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2024-05-29 02:39:21] [INFO ] Computed 900 invariants in 6 ms
[2024-05-29 02:39:23] [INFO ] Implicit Places using invariants in 1508 ms returned []
[2024-05-29 02:39:23] [INFO ] Invariant cache hit.
[2024-05-29 02:39:25] [INFO ] Implicit Places using invariants and state equation in 1990 ms returned []
Implicit Place search using SMT with State Equation took 3512 ms to find 0 implicit places.
[2024-05-29 02:39:25] [INFO ] Invariant cache hit.
[2024-05-29 02:39:26] [INFO ] Dead Transitions using invariants and state equation in 1582 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2499/2503 places, 2400/2403 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5297 ms. Remains : 2499/2503 places, 2400/2403 transitions.
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s514 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][false, false]]
Product exploration explored 100000 steps with 25 reset in 1722 ms.
Product exploration explored 100000 steps with 25 reset in 2098 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 : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) 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 105163 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105163 steps, saw 98480 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 02:39:34] [INFO ] Invariant cache hit.
[2024-05-29 02:39:34] [INFO ] [Real]Absence check using 900 positive place invariants in 170 ms returned sat
[2024-05-29 02:39:36] [INFO ] After 1927ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:39:36] [INFO ] [Nat]Absence check using 900 positive place invariants in 172 ms returned sat
[2024-05-29 02:39:37] [INFO ] After 1306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:39:38] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 1 ms to minimize.
[2024-05-29 02:39:38] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 0 ms to minimize.
[2024-05-29 02:39:38] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 0 ms to minimize.
[2024-05-29 02:39:38] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-05-29 02:39:38] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 0 ms to minimize.
[2024-05-29 02:39:38] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2024-05-29 02:39:39] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2024-05-29 02:39:39] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1229 ms
[2024-05-29 02:39:39] [INFO ] After 2598ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2024-05-29 02:39:39] [INFO ] After 3315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 126 ms.
Support contains 1 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 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 2499 transition count 2400
Applied a total of 597 rules in 156 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 190 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 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 147448 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 147448 steps, saw 145606 distinct states, run finished after 3002 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2024-05-29 02:39:42] [INFO ] Computed 900 invariants in 13 ms
[2024-05-29 02:39:43] [INFO ] [Real]Absence check using 900 positive place invariants in 175 ms returned sat
[2024-05-29 02:39:44] [INFO ] After 1941ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:39:45] [INFO ] [Nat]Absence check using 900 positive place invariants in 174 ms returned sat
[2024-05-29 02:39:46] [INFO ] After 1261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:39:47] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 1 ms to minimize.
[2024-05-29 02:39:47] [INFO ] Deduced a trap composed of 8 places in 264 ms of which 0 ms to minimize.
[2024-05-29 02:39:47] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 1 ms to minimize.
[2024-05-29 02:39:47] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 1 ms to minimize.
[2024-05-29 02:39:48] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 1 ms to minimize.
[2024-05-29 02:39:48] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 1 ms to minimize.
[2024-05-29 02:39:48] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 1 ms to minimize.
[2024-05-29 02:39:49] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 0 ms to minimize.
[2024-05-29 02:39:49] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 0 ms to minimize.
[2024-05-29 02:39:49] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 0 ms to minimize.
[2024-05-29 02:39:49] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 0 ms to minimize.
[2024-05-29 02:39:49] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 0 ms to minimize.
[2024-05-29 02:39:50] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 1 ms to minimize.
[2024-05-29 02:39:50] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 0 ms to minimize.
[2024-05-29 02:39:50] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 0 ms to minimize.
[2024-05-29 02:39:50] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 1 ms to minimize.
[2024-05-29 02:39:51] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 0 ms to minimize.
[2024-05-29 02:39:51] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 0 ms to minimize.
[2024-05-29 02:39:51] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 1 ms to minimize.
[2024-05-29 02:39:51] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 0 ms to minimize.
[2024-05-29 02:39:51] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-29 02:39:51] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 0 ms to minimize.
[2024-05-29 02:39:52] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 0 ms to minimize.
[2024-05-29 02:39:52] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-05-29 02:39:52] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-05-29 02:39:52] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 0 ms to minimize.
[2024-05-29 02:39:52] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 0 ms to minimize.
[2024-05-29 02:39:52] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 0 ms to minimize.
[2024-05-29 02:39:53] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 0 ms to minimize.
[2024-05-29 02:39:53] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2024-05-29 02:39:53] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2024-05-29 02:39:53] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 0 ms to minimize.
[2024-05-29 02:39:53] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 6819 ms
[2024-05-29 02:39:53] [INFO ] After 8150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2024-05-29 02:39:53] [INFO ] After 8876ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 97 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 94 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-29 02:39:53] [INFO ] Invariant cache hit.
[2024-05-29 02:39:55] [INFO ] Implicit Places using invariants in 1844 ms returned []
[2024-05-29 02:39:55] [INFO ] Invariant cache hit.
[2024-05-29 02:39:58] [INFO ] Implicit Places using invariants and state equation in 2475 ms returned []
Implicit Place search using SMT with State Equation took 4331 ms to find 0 implicit places.
[2024-05-29 02:39:58] [INFO ] Redundant transitions in 73 ms returned []
[2024-05-29 02:39:58] [INFO ] Invariant cache hit.
[2024-05-29 02:39:59] [INFO ] Dead Transitions using invariants and state equation in 1596 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6106 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 71 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 02:40:00] [INFO ] Invariant cache hit.
[2024-05-29 02:40:00] [INFO ] [Real]Absence check using 900 positive place invariants in 179 ms returned sat
[2024-05-29 02:40:01] [INFO ] After 1930ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:40:02] [INFO ] [Nat]Absence check using 900 positive place invariants in 176 ms returned sat
[2024-05-29 02:40:03] [INFO ] After 1155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:40:04] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 0 ms to minimize.
[2024-05-29 02:40:04] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 0 ms to minimize.
[2024-05-29 02:40:04] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 1 ms to minimize.
[2024-05-29 02:40:04] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 0 ms to minimize.
[2024-05-29 02:40:04] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 1 ms to minimize.
[2024-05-29 02:40:05] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 0 ms to minimize.
[2024-05-29 02:40:05] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 0 ms to minimize.
[2024-05-29 02:40:05] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 1 ms to minimize.
[2024-05-29 02:40:05] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 0 ms to minimize.
[2024-05-29 02:40:06] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2024-05-29 02:40:06] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 0 ms to minimize.
[2024-05-29 02:40:06] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2024-05-29 02:40:06] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2024-05-29 02:40:06] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2024-05-29 02:40:07] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 1 ms to minimize.
[2024-05-29 02:40:07] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2024-05-29 02:40:07] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
[2024-05-29 02:40:07] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 0 ms to minimize.
[2024-05-29 02:40:07] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2024-05-29 02:40:07] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-29 02:40:08] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-29 02:40:08] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 4366 ms
[2024-05-29 02:40:08] [INFO ] After 5588ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2024-05-29 02:40:08] [INFO ] After 6311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
// Phase 1: matrix 2400 rows 2499 cols
[2024-05-29 02:40:08] [INFO ] Computed 900 invariants in 6 ms
[2024-05-29 02:40:12] [INFO ] [Real]Absence check using 900 positive place invariants in 1064 ms returned sat
[2024-05-29 02:40:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 02:40:23] [INFO ] [Real]Absence check using state equation in 11231 ms returned unknown
Could not prove EG (NOT p1)
Support contains 1 out of 2499 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 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 84 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-29 02:40:23] [INFO ] Invariant cache hit.
[2024-05-29 02:40:25] [INFO ] Implicit Places using invariants in 1478 ms returned []
[2024-05-29 02:40:25] [INFO ] Invariant cache hit.
[2024-05-29 02:40:27] [INFO ] Implicit Places using invariants and state equation in 1950 ms returned []
Implicit Place search using SMT with State Equation took 3439 ms to find 0 implicit places.
[2024-05-29 02:40:27] [INFO ] Redundant transitions in 318 ms returned [2394]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2399 rows 2499 cols
[2024-05-29 02:40:27] [INFO ] Computed 900 invariants in 4 ms
[2024-05-29 02:40:28] [INFO ] Dead Transitions using invariants and state equation in 1577 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/2499 places, 2399/2400 transitions.
Applied a total of 0 rules in 88 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5547 ms. Remains : 2499/2499 places, 2399/2400 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 : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 112319 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 112319 steps, saw 105217 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 02:40:32] [INFO ] Invariant cache hit.
[2024-05-29 02:40:33] [INFO ] [Real]Absence check using 900 positive place invariants in 167 ms returned sat
[2024-05-29 02:40:34] [INFO ] After 1871ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:40:34] [INFO ] [Nat]Absence check using 900 positive place invariants in 166 ms returned sat
[2024-05-29 02:40:36] [INFO ] After 1295ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:40:36] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 1 ms to minimize.
[2024-05-29 02:40:36] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 0 ms to minimize.
[2024-05-29 02:40:36] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 0 ms to minimize.
[2024-05-29 02:40:37] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2024-05-29 02:40:37] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2024-05-29 02:40:37] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2024-05-29 02:40:37] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-29 02:40:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1187 ms
[2024-05-29 02:40:37] [INFO ] After 2537ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2024-05-29 02:40:37] [INFO ] After 3288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 79 ms.
Support contains 1 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2399/2399 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 2499 transition count 2399
Applied a total of 597 rules in 144 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 2499/2499 places, 2399/2399 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 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 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 158289 steps, run timeout after 3002 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 158289 steps, saw 156354 distinct states, run finished after 3002 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2399 rows 2499 cols
[2024-05-29 02:40:41] [INFO ] Computed 900 invariants in 20 ms
[2024-05-29 02:40:41] [INFO ] [Real]Absence check using 900 positive place invariants in 167 ms returned sat
[2024-05-29 02:40:43] [INFO ] After 1808ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:40:43] [INFO ] [Nat]Absence check using 900 positive place invariants in 168 ms returned sat
[2024-05-29 02:40:44] [INFO ] After 1219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:40:45] [INFO ] Deduced a trap composed of 8 places in 233 ms of which 0 ms to minimize.
[2024-05-29 02:40:45] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 0 ms to minimize.
[2024-05-29 02:40:45] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 0 ms to minimize.
[2024-05-29 02:40:45] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 0 ms to minimize.
[2024-05-29 02:40:45] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 0 ms to minimize.
[2024-05-29 02:40:46] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2024-05-29 02:40:46] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-29 02:40:46] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2024-05-29 02:40:46] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-29 02:40:46] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-29 02:40:46] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2024-05-29 02:40:47] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
[2024-05-29 02:40:47] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-05-29 02:40:47] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 0 ms to minimize.
[2024-05-29 02:40:47] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 0 ms to minimize.
[2024-05-29 02:40:47] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-29 02:40:47] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-29 02:40:47] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-29 02:40:47] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-29 02:40:48] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3213 ms
[2024-05-29 02:40:48] [INFO ] After 4485ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2024-05-29 02:40:48] [INFO ] After 5173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2399/2399 transitions.
Applied a total of 0 rules in 68 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 2499/2499 places, 2399/2399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2399/2399 transitions.
Applied a total of 0 rules in 78 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
[2024-05-29 02:40:48] [INFO ] Invariant cache hit.
[2024-05-29 02:40:50] [INFO ] Implicit Places using invariants in 1771 ms returned []
[2024-05-29 02:40:50] [INFO ] Invariant cache hit.
[2024-05-29 02:40:52] [INFO ] Implicit Places using invariants and state equation in 2476 ms returned []
Implicit Place search using SMT with State Equation took 4276 ms to find 0 implicit places.
[2024-05-29 02:40:52] [INFO ] Redundant transitions in 71 ms returned []
[2024-05-29 02:40:52] [INFO ] Invariant cache hit.
[2024-05-29 02:40:54] [INFO ] Dead Transitions using invariants and state equation in 1549 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5984 ms. Remains : 2499/2499 places, 2399/2399 transitions.
Applied a total of 0 rules in 96 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 02:40:54] [INFO ] Invariant cache hit.
[2024-05-29 02:40:54] [INFO ] [Real]Absence check using 900 positive place invariants in 160 ms returned sat
[2024-05-29 02:40:56] [INFO ] After 1898ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:40:56] [INFO ] [Nat]Absence check using 900 positive place invariants in 167 ms returned sat
[2024-05-29 02:40:58] [INFO ] After 1285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:40:58] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 1 ms to minimize.
[2024-05-29 02:40:58] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 0 ms to minimize.
[2024-05-29 02:40:58] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2024-05-29 02:40:58] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 0 ms to minimize.
[2024-05-29 02:40:59] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-29 02:40:59] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2024-05-29 02:40:59] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 0 ms to minimize.
[2024-05-29 02:40:59] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2024-05-29 02:40:59] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-29 02:40:59] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-29 02:40:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1656 ms
[2024-05-29 02:40:59] [INFO ] After 2997ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2024-05-29 02:41:00] [INFO ] After 3725ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p1)]
// Phase 1: matrix 2399 rows 2499 cols
[2024-05-29 02:41:00] [INFO ] Computed 900 invariants in 5 ms
[2024-05-29 02:41:04] [INFO ] [Real]Absence check using 900 positive place invariants in 1049 ms returned sat
[2024-05-29 02:41:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 02:41:15] [INFO ] [Real]Absence check using state equation in 11253 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Product exploration explored 100000 steps with 25 reset in 1676 ms.
Product exploration explored 100000 steps with 25 reset in 1987 ms.
Built C files in :
/tmp/ltsmin247837771780676036
[2024-05-29 02:41:18] [INFO ] Too many transitions (2399) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:41:19] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin247837771780676036
Running compilation step : cd /tmp/ltsmin247837771780676036;'/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/ltsmin247837771780676036;'/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/ltsmin247837771780676036;'/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 2499 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2499/2499 places, 2399/2399 transitions.
Applied a total of 0 rules in 82 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
[2024-05-29 02:41:22] [INFO ] Invariant cache hit.
[2024-05-29 02:41:23] [INFO ] Implicit Places using invariants in 1586 ms returned []
[2024-05-29 02:41:23] [INFO ] Invariant cache hit.
[2024-05-29 02:41:25] [INFO ] Implicit Places using invariants and state equation in 1937 ms returned []
Implicit Place search using SMT with State Equation took 3549 ms to find 0 implicit places.
[2024-05-29 02:41:25] [INFO ] Redundant transitions in 325 ms returned []
[2024-05-29 02:41:25] [INFO ] Invariant cache hit.
[2024-05-29 02:41:27] [INFO ] Dead Transitions using invariants and state equation in 1573 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5542 ms. Remains : 2499/2499 places, 2399/2399 transitions.
Built C files in :
/tmp/ltsmin6338019879598934343
[2024-05-29 02:41:27] [INFO ] Too many transitions (2399) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:41:27] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6338019879598934343
Running compilation step : cd /tmp/ltsmin6338019879598934343;'/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/ltsmin6338019879598934343;'/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/ltsmin6338019879598934343;'/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 02:41:30] [INFO ] Flatten gal took : 66 ms
[2024-05-29 02:41:30] [INFO ] Flatten gal took : 67 ms
[2024-05-29 02:41:30] [INFO ] Time to serialize gal into /tmp/LTL5317928946259605149.gal : 12 ms
[2024-05-29 02:41:30] [INFO ] Time to serialize properties into /tmp/LTL10063699944770989817.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/LTL5317928946259605149.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7429818458540946785.hoa' '-atoms' '/tmp/LTL10063699944770989817.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/LTL10063699944770989817.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7429818458540946785.hoa
Detected timeout of ITS tools.
[2024-05-29 02:41:45] [INFO ] Flatten gal took : 68 ms
[2024-05-29 02:41:46] [INFO ] Flatten gal took : 87 ms
[2024-05-29 02:41:46] [INFO ] Time to serialize gal into /tmp/LTL10289850467762395230.gal : 10 ms
[2024-05-29 02:41:46] [INFO ] Time to serialize properties into /tmp/LTL5811105779092469714.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/LTL10289850467762395230.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5811105779092469714.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 : !(((("(p666==1)")||(X(F("(p515==1)"))))U(X("(p515==1)"))))
Formula 0 simplified : (!"(p666==1)" & XG!"(p515==1)") R X!"(p515==1)"
Detected timeout of ITS tools.
[2024-05-29 02:42:01] [INFO ] Flatten gal took : 67 ms
[2024-05-29 02:42:01] [INFO ] Applying decomposition
[2024-05-29 02:42:01] [INFO ] Flatten gal took : 67 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/graph4436850468559452646.txt' '-o' '/tmp/graph4436850468559452646.bin' '-w' '/tmp/graph4436850468559452646.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4436850468559452646.bin' '-l' '-1' '-v' '-w' '/tmp/graph4436850468559452646.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:42:01] [INFO ] Decomposing Gal with order
[2024-05-29 02:42:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:42:01] [INFO ] Removed a total of 1595 redundant transitions.
[2024-05-29 02:42:01] [INFO ] Flatten gal took : 96 ms
[2024-05-29 02:42:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 1572 labels/synchronizations in 16 ms.
[2024-05-29 02:42:01] [INFO ] Time to serialize gal into /tmp/LTL3142425568805789613.gal : 16 ms
[2024-05-29 02:42:01] [INFO ] Time to serialize properties into /tmp/LTL16343230762516913602.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/LTL3142425568805789613.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16343230762516913602.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 : !(((("(i12.i0.i2.u240.p666==1)")||(X(F("(i9.i1.i0.u186.p515==1)"))))U(X("(i9.i1.i0.u186.p515==1)"))))
Formula 0 simplified : (!"(i12.i0.i2.u240.p666==1)" & XG!"(i9.i1.i0.u186.p515==1)") R X!"(i9.i1.i0.u186.p515==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3200359675932730692
[2024-05-29 02:42:16] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3200359675932730692
Running compilation step : cd /tmp/ltsmin3200359675932730692;'/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/ltsmin3200359675932730692;'/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/ltsmin3200359675932730692;'/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 ShieldIIPs-PT-100A-LTLFireability-11 finished in 178604 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)))'
[2024-05-29 02:42:20] [INFO ] Flatten gal took : 115 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8453468324851472697
[2024-05-29 02:42:20] [INFO ] Too many transitions (2403) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:42:20] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8453468324851472697
Running compilation step : cd /tmp/ltsmin8453468324851472697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '102' '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 02:42:20] [INFO ] Applying decomposition
[2024-05-29 02:42:20] [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/graph16839573534761405330.txt' '-o' '/tmp/graph16839573534761405330.bin' '-w' '/tmp/graph16839573534761405330.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16839573534761405330.bin' '-l' '-1' '-v' '-w' '/tmp/graph16839573534761405330.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:42:20] [INFO ] Decomposing Gal with order
[2024-05-29 02:42:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:42:21] [INFO ] Removed a total of 1600 redundant transitions.
[2024-05-29 02:42:21] [INFO ] Flatten gal took : 115 ms
[2024-05-29 02:42:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 1548 labels/synchronizations in 249 ms.
[2024-05-29 02:42:21] [INFO ] Time to serialize gal into /tmp/LTLFireability1908965558007086504.gal : 181 ms
[2024-05-29 02:42:21] [INFO ] Time to serialize properties into /tmp/LTLFireability11329153420942961989.ltl : 20 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/LTLFireability1908965558007086504.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11329153420942961989.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...277
Read 7 LTL properties
Checking formula 0 : !((G(F(("(i38.i2.i2.u774.p2150==0)")&&(X("(((i16.i1.i2.u337.p936==0)||(i16.i1.i2.u339.p940==0))||(i16.i1.i1.u342.p951==0))"))))))
Formula 0 simplified : FG(!"(i38.i2.i2.u774.p2150==0)" | X!"(((i16.i1.i2.u337.p936==0)||(i16.i1.i2.u339.p940==0))||(i16.i1.i1.u342.p951==0))")
Compilation finished in 6555 ms.
Running link step : cd /tmp/ltsmin8453468324851472697;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 144 ms.
Running LTSmin : cd /tmp/ltsmin8453468324851472697;'/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)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin8453468324851472697;'/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)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8453468324851472697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp2==true))&&<>([]((LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin8453468324851472697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp2==true))&&<>([]((LTLAPp3==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8453468324851472697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([](!(LTLAPp4==true))||(!(LTLAPp4==true)&&[](<>((!(LTLAPp5==true) U ([](!(LTLAPp5==true))||(!(LTLAPp5==true)&&[](!(LTLAPp4==true))))))))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7466312 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16030436 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="ShieldIIPs-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 ShieldIIPs-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-171683788500103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-100A.tgz
mv ShieldIIPs-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 ;