About the Execution of LTSMin+red for SafeBus-PT-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16206.191 | 1456104.00 | 3302432.00 | 3056.10 | ?TFFTTFFFFFFFTFT | 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.r524-tall-171679080300420.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 ltsminxred
Input is SafeBus-PT-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679080300420
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 18K Apr 12 14:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 12 14:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 12 14:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 140K Apr 12 14:37 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 6.3K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 94K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 14:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 12 14:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 173K Apr 12 14:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 840K Apr 12 14:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 303K 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 SafeBus-PT-06-LTLFireability-00
FORMULA_NAME SafeBus-PT-06-LTLFireability-01
FORMULA_NAME SafeBus-PT-06-LTLFireability-02
FORMULA_NAME SafeBus-PT-06-LTLFireability-03
FORMULA_NAME SafeBus-PT-06-LTLFireability-04
FORMULA_NAME SafeBus-PT-06-LTLFireability-05
FORMULA_NAME SafeBus-PT-06-LTLFireability-06
FORMULA_NAME SafeBus-PT-06-LTLFireability-07
FORMULA_NAME SafeBus-PT-06-LTLFireability-08
FORMULA_NAME SafeBus-PT-06-LTLFireability-09
FORMULA_NAME SafeBus-PT-06-LTLFireability-10
FORMULA_NAME SafeBus-PT-06-LTLFireability-11
FORMULA_NAME SafeBus-PT-06-LTLFireability-12
FORMULA_NAME SafeBus-PT-06-LTLFireability-13
FORMULA_NAME SafeBus-PT-06-LTLFireability-14
FORMULA_NAME SafeBus-PT-06-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717226805250
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:26:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:26:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:26:46] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2024-06-01 07:26:46] [INFO ] Transformed 144 places.
[2024-06-01 07:26:46] [INFO ] Transformed 451 transitions.
[2024-06-01 07:26:46] [INFO ] Found NUPN structural information;
[2024-06-01 07:26:46] [INFO ] Parsed PT model containing 144 places and 451 transitions and 2968 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 6 places and 0 transitions.
FORMULA SafeBus-PT-06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-06-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-06-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 126 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 14 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2024-06-01 07:26:46] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-06-01 07:26:46] [INFO ] Computed 29 invariants in 22 ms
[2024-06-01 07:26:47] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-06-01 07:26:47] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-06-01 07:26:47] [INFO ] Invariant cache hit.
[2024-06-01 07:26:47] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:26:47] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2024-06-01 07:26:47] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-06-01 07:26:47] [INFO ] Invariant cache hit.
[2024-06-01 07:26:47] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Problem TDEAD31 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD246 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-06-01 07:26:49] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 29 ms to minimize.
[2024-06-01 07:26:49] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 1 ms to minimize.
[2024-06-01 07:26:49] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:26:50] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:26:50] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:26:50] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:26:51] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:26:51] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:26:51] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:26:51] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:26:51] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:26:51] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:26:52] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:26:52] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:26:52] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:26:52] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:26:52] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:26:52] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:26:52] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:26:52] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 20/187 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-06-01 07:26:54] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:26:54] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 5 ms to minimize.
[2024-06-01 07:26:55] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:26:55] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:26:55] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:26:55] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 0 ms to minimize.
[2024-06-01 07:26:55] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 0 ms to minimize.
[2024-06-01 07:26:55] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 0 ms to minimize.
[2024-06-01 07:26:55] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 1 ms to minimize.
[2024-06-01 07:26:55] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 1 ms to minimize.
[2024-06-01 07:26:55] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 11/198 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-06-01 07:26:57] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:26:57] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:26:57] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:26:57] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:26:57] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 5/203 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-06-01 07:26:59] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:26:59] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:26:59] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:26:59] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 4/207 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/207 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 8 (OVERLAPS) 242/380 variables, 138/345 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 43/388 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/388 constraints. Problems are: Problem set: 36 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 388 constraints, problems are : Problem set: 36 solved, 409 unsolved in 30029 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 36 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 40/207 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-06-01 07:27:20] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:27:20] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:27:20] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:27:21] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:27:21] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:27:21] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:27:21] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:27:21] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 8/215 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-06-01 07:27:27] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:27:27] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:27:27] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 3/218 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/218 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 7 (OVERLAPS) 242/380 variables, 138/356 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 43/399 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 409/808 constraints. Problems are: Problem set: 36 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 808 constraints, problems are : Problem set: 36 solved, 409 unsolved in 30013 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/445 constraints, Known Traps: 51/51 constraints]
After SMT, in 60688ms problems are : Problem set: 36 solved, 409 unsolved
Search for dead transitions found 36 dead transitions in 60706ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 138/138 places, 415/451 transitions.
Applied a total of 0 rules in 4 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61173 ms. Remains : 138/138 places, 415/451 transitions.
Support contains 126 out of 138 places after structural reductions.
[2024-06-01 07:27:48] [INFO ] Flatten gal took : 82 ms
[2024-06-01 07:27:48] [INFO ] Flatten gal took : 59 ms
[2024-06-01 07:27:48] [INFO ] Input system was already deterministic with 415 transitions.
Reduction of identical properties reduced properties to check from 25 to 21
RANDOM walk for 13390 steps (3 resets) in 775 ms. (17 steps per ms) remains 0/21 properties
FORMULA SafeBus-PT-06-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&(X(G(!p1))||(X(!p1)&&F((G(F(!p2))||(F(!p2)&&G(!p1))))))))))'
Support contains 61 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 6 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:27:49] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-06-01 07:27:49] [INFO ] Computed 29 invariants in 6 ms
[2024-06-01 07:27:49] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-06-01 07:27:49] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:27:49] [INFO ] Invariant cache hit.
[2024-06-01 07:27:49] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:27:50] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2024-06-01 07:27:50] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:27:50] [INFO ] Invariant cache hit.
[2024-06-01 07:27:50] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:27:51] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:27:51] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:27:51] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:27:52] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:27:52] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:27:52] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 8 ms to minimize.
[2024-06-01 07:27:52] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:27:52] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:27:53] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:27:53] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:27:53] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:27:53] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 0 ms to minimize.
[2024-06-01 07:27:53] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:27:53] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:27:54] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:27:54] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:27:54] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:27:54] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:27:54] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:27:54] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 9/197 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:28:03] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:28:03] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:28:05] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 11 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 383 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30014 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 35/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 409/792 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:28:36] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:28:36] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:28:36] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:28:36] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 4/796 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 797 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30020 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 40/40 constraints]
After SMT, in 60413ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60423ms
Finished structural reductions in LTL mode , in 1 iterations and 60894 ms. Remains : 138/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 423 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2), (AND p1 p2), (AND p2 (NOT p1) (NOT p0))]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-00
Product exploration explored 100000 steps with 18838 reset in 1207 ms.
Product exploration explored 100000 steps with 18738 reset in 1104 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT (OR p1 (NOT p0))))), (X (X p0)), (X (X (NOT (OR (AND p2 p1) (AND p2 (NOT p0)))))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 237 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND p1 p2), (AND p1 p2), (AND p2 (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (8 resets) in 487 ms. (81 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2302 ms. (17 steps per ms) remains 1/1 properties
[2024-06-01 07:28:54] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:28:54] [INFO ] Invariant cache hit.
[2024-06-01 07:28:54] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 60/121 variables, 12/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 60/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 6/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/135 variables, 9/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 14/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/136 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/136 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 241/377 variables, 136/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/377 variables, 42/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/377 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/380 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/380 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/380 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/380 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/380 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/380 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 348 constraints, problems are : Problem set: 0 solved, 1 unsolved in 437 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 61/380 variables, and 61 constraints, problems are : Problem set: 1 solved, 0 unsolved in 55 ms.
Refiners :[Domain max(s): 61/138 constraints, Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 0/15 constraints, State Equation: 0/138 constraints, ReadFeed: 0/43 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 817ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT (OR p1 (NOT p0))))), (X (X p0)), (X (X (NOT (OR (AND p2 p1) (AND p2 (NOT p0)))))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1)))), (G (OR (NOT p2) p0 p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT p0)), (F p1), (F p2), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 8 factoid took 544 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND p2 p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 79 ms :[(AND p2 p1), (AND p2 p1)]
Support contains 61 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 54 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:28:56] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:28:56] [INFO ] Invariant cache hit.
[2024-06-01 07:28:56] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-01 07:28:56] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:28:56] [INFO ] Invariant cache hit.
[2024-06-01 07:28:56] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:28:56] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2024-06-01 07:28:56] [INFO ] Redundant transitions in 30 ms returned []
Running 409 sub problems to find dead transitions.
[2024-06-01 07:28:56] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:28:56] [INFO ] Invariant cache hit.
[2024-06-01 07:28:56] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:28:58] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 1 ms to minimize.
[2024-06-01 07:28:58] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:28:58] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:28:58] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:29:01] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:29:01] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 9/197 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:29:14] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 11 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 383 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30025 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 35/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 409/792 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:29:43] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:29:43] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 0 ms to minimize.
[2024-06-01 07:29:43] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:29:43] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 4/796 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:29:54] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 797 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30016 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 40/40 constraints]
After SMT, in 60487ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60492ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60997 ms. Remains : 138/138 places, 415/415 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), (X (NOT (AND p2 p1))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 7 factoid took 187 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 81 ms :[(AND p2 p1), (AND p2 p1)]
RANDOM walk for 152 steps (0 resets) in 8 ms. (16 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), (X (NOT (AND p2 p1))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F p1), (F p2), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 7 factoid took 280 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 p2 p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 68 ms :[(AND p2 p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 81 ms :[(AND p2 p1), (AND p2 p1)]
Product exploration explored 100000 steps with 3928 reset in 408 ms.
Product exploration explored 100000 steps with 3939 reset in 522 ms.
Support contains 61 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 26 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:29:58] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:29:58] [INFO ] Invariant cache hit.
[2024-06-01 07:29:58] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-01 07:29:58] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:29:58] [INFO ] Invariant cache hit.
[2024-06-01 07:29:59] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:29:59] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2024-06-01 07:29:59] [INFO ] Redundant transitions in 5 ms returned []
Running 409 sub problems to find dead transitions.
[2024-06-01 07:29:59] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:29:59] [INFO ] Invariant cache hit.
[2024-06-01 07:29:59] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:30:00] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:30:01] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:30:01] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:30:01] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:30:01] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:30:01] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:30:03] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:30:03] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:30:03] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:30:03] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:30:03] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:30:03] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:30:05] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:30:07] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:30:07] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:30:07] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:30:07] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:30:08] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 1 ms to minimize.
[2024-06-01 07:30:08] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:30:08] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:30:08] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:30:08] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 9/197 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:30:09] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:30:12] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:30:12] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:30:14] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:30:16] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 11 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 383 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30023 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 35/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 409/792 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:30:45] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:30:45] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:30:45] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:30:45] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 4/796 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:30:56] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 797 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30016 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 40/40 constraints]
After SMT, in 60374ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60380ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60848 ms. Remains : 138/138 places, 415/415 transitions.
Treatment of property SafeBus-PT-06-LTLFireability-00 finished in 190267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(X(p0))))))'
Support contains 12 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 4 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:30:59] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:30:59] [INFO ] Invariant cache hit.
[2024-06-01 07:31:00] [INFO ] Implicit Places using invariants in 365 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 368 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 378 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 194 ms.
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-PT-06-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-PT-06-LTLFireability-01 finished in 844 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((F(p0)||(X(p1)&&p2)))) U p3))'
Support contains 89 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 3 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:31:00] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:31:00] [INFO ] Invariant cache hit.
[2024-06-01 07:31:00] [INFO ] Implicit Places using invariants in 143 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 144 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 149 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p3), (OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-02
Product exploration explored 100000 steps with 8596 reset in 290 ms.
Stack based approach found an accepted trace after 45295 steps with 3962 reset with depth 59 and stack size 59 in 135 ms.
FORMULA SafeBus-PT-06-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-06-LTLFireability-02 finished in 826 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 17 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:31:01] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:31:01] [INFO ] Invariant cache hit.
[2024-06-01 07:31:01] [INFO ] Implicit Places using invariants in 269 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 270 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 120 transition count 523
Applied a total of 24 rules in 38 ms. Remains 120 /132 variables (removed 12) and now considering 523/415 (removed -108) transitions.
[2024-06-01 07:31:01] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2024-06-01 07:31:01] [INFO ] Computed 23 invariants in 6 ms
[2024-06-01 07:31:01] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-06-01 07:31:01] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-06-01 07:31:02] [INFO ] Invariant cache hit.
[2024-06-01 07:31:02] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:31:02] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 120/138 places, 523/415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1062 ms. Remains : 120/138 places, 523/415 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 309 ms.
Stack based approach found an accepted trace after 185 steps with 0 reset with depth 186 and stack size 186 in 1 ms.
FORMULA SafeBus-PT-06-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-06-LTLFireability-03 finished in 1430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 12 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 15 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:31:02] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-06-01 07:31:02] [INFO ] Computed 29 invariants in 7 ms
[2024-06-01 07:31:03] [INFO ] Implicit Places using invariants in 247 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 248 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 26 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 289 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-04
Product exploration explored 100000 steps with 3906 reset in 212 ms.
Product exploration explored 100000 steps with 3990 reset in 216 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 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 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 68 steps (0 resets) in 6 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 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 81 ms :[(NOT p0), (NOT p0)]
Support contains 12 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 415/415 transitions.
Applied a total of 0 rules in 19 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:31:04] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 132 cols
[2024-06-01 07:31:04] [INFO ] Computed 23 invariants in 3 ms
[2024-06-01 07:31:04] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-06-01 07:31:04] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:31:04] [INFO ] Invariant cache hit.
[2024-06-01 07:31:04] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:31:04] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
[2024-06-01 07:31:04] [INFO ] Redundant transitions in 2 ms returned []
Running 409 sub problems to find dead transitions.
[2024-06-01 07:31:04] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:31:04] [INFO ] Invariant cache hit.
[2024-06-01 07:31:04] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 10/142 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 13/155 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:31:06] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:31:07] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:31:07] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:31:07] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:31:07] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 0 ms to minimize.
[2024-06-01 07:31:07] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:31:07] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:31:07] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:31:08] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:31:08] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:31:08] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:31:08] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:31:08] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:31:08] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 0 ms to minimize.
[2024-06-01 07:31:08] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:31:08] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 16/171 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:31:10] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:31:10] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:31:11] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:31:11] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 0 ms to minimize.
[2024-06-01 07:31:11] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 5/176 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:31:12] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:31:12] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:31:12] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:31:12] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:31:12] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:31:13] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 6/182 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:31:14] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (OVERLAPS) 242/374 variables, 132/319 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 43/362 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 374/374 variables, and 362 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30022 ms.
Refiners :[Domain max(s): 132/132 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 132/132 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 10/142 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 13/155 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 32/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:31:39] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:31:39] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 242/374 variables, 132/321 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 43/364 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 409/773 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 773 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30011 ms.
Refiners :[Domain max(s): 132/132 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 132/132 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 34/34 constraints]
After SMT, in 60375ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60380ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60986 ms. Remains : 132/132 places, 415/415 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 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 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 62 steps (0 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 89 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 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3932 reset in 210 ms.
Product exploration explored 100000 steps with 3887 reset in 219 ms.
Support contains 12 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 415/415 transitions.
Applied a total of 0 rules in 10 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:32:06] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:32:06] [INFO ] Invariant cache hit.
[2024-06-01 07:32:06] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-06-01 07:32:06] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:32:06] [INFO ] Invariant cache hit.
[2024-06-01 07:32:06] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:32:06] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
[2024-06-01 07:32:06] [INFO ] Redundant transitions in 2 ms returned []
Running 409 sub problems to find dead transitions.
[2024-06-01 07:32:06] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:32:06] [INFO ] Invariant cache hit.
[2024-06-01 07:32:06] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 10/142 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 13/155 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:32:08] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:32:08] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2024-06-01 07:32:08] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:32:09] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:32:09] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:32:09] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:32:09] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:32:09] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:32:09] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:32:09] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:32:09] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:32:10] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:32:10] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:32:10] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:32:10] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:32:10] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 16/171 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:32:12] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:32:12] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:32:12] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:32:12] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:32:12] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 5/176 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:32:14] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:32:14] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:32:14] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:32:14] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:32:14] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:32:14] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 6/182 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:32:16] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:32:18] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:32:19] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:32:19] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:32:19] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (OVERLAPS) 242/374 variables, 132/319 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 43/362 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 374/374 variables, and 362 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30019 ms.
Refiners :[Domain max(s): 132/132 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 132/132 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 10/142 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 13/155 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 32/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:32:40] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:32:41] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 242/374 variables, 132/321 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 43/364 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 409/773 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 773 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30021 ms.
Refiners :[Domain max(s): 132/132 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 132/132 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 34/34 constraints]
After SMT, in 60362ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60366ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60950 ms. Remains : 132/132 places, 415/415 transitions.
Treatment of property SafeBus-PT-06-LTLFireability-04 finished in 124181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 7 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 3 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:33:07] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-06-01 07:33:07] [INFO ] Computed 29 invariants in 2 ms
[2024-06-01 07:33:07] [INFO ] Implicit Places using invariants in 277 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 278 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 282 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-05
Product exploration explored 100000 steps with 14032 reset in 188 ms.
Product exploration explored 100000 steps with 14030 reset in 200 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 p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 28 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 101 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
[2024-06-01 07:33:08] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 132 cols
[2024-06-01 07:33:08] [INFO ] Computed 23 invariants in 2 ms
[2024-06-01 07:33:08] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-06-01 07:33:08] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 35 ms returned sat
[2024-06-01 07:33:08] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2024-06-01 07:33:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:33:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 07:33:08] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 12 ms returned sat
[2024-06-01 07:33:08] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2024-06-01 07:33:08] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:33:08] [INFO ] [Nat]Added 43 Read/Feed constraints in 28 ms returned sat
[2024-06-01 07:33:09] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2024-06-01 07:33:09] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:33:09] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:33:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 213 ms
[2024-06-01 07:33:09] [INFO ] Computed and/alt/rep : 66/348/66 causal constraints (skipped 170 transitions) in 21 ms.
[2024-06-01 07:33:09] [INFO ] Added : 40 causal constraints over 8 iterations in 255 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Applied a total of 12 rules in 16 ms. Remains 126 /132 variables (removed 6) and now considering 409/415 (removed 6) transitions.
[2024-06-01 07:33:09] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
// Phase 1: matrix 236 rows 126 cols
[2024-06-01 07:33:09] [INFO ] Computed 23 invariants in 2 ms
[2024-06-01 07:33:09] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-06-01 07:33:09] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 07:33:09] [INFO ] Invariant cache hit.
[2024-06-01 07:33:09] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:33:10] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
[2024-06-01 07:33:10] [INFO ] Redundant transitions in 3 ms returned []
Running 403 sub problems to find dead transitions.
[2024-06-01 07:33:10] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 07:33:10] [INFO ] Invariant cache hit.
[2024-06-01 07:33:10] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 10/136 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 07:33:11] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:33:11] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:33:11] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:33:12] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:33:12] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:33:12] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:33:12] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:33:12] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:33:12] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:33:12] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:33:13] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:33:13] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:33:13] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:33:13] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 3 ms to minimize.
[2024-06-01 07:33:13] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2024-06-01 07:33:13] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:33:14] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:33:14] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:33:14] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:33:14] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 07:33:16] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:33:16] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:33:16] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:33:16] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:33:16] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:33:16] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 6/175 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 07:33:17] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:33:17] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:33:18] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:33:18] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 07:33:19] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (OVERLAPS) 236/362 variables, 126/306 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 43/349 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 11 (OVERLAPS) 0/362 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 349 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30013 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 10/136 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 31/180 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 07:33:42] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:33:43] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:33:43] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:33:44] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:33:45] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 5/185 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (OVERLAPS) 236/362 variables, 126/311 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 43/354 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 403/757 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/362 variables, and 757 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30016 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 36/36 constraints]
After SMT, in 60353ms problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 60360ms
Starting structural reductions in SI_LTL mode, iteration 1 : 126/132 places, 409/415 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61032 ms. Remains : 126/132 places, 409/415 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 p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 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 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 82 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 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-06-01 07:34:10] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 07:34:10] [INFO ] Invariant cache hit.
[2024-06-01 07:34:11] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-06-01 07:34:11] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 19 ms returned sat
[2024-06-01 07:34:11] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-06-01 07:34:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:34:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 07:34:11] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 13 ms returned sat
[2024-06-01 07:34:11] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-06-01 07:34:11] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:34:11] [INFO ] [Nat]Added 43 Read/Feed constraints in 16 ms returned sat
[2024-06-01 07:34:11] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:34:11] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:34:11] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:34:11] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:34:11] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:34:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 291 ms
[2024-06-01 07:34:11] [INFO ] Computed and/alt/rep : 54/270/54 causal constraints (skipped 176 transitions) in 21 ms.
[2024-06-01 07:34:11] [INFO ] Added : 9 causal constraints over 3 iterations in 101 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14072 reset in 202 ms.
Product exploration explored 100000 steps with 14125 reset in 206 ms.
Support contains 7 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 409/409 transitions.
Applied a total of 0 rules in 19 ms. Remains 126 /126 variables (removed 0) and now considering 409/409 (removed 0) transitions.
[2024-06-01 07:34:12] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 07:34:12] [INFO ] Invariant cache hit.
[2024-06-01 07:34:12] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-06-01 07:34:12] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 07:34:12] [INFO ] Invariant cache hit.
[2024-06-01 07:34:12] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:34:12] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
[2024-06-01 07:34:12] [INFO ] Redundant transitions in 1 ms returned []
Running 403 sub problems to find dead transitions.
[2024-06-01 07:34:12] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 07:34:12] [INFO ] Invariant cache hit.
[2024-06-01 07:34:12] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 10/136 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 07:34:14] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:34:14] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:34:14] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:34:15] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:34:15] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:34:15] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:34:15] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:34:15] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 0 ms to minimize.
[2024-06-01 07:34:15] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:34:15] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:34:16] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:34:16] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:34:16] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2024-06-01 07:34:16] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:34:16] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:34:16] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2024-06-01 07:34:16] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:34:16] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:34:16] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:34:16] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 07:34:18] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 0 ms to minimize.
[2024-06-01 07:34:19] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:34:19] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-06-01 07:34:19] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:34:19] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:34:19] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 6/175 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 07:34:22] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (OVERLAPS) 236/362 variables, 126/306 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 43/349 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 11 (OVERLAPS) 0/362 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 349 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30015 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 10/136 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 31/180 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 07:34:45] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:34:46] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:34:46] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:34:47] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:34:47] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 5/185 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (OVERLAPS) 236/362 variables, 126/311 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 43/354 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 403/757 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/362 variables, and 757 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30023 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 36/36 constraints]
After SMT, in 60372ms problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 60376ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60951 ms. Remains : 126/126 places, 409/409 transitions.
Treatment of property SafeBus-PT-06-LTLFireability-05 finished in 126341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(G((F(p2)&&p1))))&&p0)))'
Support contains 19 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 1 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:35:13] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-06-01 07:35:13] [INFO ] Computed 29 invariants in 2 ms
[2024-06-01 07:35:13] [INFO ] Implicit Places using invariants in 253 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 254 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 258 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-07
Product exploration explored 100000 steps with 3932 reset in 412 ms.
Stack based approach found an accepted trace after 5757 steps with 225 reset with depth 59 and stack size 59 in 25 ms.
FORMULA SafeBus-PT-06-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-06-LTLFireability-07 finished in 910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((X(p0)||(G(p1)&&X(p2))))||X(p3))))'
Support contains 8 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:35:14] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:35:14] [INFO ] Invariant cache hit.
[2024-06-01 07:35:14] [INFO ] Implicit Places using invariants in 217 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 218 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 222 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 234 ms :[true, (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2193 steps with 0 reset in 5 ms.
FORMULA SafeBus-PT-06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-06-LTLFireability-10 finished in 487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(((G(p0) U p1)&&X(X(!p2)))) U p1)))'
Support contains 6 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 1 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:35:14] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:35:14] [INFO ] Invariant cache hit.
[2024-06-01 07:35:15] [INFO ] Implicit Places using invariants in 262 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 263 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 266 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 519 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p1) p2), p2, (AND (NOT p0) p2)]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-11
Product exploration explored 100000 steps with 354 reset in 243 ms.
Stack based approach found an accepted trace after 49 steps with 0 reset with depth 50 and stack size 50 in 0 ms.
FORMULA SafeBus-PT-06-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-06-LTLFireability-11 finished in 1058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 6 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 16 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:35:15] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:35:15] [INFO ] Invariant cache hit.
[2024-06-01 07:35:16] [INFO ] Implicit Places using invariants in 227 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 228 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 125 transition count 428
Applied a total of 14 rules in 39 ms. Remains 125 /132 variables (removed 7) and now considering 428/415 (removed -13) transitions.
[2024-06-01 07:35:16] [INFO ] Flow matrix only has 255 transitions (discarded 173 similar events)
// Phase 1: matrix 255 rows 125 cols
[2024-06-01 07:35:16] [INFO ] Computed 23 invariants in 2 ms
[2024-06-01 07:35:16] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-06-01 07:35:16] [INFO ] Flow matrix only has 255 transitions (discarded 173 similar events)
[2024-06-01 07:35:16] [INFO ] Invariant cache hit.
[2024-06-01 07:35:16] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:35:16] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 125/138 places, 428/415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 870 ms. Remains : 125/138 places, 428/415 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-12
Product exploration explored 100000 steps with 1074 reset in 269 ms.
Stack based approach found an accepted trace after 297 steps with 3 reset with depth 66 and stack size 66 in 1 ms.
FORMULA SafeBus-PT-06-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-06-LTLFireability-12 finished in 1209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0&&X(G(p1))) U X(X(p0))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 3 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:35:17] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-06-01 07:35:17] [INFO ] Computed 29 invariants in 1 ms
[2024-06-01 07:35:17] [INFO ] Implicit Places using invariants in 262 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 266 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 272 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 329 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SafeBus-PT-06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-06-LTLFireability-14 finished in 623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&(X(X(G(p2)))||p1))))'
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 1 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:35:17] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:35:17] [INFO ] Invariant cache hit.
[2024-06-01 07:35:17] [INFO ] Implicit Places using invariants in 253 ms returned [115, 116, 117, 118, 119]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 254 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/138 places, 415/415 transitions.
Applied a total of 0 rules in 1 ms. Remains 133 /133 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 257 ms. Remains : 133/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 156 ms.
Product exploration explored 100000 steps with 33333 reset in 156 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 p2), (X p1), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-PT-06-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-PT-06-LTLFireability-15 finished in 792 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&(X(G(!p1))||(X(!p1)&&F((G(F(!p2))||(F(!p2)&&G(!p1))))))))))'
Found a Shortening insensitive property : SafeBus-PT-06-LTLFireability-00
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2), (AND p1 p2), (AND p2 (NOT p1) (NOT p0))]
Support contains 61 out of 138 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 9 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:35:18] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:35:18] [INFO ] Invariant cache hit.
[2024-06-01 07:35:19] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-01 07:35:19] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:35:19] [INFO ] Invariant cache hit.
[2024-06-01 07:35:19] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:35:19] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2024-06-01 07:35:19] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:35:19] [INFO ] Invariant cache hit.
[2024-06-01 07:35:19] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:35:21] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 1 ms to minimize.
[2024-06-01 07:35:21] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:35:21] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:35:21] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 3 ms to minimize.
[2024-06-01 07:35:21] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 0 ms to minimize.
[2024-06-01 07:35:21] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:35:21] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:35:22] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:35:22] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:35:22] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:35:22] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:35:22] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:35:22] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:35:22] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:35:23] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:35:23] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:35:23] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:35:23] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:35:23] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:35:23] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:35:25] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:35:27] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:35:27] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:35:27] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:35:27] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:35:28] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:35:28] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:35:28] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:35:28] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:35:28] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 9/197 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:35:29] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:35:32] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:35:32] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:35:34] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:35:36] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 11 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 383 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30013 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 35/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 409/792 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:36:05] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:36:05] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2024-06-01 07:36:05] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:36:06] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 4/796 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:36:17] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 797 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30022 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 40/40 constraints]
After SMT, in 60350ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60356ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 60756 ms. Remains : 138/138 places, 415/415 transitions.
Running random walk in product with property : SafeBus-PT-06-LTLFireability-00
Product exploration explored 100000 steps with 18894 reset in 1083 ms.
Product exploration explored 100000 steps with 18763 reset in 1102 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT (OR p1 (NOT p0))))), (X (X p0)), (X (X (NOT (OR (AND p2 p1) (AND p2 (NOT p0)))))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 227 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND p1 p2), (AND p1 p2), (AND p2 (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (8 resets) in 413 ms. (96 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2223 ms. (17 steps per ms) remains 1/1 properties
[2024-06-01 07:36:23] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:36:23] [INFO ] Invariant cache hit.
[2024-06-01 07:36:23] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 60/121 variables, 12/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 60/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 6/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/135 variables, 9/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 14/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/136 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/136 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 241/377 variables, 136/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/377 variables, 42/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/377 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/380 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/380 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/380 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/380 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/380 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/380 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 348 constraints, problems are : Problem set: 0 solved, 1 unsolved in 387 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 61/380 variables, and 61 constraints, problems are : Problem set: 1 solved, 0 unsolved in 54 ms.
Refiners :[Domain max(s): 61/138 constraints, Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 0/15 constraints, State Equation: 0/138 constraints, ReadFeed: 0/43 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 620ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT (OR p1 (NOT p0))))), (X (X p0)), (X (X (NOT (OR (AND p2 p1) (AND p2 (NOT p0)))))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1)))), (G (OR (NOT p2) p0 p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT p0)), (F p1), (F p2), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 8 factoid took 383 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND p2 p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 72 ms :[(AND p2 p1), (AND p2 p1)]
Support contains 61 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 19 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:36:24] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:36:24] [INFO ] Invariant cache hit.
[2024-06-01 07:36:24] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-01 07:36:24] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:36:24] [INFO ] Invariant cache hit.
[2024-06-01 07:36:24] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:36:24] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2024-06-01 07:36:24] [INFO ] Redundant transitions in 3 ms returned []
Running 409 sub problems to find dead transitions.
[2024-06-01 07:36:24] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:36:24] [INFO ] Invariant cache hit.
[2024-06-01 07:36:24] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:36:26] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:36:26] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:36:26] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:36:26] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 0 ms to minimize.
[2024-06-01 07:36:27] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:36:27] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:36:27] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:36:27] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:36:27] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:36:27] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:36:27] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:36:27] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:36:28] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:36:28] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:36:28] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:36:28] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:36:28] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:36:28] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 3 ms to minimize.
[2024-06-01 07:36:28] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:36:29] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:36:31] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:36:32] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:36:33] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:36:33] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:36:33] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:36:33] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:36:33] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2024-06-01 07:36:33] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:36:33] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:36:34] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 9/197 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:36:35] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:36:38] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:36:38] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:36:40] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:36:42] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 11 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 383 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30014 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 35/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 409/792 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:37:11] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:37:11] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:37:11] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:37:11] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 4/796 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:37:22] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 797 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30022 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 40/40 constraints]
After SMT, in 60347ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60353ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60764 ms. Remains : 138/138 places, 415/415 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), (X (NOT (AND p2 p1))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 7 factoid took 222 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 68 ms :[(AND p2 p1), (AND p2 p1)]
RANDOM walk for 134 steps (0 resets) in 7 ms. (16 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), (X (NOT (AND p2 p1))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F p1), (F p2), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 7 factoid took 282 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 p2 p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 69 ms :[(AND p2 p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 68 ms :[(AND p2 p1), (AND p2 p1)]
Product exploration explored 100000 steps with 3947 reset in 397 ms.
Product exploration explored 100000 steps with 3954 reset in 392 ms.
Support contains 61 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 8 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:37:26] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:37:26] [INFO ] Invariant cache hit.
[2024-06-01 07:37:26] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-01 07:37:26] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:37:26] [INFO ] Invariant cache hit.
[2024-06-01 07:37:26] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:37:27] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2024-06-01 07:37:27] [INFO ] Redundant transitions in 3 ms returned []
Running 409 sub problems to find dead transitions.
[2024-06-01 07:37:27] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:37:27] [INFO ] Invariant cache hit.
[2024-06-01 07:37:27] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:37:28] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:37:28] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:37:28] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:37:29] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:37:29] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:37:29] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:37:29] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:37:29] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:37:30] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:37:30] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:37:30] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:37:30] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:37:30] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:37:30] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:37:31] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:37:31] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:37:31] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2024-06-01 07:37:31] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:37:31] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:37:31] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:37:33] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:37:35] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:37:35] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:37:35] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:37:35] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:37:35] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:37:35] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:37:36] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:37:36] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:37:36] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 9/197 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:37:37] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:37:40] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:37:40] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:37:42] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:37:44] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 11 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 383 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30020 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 35/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 409/792 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:38:14] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:38:14] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:38:14] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:38:14] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 4/796 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:38:25] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 797 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30021 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 40/40 constraints]
After SMT, in 60395ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60400ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60816 ms. Remains : 138/138 places, 415/415 transitions.
Treatment of property SafeBus-PT-06-LTLFireability-00 finished in 189102 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : SafeBus-PT-06-LTLFireability-05
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 7 out of 138 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 9 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:38:27] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:38:27] [INFO ] Invariant cache hit.
[2024-06-01 07:38:28] [INFO ] Implicit Places using invariants in 253 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 256 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Applied a total of 12 rules in 6 ms. Remains 126 /132 variables (removed 6) and now considering 409/415 (removed 6) transitions.
[2024-06-01 07:38:28] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
// Phase 1: matrix 236 rows 126 cols
[2024-06-01 07:38:28] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 07:38:28] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-01 07:38:28] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 07:38:28] [INFO ] Invariant cache hit.
[2024-06-01 07:38:28] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:38:28] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 126/138 places, 409/415 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 812 ms. Remains : 126/138 places, 409/415 transitions.
Running random walk in product with property : SafeBus-PT-06-LTLFireability-05
Product exploration explored 100000 steps with 14103 reset in 191 ms.
Product exploration explored 100000 steps with 14070 reset in 222 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 p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 28 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 196 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
[2024-06-01 07:38:29] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 07:38:29] [INFO ] Invariant cache hit.
[2024-06-01 07:38:29] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-06-01 07:38:29] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 20 ms returned sat
[2024-06-01 07:38:29] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-06-01 07:38:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:38:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 07:38:30] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 13 ms returned sat
[2024-06-01 07:38:30] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-06-01 07:38:30] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:38:30] [INFO ] [Nat]Added 43 Read/Feed constraints in 22 ms returned sat
[2024-06-01 07:38:30] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:38:30] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:38:30] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:38:30] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2024-06-01 07:38:30] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:38:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 304 ms
[2024-06-01 07:38:30] [INFO ] Computed and/alt/rep : 54/270/54 causal constraints (skipped 176 transitions) in 22 ms.
[2024-06-01 07:38:30] [INFO ] Added : 9 causal constraints over 3 iterations in 110 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 409/409 transitions.
Applied a total of 0 rules in 9 ms. Remains 126 /126 variables (removed 0) and now considering 409/409 (removed 0) transitions.
[2024-06-01 07:38:30] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 07:38:30] [INFO ] Invariant cache hit.
[2024-06-01 07:38:30] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-06-01 07:38:30] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 07:38:30] [INFO ] Invariant cache hit.
[2024-06-01 07:38:30] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:38:31] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
[2024-06-01 07:38:31] [INFO ] Redundant transitions in 3 ms returned []
Running 403 sub problems to find dead transitions.
[2024-06-01 07:38:31] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 07:38:31] [INFO ] Invariant cache hit.
[2024-06-01 07:38:31] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 10/136 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 07:38:32] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:38:32] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:38:32] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:38:33] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:38:33] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:38:33] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:38:33] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:38:33] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:38:34] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:38:34] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:38:34] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:38:34] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:38:34] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:38:34] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:38:34] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:38:34] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 1 ms to minimize.
[2024-06-01 07:38:35] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:38:35] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:38:35] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:38:35] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 07:38:37] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:38:37] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:38:37] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:38:37] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:38:37] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:38:37] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 6/175 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 07:38:38] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:38:38] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:38:39] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:38:39] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 07:38:41] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (OVERLAPS) 236/362 variables, 126/306 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 43/349 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 11 (OVERLAPS) 0/362 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 349 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30009 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 10/136 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 31/180 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 07:39:03] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:39:04] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:39:05] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 0 ms to minimize.
[2024-06-01 07:39:05] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:39:06] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 5/185 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (OVERLAPS) 236/362 variables, 126/311 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 43/354 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 403/757 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/362 variables, and 757 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30021 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 36/36 constraints]
After SMT, in 60395ms problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 60400ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60944 ms. Remains : 126/126 places, 409/409 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 p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 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)]
RANDOM walk for 23 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
[2024-06-01 07:39:32] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 07:39:32] [INFO ] Invariant cache hit.
[2024-06-01 07:39:32] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-06-01 07:39:32] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 21 ms returned sat
[2024-06-01 07:39:32] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-06-01 07:39:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:39:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 07:39:32] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 13 ms returned sat
[2024-06-01 07:39:32] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-06-01 07:39:32] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:39:32] [INFO ] [Nat]Added 43 Read/Feed constraints in 17 ms returned sat
[2024-06-01 07:39:32] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:39:32] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:39:32] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:39:32] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:39:32] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:39:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 280 ms
[2024-06-01 07:39:32] [INFO ] Computed and/alt/rep : 54/270/54 causal constraints (skipped 176 transitions) in 23 ms.
[2024-06-01 07:39:33] [INFO ] Added : 9 causal constraints over 3 iterations in 102 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14125 reset in 204 ms.
Product exploration explored 100000 steps with 14062 reset in 211 ms.
Support contains 7 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 409/409 transitions.
Applied a total of 0 rules in 8 ms. Remains 126 /126 variables (removed 0) and now considering 409/409 (removed 0) transitions.
[2024-06-01 07:39:33] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 07:39:33] [INFO ] Invariant cache hit.
[2024-06-01 07:39:33] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-06-01 07:39:33] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 07:39:33] [INFO ] Invariant cache hit.
[2024-06-01 07:39:33] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:39:34] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2024-06-01 07:39:34] [INFO ] Redundant transitions in 3 ms returned []
Running 403 sub problems to find dead transitions.
[2024-06-01 07:39:34] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-06-01 07:39:34] [INFO ] Invariant cache hit.
[2024-06-01 07:39:34] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 10/136 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 07:39:35] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:39:35] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:39:35] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:39:36] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:39:36] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 0 ms to minimize.
[2024-06-01 07:39:36] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:39:36] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:39:36] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:39:36] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:39:36] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:39:37] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:39:37] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:39:37] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:39:37] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:39:37] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:39:37] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:39:37] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:39:37] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:39:38] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:39:38] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 07:39:40] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:39:40] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:39:40] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:39:40] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:39:40] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:39:40] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 6/175 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 07:39:41] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 4 ms to minimize.
[2024-06-01 07:39:41] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:39:42] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:39:42] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 07:39:44] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (OVERLAPS) 236/362 variables, 126/306 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 43/349 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 11 (OVERLAPS) 0/362 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 349 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30012 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 10/136 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 31/180 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 07:40:06] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:40:07] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:40:07] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:40:08] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:40:09] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 5/185 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (OVERLAPS) 236/362 variables, 126/311 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 43/354 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 403/757 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/362 variables, and 757 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30015 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 36/36 constraints]
After SMT, in 60363ms problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 60367ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60921 ms. Remains : 126/126 places, 409/409 transitions.
Treatment of property SafeBus-PT-06-LTLFireability-05 finished in 126845 ms.
[2024-06-01 07:40:34] [INFO ] Flatten gal took : 49 ms
[2024-06-01 07:40:34] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 42 ms.
[2024-06-01 07:40:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 138 places, 415 transitions and 2620 arcs took 6 ms.
Total runtime 828247 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : SafeBus-PT-06-LTLFireability-00
FORMULA SafeBus-PT-06-LTLFireability-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA SafeBus-PT-06-LTLFireability-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717228261354
--------------------
content from stderr:
+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name SafeBus-PT-06-LTLFireability-00
ltl formula formula --ltl=/tmp/3281/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 138 places, 415 transitions and 2620 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3281/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3281/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3281/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.030 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3281/ltl_0_
ltl formula name SafeBus-PT-06-LTLFireability-04
ltl formula formula --ltl=/tmp/3281/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 138 places, 415 transitions and 2620 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.000 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3281/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3281/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3281/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3281/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 140 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 139, there are 464 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~1772 levels ~10000 states ~26892 transitions
pnml2lts-mc( 2/ 4): ~3596 levels ~20000 states ~57348 transitions
pnml2lts-mc( 2/ 4): ~6958 levels ~40000 states ~121532 transitions
pnml2lts-mc( 2/ 4): ~13149 levels ~80000 states ~256656 transitions
pnml2lts-mc( 2/ 4): ~24731 levels ~160000 states ~533608 transitions
pnml2lts-mc( 2/ 4): ~47120 levels ~320000 states ~1111132 transitions
pnml2lts-mc( 2/ 4): ~87712 levels ~640000 states ~2301212 transitions
pnml2lts-mc( 2/ 4): ~159127 levels ~1280000 states ~4754200 transitions
pnml2lts-mc( 2/ 4): ~278874 levels ~2560000 states ~9875200 transitions
pnml2lts-mc( 2/ 4): ~433838 levels ~5120000 states ~20780572 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 735841
pnml2lts-mc( 0/ 4): unique states count: 7552596
pnml2lts-mc( 0/ 4): unique transitions count: 32398992
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1759754
pnml2lts-mc( 0/ 4): - claim found count: 23109784
pnml2lts-mc( 0/ 4): - claim success count: 7557033
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1920857
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7575387 states 32519069 transitions, fanout: 4.293
pnml2lts-mc( 0/ 4): Total exploration time 45.420 sec (45.420 sec minimum, 45.420 sec on average)
pnml2lts-mc( 0/ 4): States per second: 166785, Transitions per second: 715964
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 81.9MB, 11.4 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 22.0%/37.0%
pnml2lts-mc( 0/ 4): Stored 418 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 81.9MB (~256.0MB paged-in)
ltl formula name SafeBus-PT-06-LTLFireability-05
ltl formula formula --ltl=/tmp/3281/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 138 places, 415 transitions and 2620 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3281/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3281/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3281/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3281/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 140 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 139, there are 482 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~19 levels ~10000 states ~13328 transitions
pnml2lts-mc( 1/ 4): ~19 levels ~20000 states ~26292 transitions
pnml2lts-mc( 1/ 4): ~19 levels ~40000 states ~51920 transitions
pnml2lts-mc( 0/ 4): ~19 levels ~80000 states ~103772 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 81445
pnml2lts-mc( 0/ 4): unique states count: 81445
pnml2lts-mc( 0/ 4): unique transitions count: 105522
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 24530
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 81709
pnml2lts-mc( 0/ 4): - cum. max stack depth: 76
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 81709 states 106770 transitions, fanout: 1.307
pnml2lts-mc( 0/ 4): Total exploration time 0.580 sec (0.580 sec minimum, 0.580 sec on average)
pnml2lts-mc( 0/ 4): States per second: 140878, Transitions per second: 184086
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.1MB, 14.2 B/state, compr.: 2.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 418 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.1MB (~256.0MB paged-in)
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="SafeBus-PT-06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is SafeBus-PT-06, 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 r524-tall-171679080300420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-06.tgz
mv SafeBus-PT-06 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 ;