About the Execution of GreatSPN+red for CANInsertWithFailure-PT-040
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11127.363 | 3600000.00 | 4051759.00 | 7762.90 | FFF?FTF??F?FFFF? | 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.r069-tall-171620503800123.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 greatspnxred
Input is CANInsertWithFailure-PT-040, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503800123
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.8M May 18 16:42 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 CANInsertWithFailure-PT-040-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716395521216
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-040
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 16:32:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 16:32:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 16:32:02] [INFO ] Load time of PNML (sax parser for PT used): 358 ms
[2024-05-22 16:32:02] [INFO ] Transformed 3684 places.
[2024-05-22 16:32:02] [INFO ] Transformed 9840 transitions.
[2024-05-22 16:32:02] [INFO ] Parsed PT model containing 3684 places and 9840 transitions and 26400 arcs in 491 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 3684 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3684/3684 places, 9840/9840 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3683 transition count 9840
Applied a total of 1 rules in 554 ms. Remains 3683 /3684 variables (removed 1) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-22 16:32:04] [INFO ] Computed 42 invariants in 482 ms
[2024-05-22 16:32:06] [INFO ] Implicit Places using invariants in 2661 ms returned []
[2024-05-22 16:32:06] [INFO ] Invariant cache hit.
[2024-05-22 16:32:09] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-22 16:32:39] [INFO ] Performed 385/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 16:32:48] [INFO ] Implicit Places using invariants and state equation in 42229 ms returned []
Implicit Place search using SMT with State Equation took 44919 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-22 16:32:48] [INFO ] Invariant cache hit.
[2024-05-22 16:32:48] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 39697ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39809ms
Starting structural reductions in LTL mode, iteration 1 : 3683/3684 places, 9840/9840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85359 ms. Remains : 3683/3684 places, 9840/9840 transitions.
Support contains 48 out of 3683 places after structural reductions.
[2024-05-22 16:33:29] [INFO ] Flatten gal took : 382 ms
[2024-05-22 16:33:29] [INFO ] Flatten gal took : 248 ms
[2024-05-22 16:33:29] [INFO ] Input system was already deterministic with 9840 transitions.
Support contains 47 out of 3683 places (down from 48) after GAL structural reductions.
RANDOM walk for 40000 steps (40 resets) in 1914 ms. (20 steps per ms) remains 11/29 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 113 ms. (350 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 96 ms. (412 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 67 ms. (588 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 11/11 properties
[2024-05-22 16:33:30] [INFO ] Invariant cache hit.
[2024-05-22 16:33:31] [INFO ] State equation strengthened by 3160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp15 is UNSAT
At refinement iteration 1 (OVERLAPS) 3588/3605 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3605 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 74/3679 variables, 37/40 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3679 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/3681 variables, 2/42 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3681 variables, 0/42 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 9840/13521 variables, 3681/3723 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/13521 variables, 3160/6883 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13521/13523 variables, and 6883 constraints, problems are : Problem set: 2 solved, 9 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 3681/3683 constraints, ReadFeed: 3160/3160 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 3586/3601 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-22 16:33:36] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 20 ms to minimize.
[2024-05-22 16:33:36] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 2 ms to minimize.
[2024-05-22 16:33:37] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 2 ms to minimize.
[2024-05-22 16:33:37] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 2 ms to minimize.
[2024-05-22 16:33:37] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2024-05-22 16:33:37] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 1 ms to minimize.
[2024-05-22 16:33:37] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2024-05-22 16:33:37] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 2 ms to minimize.
[2024-05-22 16:33:37] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 2 ms to minimize.
[2024-05-22 16:33:38] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 1 ms to minimize.
[2024-05-22 16:33:38] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2024-05-22 16:33:38] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2024-05-22 16:33:38] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 2 ms to minimize.
[2024-05-22 16:33:38] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 1 ms to minimize.
[2024-05-22 16:33:38] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-22 16:33:39] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2024-05-22 16:33:39] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2024-05-22 16:33:39] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2024-05-22 16:33:39] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2024-05-22 16:33:39] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3601 variables, 20/21 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-22 16:33:39] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2024-05-22 16:33:39] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-05-22 16:33:40] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
[2024-05-22 16:33:40] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2024-05-22 16:33:40] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2024-05-22 16:33:40] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-22 16:33:40] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-22 16:33:40] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 2 ms to minimize.
[2024-05-22 16:33:40] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-22 16:33:41] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-05-22 16:33:41] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
SMT process timed out in 10171ms, After SMT, problems are : Problem set: 2 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 15 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 280 rules applied. Total rules applied 559 place count 3404 transition count 9560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1477 Post agglomeration using F-continuation condition.Transition count delta: 1477
Deduced a syphon composed of 1477 places in 4 ms
Reduce places removed 1477 places and 0 transitions.
Iterating global reduction 3 with 2954 rules applied. Total rules applied 3514 place count 1926 transition count 8083
Drop transitions (Redundant composition of simpler transitions.) removed 1401 transitions
Redundant transition composition rules discarded 1401 transitions
Iterating global reduction 3 with 1401 rules applied. Total rules applied 4915 place count 1926 transition count 6682
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4917 place count 1926 transition count 6680
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4919 place count 1924 transition count 6680
Partial Free-agglomeration rule applied 1708 times.
Drop transitions (Partial Free agglomeration) removed 1708 transitions
Iterating global reduction 4 with 1708 rules applied. Total rules applied 6627 place count 1924 transition count 6680
Applied a total of 6627 rules in 1626 ms. Remains 1924 /3683 variables (removed 1759) and now considering 6680/9840 (removed 3160) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1628 ms. Remains : 1924/3683 places, 6680/9840 transitions.
RANDOM walk for 40000 steps (201 resets) in 943 ms. (42 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 7/7 properties
// Phase 1: matrix 6680 rows 1924 cols
[2024-05-22 16:33:43] [INFO ] Computed 42 invariants in 263 ms
[2024-05-22 16:33:43] [INFO ] State equation strengthened by 6342 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1830/1842 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1842 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 78/1920 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1920 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/1922 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1922 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 6680/8602 variables, 1922/1964 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8602 variables, 6342/8306 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8602 variables, 0/8306 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/8604 variables, 2/8308 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8604 variables, 0/8308 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/8604 variables, 0/8308 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8604/8604 variables, and 8308 constraints, problems are : Problem set: 0 solved, 7 unsolved in 6629 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1924/1924 constraints, ReadFeed: 6342/6342 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1830/1842 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 16:33:50] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-22 16:33:50] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1842 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1842 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 78/1920 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1920 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/1922 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 16:33:53] [INFO ] Deduced a trap composed of 50 places in 1567 ms of which 15 ms to minimize.
[2024-05-22 16:33:54] [INFO ] Deduced a trap composed of 50 places in 1461 ms of which 11 ms to minimize.
[2024-05-22 16:33:54] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 1 ms to minimize.
[2024-05-22 16:33:54] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 2 ms to minimize.
[2024-05-22 16:33:54] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1922 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1922 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 6680/8602 variables, 1922/1971 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8602 variables, 6342/8313 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8602 variables, 7/8320 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8602/8604 variables, and 8320 constraints, problems are : Problem set: 0 solved, 7 unsolved in 45050 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1922/1924 constraints, ReadFeed: 6342/6342 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 7/7 constraints]
After SMT, in 52052ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 1924 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1924/1924 places, 6680/6680 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1922 transition count 6678
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 1922 transition count 6678
Applied a total of 5 rules in 471 ms. Remains 1922 /1924 variables (removed 2) and now considering 6678/6680 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 471 ms. Remains : 1922/1924 places, 6678/6680 transitions.
RANDOM walk for 40000 steps (202 resets) in 614 ms. (65 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 97176 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 7
Probabilistic random walk after 97176 steps, saw 30970 distinct states, run finished after 3004 ms. (steps per millisecond=32 ) properties seen :0
// Phase 1: matrix 6678 rows 1922 cols
[2024-05-22 16:34:39] [INFO ] Computed 42 invariants in 187 ms
[2024-05-22 16:34:39] [INFO ] State equation strengthened by 6347 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1828/1840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1840 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 78/1918 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1918 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/1920 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1920 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 6678/8598 variables, 1920/1962 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8598 variables, 6347/8309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8598 variables, 0/8309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/8600 variables, 2/8311 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8600 variables, 0/8311 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/8600 variables, 0/8311 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8600/8600 variables, and 8311 constraints, problems are : Problem set: 0 solved, 7 unsolved in 7276 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1922/1922 constraints, ReadFeed: 6347/6347 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1828/1840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 16:34:47] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1840 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1840 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 78/1918 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1918 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/1920 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 16:34:49] [INFO ] Deduced a trap composed of 56 places in 1587 ms of which 11 ms to minimize.
[2024-05-22 16:34:50] [INFO ] Deduced a trap composed of 52 places in 1525 ms of which 12 ms to minimize.
[2024-05-22 16:34:51] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 2 ms to minimize.
[2024-05-22 16:34:51] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 1 ms to minimize.
[2024-05-22 16:34:51] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1920 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1920 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 6678/8598 variables, 1920/1968 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8598 variables, 6347/8315 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8598 variables, 7/8322 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8598 variables, 0/8322 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 2/8600 variables, 2/8324 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/8600 variables, 0/8324 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8600/8600 variables, and 8324 constraints, problems are : Problem set: 0 solved, 7 unsolved in 75047 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1922/1922 constraints, ReadFeed: 6347/6347 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 6/6 constraints]
After SMT, in 82600ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 1922 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1922/1922 places, 6678/6678 transitions.
Applied a total of 0 rules in 183 ms. Remains 1922 /1922 variables (removed 0) and now considering 6678/6678 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 1922/1922 places, 6678/6678 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1922/1922 places, 6678/6678 transitions.
Applied a total of 0 rules in 279 ms. Remains 1922 /1922 variables (removed 0) and now considering 6678/6678 (removed 0) transitions.
[2024-05-22 16:36:02] [INFO ] Invariant cache hit.
[2024-05-22 16:36:04] [INFO ] Implicit Places using invariants in 1920 ms returned []
[2024-05-22 16:36:04] [INFO ] Invariant cache hit.
[2024-05-22 16:36:05] [INFO ] State equation strengthened by 6347 read => feed constraints.
[2024-05-22 16:36:36] [INFO ] Performed 986/1922 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 16:36:55] [INFO ] Implicit Places using invariants and state equation in 51032 ms returned []
Implicit Place search using SMT with State Equation took 52953 ms to find 0 implicit places.
[2024-05-22 16:36:55] [INFO ] Redundant transitions in 626 ms returned []
Running 6638 sub problems to find dead transitions.
[2024-05-22 16:36:55] [INFO ] Invariant cache hit.
[2024-05-22 16:36:56] [INFO ] State equation strengthened by 6347 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1921 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6638 unsolved
SMT process timed out in 36807ms, After SMT, problems are : Problem set: 0 solved, 6638 unsolved
Search for dead transitions found 0 dead transitions in 36867ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90754 ms. Remains : 1922/1922 places, 6678/6678 transitions.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 162 stabilizing places and 280 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' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 984 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2024-05-22 16:37:34] [INFO ] Computed 42 invariants in 137 ms
[2024-05-22 16:37:35] [INFO ] Implicit Places using invariants in 1318 ms returned []
[2024-05-22 16:37:35] [INFO ] Invariant cache hit.
[2024-05-22 16:37:36] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-22 16:37:52] [INFO ] Implicit Places using invariants and state equation in 17335 ms returned []
Implicit Place search using SMT with State Equation took 18654 ms to find 0 implicit places.
[2024-05-22 16:37:53] [INFO ] Redundant transitions in 647 ms returned []
Running 6480 sub problems to find dead transitions.
[2024-05-22 16:37:53] [INFO ] Invariant cache hit.
[2024-05-22 16:37:53] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1843 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6480 unsolved
SMT process timed out in 34979ms, After SMT, problems are : Problem set: 0 solved, 6480 unsolved
Search for dead transitions found 0 dead transitions in 35034ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55346 ms. Remains : 1844/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-00
Stuttering criterion allowed to conclude after 206 steps with 0 reset in 8 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-00 finished in 55691 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((X(p0)&&(p1||(p2&&X(X(p3)))))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 260 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-22 16:38:29] [INFO ] Computed 42 invariants in 460 ms
[2024-05-22 16:38:31] [INFO ] Implicit Places using invariants in 2589 ms returned []
[2024-05-22 16:38:31] [INFO ] Invariant cache hit.
[2024-05-22 16:38:34] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-22 16:39:05] [INFO ] Performed 357/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 16:39:17] [INFO ] Implicit Places using invariants and state equation in 45602 ms returned []
Implicit Place search using SMT with State Equation took 48192 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-22 16:39:17] [INFO ] Invariant cache hit.
[2024-05-22 16:39:17] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 39094ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39171ms
Finished structural reductions in LTL mode , in 1 iterations and 87652 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p3), (NOT p3)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-01
Product exploration explored 100000 steps with 33415 reset in 1223 ms.
Product exploration explored 100000 steps with 33571 reset in 1133 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p1 p2 p0 p3), (X p2), (X (NOT (AND (NOT p1) p2))), (X (OR p1 p2)), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR p1 p2))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 107 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p3), (NOT p3)]
Reduction of identical properties reduced properties to check from 8 to 6
RANDOM walk for 40000 steps (40 resets) in 664 ms. (60 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
[2024-05-22 16:39:59] [INFO ] Invariant cache hit.
[2024-05-22 16:39:59] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3600/3601 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:40:00] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 2 ms to minimize.
[2024-05-22 16:40:00] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2024-05-22 16:40:00] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2024-05-22 16:40:00] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-22 16:40:00] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-05-22 16:40:01] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 2 ms to minimize.
[2024-05-22 16:40:01] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2024-05-22 16:40:01] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
[2024-05-22 16:40:01] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2024-05-22 16:40:01] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-05-22 16:40:01] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2024-05-22 16:40:01] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-22 16:40:01] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 4 ms to minimize.
[2024-05-22 16:40:02] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-05-22 16:40:02] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-22 16:40:02] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
[2024-05-22 16:40:02] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-22 16:40:02] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 2 ms to minimize.
[2024-05-22 16:40:02] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-22 16:40:02] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3601 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:40:03] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2024-05-22 16:40:03] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-05-22 16:40:03] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2024-05-22 16:40:03] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-22 16:40:03] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-22 16:40:03] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2024-05-22 16:40:03] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-22 16:40:03] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2024-05-22 16:40:04] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2024-05-22 16:40:04] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-05-22 16:40:04] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 0 ms to minimize.
[2024-05-22 16:40:04] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-05-22 16:40:04] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-22 16:40:04] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-22 16:40:04] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
SMT process timed out in 5142ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1560 Post agglomeration using F-continuation condition.Transition count delta: 1560
Deduced a syphon composed of 1560 places in 3 ms
Reduce places removed 1560 places and 0 transitions.
Iterating global reduction 2 with 3120 rules applied. Total rules applied 3680 place count 1843 transition count 8000
Drop transitions (Redundant composition of simpler transitions.) removed 1482 transitions
Redundant transition composition rules discarded 1482 transitions
Iterating global reduction 2 with 1482 rules applied. Total rules applied 5162 place count 1843 transition count 6518
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5163 place count 1843 transition count 6517
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5164 place count 1842 transition count 6517
Partial Free-agglomeration rule applied 1640 times.
Drop transitions (Partial Free agglomeration) removed 1640 transitions
Iterating global reduction 3 with 1640 rules applied. Total rules applied 6804 place count 1842 transition count 6517
Applied a total of 6804 rules in 1269 ms. Remains 1842 /3683 variables (removed 1841) and now considering 6517/9840 (removed 3323) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1269 ms. Remains : 1842/3683 places, 6517/9840 transitions.
RANDOM walk for 40000 steps (213 resets) in 527 ms. (75 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 106819 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 1
Probabilistic random walk after 106819 steps, saw 28346 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
// Phase 1: matrix 6517 rows 1842 cols
[2024-05-22 16:40:09] [INFO ] Computed 42 invariants in 177 ms
[2024-05-22 16:40:09] [INFO ] State equation strengthened by 6397 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1759/1760 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:40:09] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1760 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1760 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1838 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1838 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1840 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:40:11] [INFO ] Deduced a trap composed of 53 places in 1398 ms of which 12 ms to minimize.
[2024-05-22 16:40:12] [INFO ] Deduced a trap composed of 49 places in 1399 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1840 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1840 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6517/8357 variables, 1840/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8357 variables, 6397/8282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8357 variables, 0/8282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/8359 variables, 2/8284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8359 variables, 0/8284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/8359 variables, 0/8284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8359/8359 variables, and 8284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5594 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1842/1842 constraints, ReadFeed: 6397/6397 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1759/1760 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1760 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:40:15] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-22 16:40:15] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-22 16:40:15] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-22 16:40:15] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-22 16:40:15] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-22 16:40:15] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-22 16:40:15] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-22 16:40:15] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-22 16:40:15] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-22 16:40:16] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-22 16:40:16] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-22 16:40:16] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-22 16:40:16] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-22 16:40:16] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-22 16:40:16] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-22 16:40:16] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-22 16:40:16] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-22 16:40:16] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 0 ms to minimize.
[2024-05-22 16:40:16] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-22 16:40:16] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1760 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:40:16] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-22 16:40:16] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-22 16:40:16] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-22 16:40:16] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-22 16:40:17] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-22 16:40:17] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-22 16:40:17] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-22 16:40:17] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-22 16:40:17] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-22 16:40:17] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-22 16:40:17] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-22 16:40:17] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-22 16:40:17] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-22 16:40:17] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-22 16:40:17] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-22 16:40:17] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-22 16:40:17] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1760 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1760 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 78/1838 variables, 39/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1838 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/1840 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1840 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:40:19] [INFO ] Deduced a trap composed of 67 places in 1530 ms of which 11 ms to minimize.
[2024-05-22 16:40:21] [INFO ] Deduced a trap composed of 51 places in 1431 ms of which 12 ms to minimize.
[2024-05-22 16:40:22] [INFO ] Deduced a trap composed of 46 places in 1402 ms of which 10 ms to minimize.
[2024-05-22 16:40:24] [INFO ] Deduced a trap composed of 61 places in 1504 ms of which 12 ms to minimize.
[2024-05-22 16:40:25] [INFO ] Deduced a trap composed of 73 places in 1527 ms of which 11 ms to minimize.
[2024-05-22 16:40:27] [INFO ] Deduced a trap composed of 76 places in 1522 ms of which 11 ms to minimize.
[2024-05-22 16:40:28] [INFO ] Deduced a trap composed of 45 places in 1459 ms of which 11 ms to minimize.
[2024-05-22 16:40:30] [INFO ] Deduced a trap composed of 49 places in 1370 ms of which 11 ms to minimize.
[2024-05-22 16:40:31] [INFO ] Deduced a trap composed of 79 places in 1495 ms of which 12 ms to minimize.
[2024-05-22 16:40:33] [INFO ] Deduced a trap composed of 51 places in 1513 ms of which 12 ms to minimize.
[2024-05-22 16:40:34] [INFO ] Deduced a trap composed of 48 places in 1444 ms of which 12 ms to minimize.
[2024-05-22 16:40:36] [INFO ] Deduced a trap composed of 55 places in 1410 ms of which 11 ms to minimize.
[2024-05-22 16:40:37] [INFO ] Deduced a trap composed of 47 places in 1406 ms of which 11 ms to minimize.
[2024-05-22 16:40:38] [INFO ] Deduced a trap composed of 55 places in 1438 ms of which 11 ms to minimize.
[2024-05-22 16:40:40] [INFO ] Deduced a trap composed of 50 places in 1348 ms of which 10 ms to minimize.
[2024-05-22 16:40:41] [INFO ] Deduced a trap composed of 47 places in 1442 ms of which 12 ms to minimize.
[2024-05-22 16:40:43] [INFO ] Deduced a trap composed of 55 places in 1471 ms of which 11 ms to minimize.
[2024-05-22 16:40:44] [INFO ] Deduced a trap composed of 57 places in 1493 ms of which 11 ms to minimize.
[2024-05-22 16:40:46] [INFO ] Deduced a trap composed of 81 places in 1411 ms of which 11 ms to minimize.
[2024-05-22 16:40:47] [INFO ] Deduced a trap composed of 51 places in 1451 ms of which 12 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1840 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:40:49] [INFO ] Deduced a trap composed of 130 places in 1491 ms of which 11 ms to minimize.
[2024-05-22 16:40:50] [INFO ] Deduced a trap composed of 56 places in 1451 ms of which 12 ms to minimize.
[2024-05-22 16:40:52] [INFO ] Deduced a trap composed of 52 places in 1417 ms of which 11 ms to minimize.
[2024-05-22 16:40:53] [INFO ] Deduced a trap composed of 50 places in 1482 ms of which 12 ms to minimize.
[2024-05-22 16:40:55] [INFO ] Deduced a trap composed of 45 places in 1435 ms of which 11 ms to minimize.
[2024-05-22 16:40:56] [INFO ] Deduced a trap composed of 47 places in 1432 ms of which 11 ms to minimize.
[2024-05-22 16:40:58] [INFO ] Deduced a trap composed of 57 places in 1470 ms of which 11 ms to minimize.
[2024-05-22 16:40:59] [INFO ] Deduced a trap composed of 49 places in 1423 ms of which 11 ms to minimize.
[2024-05-22 16:41:01] [INFO ] Deduced a trap composed of 47 places in 1428 ms of which 12 ms to minimize.
SMT process timed out in 51674ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1842 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 191 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 178 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
[2024-05-22 16:41:01] [INFO ] Invariant cache hit.
[2024-05-22 16:41:03] [INFO ] Implicit Places using invariants in 1882 ms returned []
[2024-05-22 16:41:03] [INFO ] Invariant cache hit.
[2024-05-22 16:41:04] [INFO ] State equation strengthened by 6397 read => feed constraints.
[2024-05-22 16:41:35] [INFO ] Performed 760/1842 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 16:42:05] [INFO ] Performed 1792/1842 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-22 16:42:06] [INFO ] Implicit Places using invariants and state equation in 63362 ms returned []
Implicit Place search using SMT with State Equation took 65244 ms to find 0 implicit places.
[2024-05-22 16:42:07] [INFO ] Redundant transitions in 512 ms returned []
Running 6477 sub problems to find dead transitions.
[2024-05-22 16:42:07] [INFO ] Invariant cache hit.
[2024-05-22 16:42:07] [INFO ] State equation strengthened by 6397 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1841 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6477 unsolved
SMT process timed out in 35849ms, After SMT, problems are : Problem set: 0 solved, 6477 unsolved
Search for dead transitions found 0 dead transitions in 35900ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101855 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Knowledge obtained : [(AND p1 p2 p0 p3), (X p2), (X (NOT (AND (NOT p1) p2))), (X (OR p1 p2)), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR p1 p2))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (OR (NOT p1) p0) (OR (NOT p2) p0)))), (F (NOT (OR p1 p2))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p1 p2)))]
Property proved to be false thanks to negative knowledge :(F (NOT (AND (OR (NOT p1) p0) (OR (NOT p2) p0))))
Knowledge based reduction with 16 factoid took 152 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-01 finished in 254514 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 U (X(G(p1))||F((!p0&&X((F(p2)||G(!p0))))))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 217 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-22 16:42:43] [INFO ] Computed 42 invariants in 404 ms
[2024-05-22 16:42:45] [INFO ] Implicit Places using invariants in 2474 ms returned []
[2024-05-22 16:42:45] [INFO ] Invariant cache hit.
[2024-05-22 16:42:48] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-22 16:43:19] [INFO ] Performed 301/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 16:43:37] [INFO ] Implicit Places using invariants and state equation in 51208 ms returned []
Implicit Place search using SMT with State Equation took 53684 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-22 16:43:37] [INFO ] Invariant cache hit.
[2024-05-22 16:43:37] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 39046ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39135ms
Finished structural reductions in LTL mode , in 1 iterations and 93058 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-03
Product exploration explored 100000 steps with 102 reset in 867 ms.
Product exploration explored 100000 steps with 102 reset in 770 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p1), (X (AND p0 p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 102 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
RANDOM walk for 40000 steps (39 resets) in 486 ms. (82 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
[2024-05-22 16:44:18] [INFO ] Invariant cache hit.
[2024-05-22 16:44:18] [INFO ] State equation strengthened by 3160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3596/3601 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3601 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/3679 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3679 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/3681 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3681 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13521/13523 variables, and 3723 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2438 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 3681/3683 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3596/3601 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:44:21] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2024-05-22 16:44:21] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3601 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3601 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/3679 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3679 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3681 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:44:25] [INFO ] Deduced a trap composed of 72 places in 3598 ms of which 23 ms to minimize.
[2024-05-22 16:44:29] [INFO ] Deduced a trap composed of 74 places in 3300 ms of which 22 ms to minimize.
SMT process timed out in 10420ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1557 Post agglomeration using F-continuation condition.Transition count delta: 1557
Deduced a syphon composed of 1557 places in 3 ms
Reduce places removed 1557 places and 0 transitions.
Iterating global reduction 2 with 3114 rules applied. Total rules applied 3674 place count 1846 transition count 8003
Drop transitions (Redundant composition of simpler transitions.) removed 1479 transitions
Redundant transition composition rules discarded 1479 transitions
Iterating global reduction 2 with 1479 rules applied. Total rules applied 5153 place count 1846 transition count 6524
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5154 place count 1846 transition count 6523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5155 place count 1845 transition count 6523
Partial Free-agglomeration rule applied 1639 times.
Drop transitions (Partial Free agglomeration) removed 1639 transitions
Iterating global reduction 3 with 1639 rules applied. Total rules applied 6794 place count 1845 transition count 6523
Applied a total of 6794 rules in 1235 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6523/9840 (removed 3317) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1235 ms. Remains : 1845/3683 places, 6523/9840 transitions.
RANDOM walk for 40000 steps (214 resets) in 449 ms. (88 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 106485 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 1
Probabilistic random walk after 106485 steps, saw 28313 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
// Phase 1: matrix 6523 rows 1845 cols
[2024-05-22 16:44:33] [INFO ] Computed 42 invariants in 172 ms
[2024-05-22 16:44:33] [INFO ] State equation strengthened by 6393 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/1841 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1841 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/1843 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1843 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6523/8366 variables, 1843/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8366 variables, 6393/8278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8366 variables, 0/8278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/8368 variables, 2/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8368 variables, 0/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/8368 variables, 0/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8368/8368 variables, and 8280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2737 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6393/6393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:44:36] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1841 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:44:38] [INFO ] Deduced a trap composed of 68 places in 1536 ms of which 12 ms to minimize.
[2024-05-22 16:44:39] [INFO ] Deduced a trap composed of 54 places in 1452 ms of which 12 ms to minimize.
[2024-05-22 16:44:41] [INFO ] Deduced a trap composed of 49 places in 1448 ms of which 11 ms to minimize.
[2024-05-22 16:44:42] [INFO ] Deduced a trap composed of 47 places in 1406 ms of which 11 ms to minimize.
[2024-05-22 16:44:44] [INFO ] Deduced a trap composed of 53 places in 1363 ms of which 10 ms to minimize.
[2024-05-22 16:44:45] [INFO ] Deduced a trap composed of 51 places in 1368 ms of which 11 ms to minimize.
[2024-05-22 16:44:46] [INFO ] Deduced a trap composed of 45 places in 1325 ms of which 11 ms to minimize.
[2024-05-22 16:44:48] [INFO ] Deduced a trap composed of 53 places in 1306 ms of which 11 ms to minimize.
[2024-05-22 16:44:49] [INFO ] Deduced a trap composed of 53 places in 1221 ms of which 10 ms to minimize.
[2024-05-22 16:44:50] [INFO ] Deduced a trap composed of 58 places in 1155 ms of which 10 ms to minimize.
[2024-05-22 16:44:51] [INFO ] Deduced a trap composed of 64 places in 1169 ms of which 9 ms to minimize.
[2024-05-22 16:44:53] [INFO ] Deduced a trap composed of 55 places in 1155 ms of which 10 ms to minimize.
[2024-05-22 16:44:54] [INFO ] Deduced a trap composed of 60 places in 1151 ms of which 9 ms to minimize.
[2024-05-22 16:44:55] [INFO ] Deduced a trap composed of 52 places in 1140 ms of which 9 ms to minimize.
[2024-05-22 16:44:56] [INFO ] Deduced a trap composed of 63 places in 1159 ms of which 9 ms to minimize.
[2024-05-22 16:44:57] [INFO ] Deduced a trap composed of 61 places in 1100 ms of which 9 ms to minimize.
[2024-05-22 16:44:58] [INFO ] Deduced a trap composed of 46 places in 1119 ms of which 9 ms to minimize.
[2024-05-22 16:45:00] [INFO ] Deduced a trap composed of 53 places in 1072 ms of which 9 ms to minimize.
[2024-05-22 16:45:01] [INFO ] Deduced a trap composed of 47 places in 1051 ms of which 9 ms to minimize.
[2024-05-22 16:45:02] [INFO ] Deduced a trap composed of 48 places in 1080 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:45:03] [INFO ] Deduced a trap composed of 46 places in 1053 ms of which 9 ms to minimize.
[2024-05-22 16:45:04] [INFO ] Deduced a trap composed of 45 places in 1063 ms of which 9 ms to minimize.
[2024-05-22 16:45:05] [INFO ] Deduced a trap composed of 51 places in 1058 ms of which 9 ms to minimize.
[2024-05-22 16:45:06] [INFO ] Deduced a trap composed of 48 places in 1050 ms of which 9 ms to minimize.
[2024-05-22 16:45:07] [INFO ] Deduced a trap composed of 47 places in 1060 ms of which 9 ms to minimize.
[2024-05-22 16:45:08] [INFO ] Deduced a trap composed of 47 places in 1079 ms of which 8 ms to minimize.
[2024-05-22 16:45:09] [INFO ] Deduced a trap composed of 53 places in 1054 ms of which 9 ms to minimize.
[2024-05-22 16:45:10] [INFO ] Deduced a trap composed of 60 places in 1026 ms of which 9 ms to minimize.
[2024-05-22 16:45:12] [INFO ] Deduced a trap composed of 49 places in 1044 ms of which 9 ms to minimize.
[2024-05-22 16:45:13] [INFO ] Deduced a trap composed of 48 places in 1015 ms of which 9 ms to minimize.
[2024-05-22 16:45:14] [INFO ] Deduced a trap composed of 48 places in 1010 ms of which 9 ms to minimize.
[2024-05-22 16:45:15] [INFO ] Deduced a trap composed of 50 places in 958 ms of which 8 ms to minimize.
[2024-05-22 16:45:16] [INFO ] Deduced a trap composed of 47 places in 962 ms of which 9 ms to minimize.
[2024-05-22 16:45:17] [INFO ] Deduced a trap composed of 46 places in 914 ms of which 9 ms to minimize.
[2024-05-22 16:45:18] [INFO ] Deduced a trap composed of 47 places in 954 ms of which 8 ms to minimize.
[2024-05-22 16:45:19] [INFO ] Deduced a trap composed of 50 places in 911 ms of which 9 ms to minimize.
[2024-05-22 16:45:19] [INFO ] Deduced a trap composed of 46 places in 898 ms of which 8 ms to minimize.
[2024-05-22 16:45:20] [INFO ] Deduced a trap composed of 72 places in 836 ms of which 7 ms to minimize.
[2024-05-22 16:45:21] [INFO ] Deduced a trap composed of 82 places in 852 ms of which 8 ms to minimize.
SMT process timed out in 48203ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6523/6523 transitions.
Applied a total of 0 rules in 171 ms. Remains 1845 /1845 variables (removed 0) and now considering 6523/6523 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 1845/1845 places, 6523/6523 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6523/6523 transitions.
Applied a total of 0 rules in 173 ms. Remains 1845 /1845 variables (removed 0) and now considering 6523/6523 (removed 0) transitions.
[2024-05-22 16:45:22] [INFO ] Invariant cache hit.
[2024-05-22 16:45:23] [INFO ] Implicit Places using invariants in 1888 ms returned []
[2024-05-22 16:45:23] [INFO ] Invariant cache hit.
[2024-05-22 16:45:25] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2024-05-22 16:45:55] [INFO ] Performed 690/1845 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 16:46:25] [INFO ] Performed 1707/1845 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-22 16:46:30] [INFO ] Implicit Places using invariants and state equation in 66134 ms returned []
Implicit Place search using SMT with State Equation took 68023 ms to find 0 implicit places.
[2024-05-22 16:46:30] [INFO ] Redundant transitions in 521 ms returned []
Running 6483 sub problems to find dead transitions.
[2024-05-22 16:46:30] [INFO ] Invariant cache hit.
[2024-05-22 16:46:30] [INFO ] State equation strengthened by 6393 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6483 unsolved
SMT process timed out in 37380ms, After SMT, problems are : Problem set: 0 solved, 6483 unsolved
Search for dead transitions found 0 dead transitions in 37445ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106190 ms. Remains : 1845/1845 places, 6523/6523 transitions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p1), (X (AND p0 p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p2) p1))), (F (NOT p0)), (F (NOT (OR p0 p2))), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 21 factoid took 409 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 245 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-22 16:47:09] [INFO ] Computed 42 invariants in 445 ms
[2024-05-22 16:47:11] [INFO ] Implicit Places using invariants in 2525 ms returned []
[2024-05-22 16:47:11] [INFO ] Invariant cache hit.
[2024-05-22 16:47:14] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-22 16:47:44] [INFO ] Performed 315/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 16:47:59] [INFO ] Implicit Places using invariants and state equation in 48190 ms returned []
Implicit Place search using SMT with State Equation took 50716 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-22 16:47:59] [INFO ] Invariant cache hit.
[2024-05-22 16:47:59] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 39195ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39272ms
Finished structural reductions in LTL mode , in 1 iterations and 90251 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (AND p0 p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 122 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
RANDOM walk for 40000 steps (40 resets) in 523 ms. (76 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
[2024-05-22 16:48:39] [INFO ] Invariant cache hit.
[2024-05-22 16:48:39] [INFO ] State equation strengthened by 3160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3596/3601 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3601 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 78/3679 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3679 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/3681 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3681 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 9840/13521 variables, 3681/3723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13521/13523 variables, and 6883 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3686 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 3681/3683 constraints, ReadFeed: 3160/3160 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3596/3601 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:48:43] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 2 ms to minimize.
[2024-05-22 16:48:44] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2024-05-22 16:48:44] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 2 ms to minimize.
[2024-05-22 16:48:44] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-05-22 16:48:44] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2024-05-22 16:48:44] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 2 ms to minimize.
[2024-05-22 16:48:44] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2024-05-22 16:48:44] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-22 16:48:45] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2024-05-22 16:48:45] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2024-05-22 16:48:45] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-22 16:48:45] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-22 16:48:45] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2024-05-22 16:48:45] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 2 ms to minimize.
[2024-05-22 16:48:45] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-22 16:48:46] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-22 16:48:46] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-22 16:48:46] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-22 16:48:46] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-22 16:48:46] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3601 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:48:46] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2024-05-22 16:48:46] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-22 16:48:46] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2024-05-22 16:48:47] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-22 16:48:47] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-22 16:48:47] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2024-05-22 16:48:47] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-22 16:48:47] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-22 16:48:47] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 2 ms to minimize.
[2024-05-22 16:48:47] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2024-05-22 16:48:48] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-22 16:48:48] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-22 16:48:48] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2024-05-22 16:48:48] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
SMT process timed out in 8770ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1557 Post agglomeration using F-continuation condition.Transition count delta: 1557
Deduced a syphon composed of 1557 places in 3 ms
Reduce places removed 1557 places and 0 transitions.
Iterating global reduction 2 with 3114 rules applied. Total rules applied 3674 place count 1846 transition count 8003
Drop transitions (Redundant composition of simpler transitions.) removed 1479 transitions
Redundant transition composition rules discarded 1479 transitions
Iterating global reduction 2 with 1479 rules applied. Total rules applied 5153 place count 1846 transition count 6524
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5154 place count 1846 transition count 6523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5155 place count 1845 transition count 6523
Partial Free-agglomeration rule applied 1639 times.
Drop transitions (Partial Free agglomeration) removed 1639 transitions
Iterating global reduction 3 with 1639 rules applied. Total rules applied 6794 place count 1845 transition count 6523
Applied a total of 6794 rules in 1405 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6523/9840 (removed 3317) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1407 ms. Remains : 1845/3683 places, 6523/9840 transitions.
RANDOM walk for 40000 steps (211 resets) in 1067 ms. (37 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
// Phase 1: matrix 6523 rows 1845 cols
[2024-05-22 16:48:50] [INFO ] Computed 42 invariants in 159 ms
[2024-05-22 16:48:50] [INFO ] State equation strengthened by 6393 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/1841 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1841 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/1843 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1843 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6523/8366 variables, 1843/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8366 variables, 6393/8278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8366 variables, 0/8278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/8368 variables, 2/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8368 variables, 0/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/8368 variables, 0/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8368/8368 variables, and 8280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2660 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6393/6393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:48:53] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1841 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:48:55] [INFO ] Deduced a trap composed of 76 places in 1505 ms of which 12 ms to minimize.
[2024-05-22 16:48:56] [INFO ] Deduced a trap composed of 73 places in 1556 ms of which 12 ms to minimize.
[2024-05-22 16:48:58] [INFO ] Deduced a trap composed of 80 places in 1470 ms of which 12 ms to minimize.
[2024-05-22 16:48:59] [INFO ] Deduced a trap composed of 65 places in 1391 ms of which 11 ms to minimize.
[2024-05-22 16:49:00] [INFO ] Deduced a trap composed of 62 places in 1381 ms of which 12 ms to minimize.
[2024-05-22 16:49:02] [INFO ] Deduced a trap composed of 49 places in 1431 ms of which 11 ms to minimize.
[2024-05-22 16:49:03] [INFO ] Deduced a trap composed of 49 places in 1369 ms of which 11 ms to minimize.
[2024-05-22 16:49:05] [INFO ] Deduced a trap composed of 70 places in 1349 ms of which 11 ms to minimize.
[2024-05-22 16:49:06] [INFO ] Deduced a trap composed of 45 places in 1189 ms of which 11 ms to minimize.
[2024-05-22 16:49:07] [INFO ] Deduced a trap composed of 48 places in 1195 ms of which 11 ms to minimize.
[2024-05-22 16:49:08] [INFO ] Deduced a trap composed of 47 places in 1146 ms of which 10 ms to minimize.
[2024-05-22 16:49:09] [INFO ] Deduced a trap composed of 46 places in 1146 ms of which 9 ms to minimize.
[2024-05-22 16:49:11] [INFO ] Deduced a trap composed of 46 places in 1199 ms of which 10 ms to minimize.
[2024-05-22 16:49:12] [INFO ] Deduced a trap composed of 48 places in 1242 ms of which 10 ms to minimize.
[2024-05-22 16:49:13] [INFO ] Deduced a trap composed of 47 places in 1187 ms of which 10 ms to minimize.
[2024-05-22 16:49:14] [INFO ] Deduced a trap composed of 47 places in 1203 ms of which 10 ms to minimize.
[2024-05-22 16:49:16] [INFO ] Deduced a trap composed of 56 places in 1136 ms of which 10 ms to minimize.
[2024-05-22 16:49:17] [INFO ] Deduced a trap composed of 67 places in 1160 ms of which 10 ms to minimize.
[2024-05-22 16:49:18] [INFO ] Deduced a trap composed of 55 places in 1192 ms of which 11 ms to minimize.
[2024-05-22 16:49:19] [INFO ] Deduced a trap composed of 53 places in 1244 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:49:20] [INFO ] Deduced a trap composed of 79 places in 1098 ms of which 10 ms to minimize.
[2024-05-22 16:49:21] [INFO ] Deduced a trap composed of 48 places in 1027 ms of which 9 ms to minimize.
[2024-05-22 16:49:23] [INFO ] Deduced a trap composed of 55 places in 1123 ms of which 10 ms to minimize.
[2024-05-22 16:49:24] [INFO ] Deduced a trap composed of 53 places in 1092 ms of which 9 ms to minimize.
[2024-05-22 16:49:25] [INFO ] Deduced a trap composed of 53 places in 1084 ms of which 9 ms to minimize.
[2024-05-22 16:49:26] [INFO ] Deduced a trap composed of 50 places in 1084 ms of which 10 ms to minimize.
[2024-05-22 16:49:27] [INFO ] Deduced a trap composed of 58 places in 1041 ms of which 8 ms to minimize.
[2024-05-22 16:49:28] [INFO ] Deduced a trap composed of 67 places in 1017 ms of which 10 ms to minimize.
[2024-05-22 16:49:29] [INFO ] Deduced a trap composed of 51 places in 1012 ms of which 15 ms to minimize.
[2024-05-22 16:49:30] [INFO ] Deduced a trap composed of 68 places in 1069 ms of which 10 ms to minimize.
[2024-05-22 16:49:31] [INFO ] Deduced a trap composed of 49 places in 1018 ms of which 9 ms to minimize.
[2024-05-22 16:49:32] [INFO ] Deduced a trap composed of 63 places in 988 ms of which 9 ms to minimize.
[2024-05-22 16:49:33] [INFO ] Deduced a trap composed of 46 places in 902 ms of which 8 ms to minimize.
[2024-05-22 16:49:34] [INFO ] Deduced a trap composed of 46 places in 895 ms of which 9 ms to minimize.
[2024-05-22 16:49:35] [INFO ] Deduced a trap composed of 45 places in 893 ms of which 9 ms to minimize.
[2024-05-22 16:49:36] [INFO ] Deduced a trap composed of 63 places in 842 ms of which 8 ms to minimize.
[2024-05-22 16:49:37] [INFO ] Deduced a trap composed of 46 places in 919 ms of which 9 ms to minimize.
[2024-05-22 16:49:38] [INFO ] Deduced a trap composed of 56 places in 883 ms of which 8 ms to minimize.
SMT process timed out in 48105ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6523/6523 transitions.
Applied a total of 0 rules in 172 ms. Remains 1845 /1845 variables (removed 0) and now considering 6523/6523 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 1845/1845 places, 6523/6523 transitions.
RANDOM walk for 40000 steps (216 resets) in 547 ms. (72 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 106285 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 1
Probabilistic random walk after 106285 steps, saw 28273 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
[2024-05-22 16:49:41] [INFO ] Invariant cache hit.
[2024-05-22 16:49:41] [INFO ] State equation strengthened by 6393 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/1841 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1841 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/1843 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1843 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6523/8366 variables, 1843/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8366 variables, 6393/8278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8366 variables, 0/8278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/8368 variables, 2/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8368 variables, 0/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/8368 variables, 0/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8368/8368 variables, and 8280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2584 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6393/6393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:49:44] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1841 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:49:46] [INFO ] Deduced a trap composed of 50 places in 1478 ms of which 12 ms to minimize.
[2024-05-22 16:49:47] [INFO ] Deduced a trap composed of 48 places in 1472 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6523/8366 variables, 1843/1888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8366 variables, 6393/8281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8366 variables, 1/8282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8366 variables, 0/8282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/8368 variables, 2/8284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/8368 variables, 0/8284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/8368 variables, 0/8284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8368/8368 variables, and 8284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7143 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6393/6393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 9798ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6523/6523 transitions.
Applied a total of 0 rules in 170 ms. Remains 1845 /1845 variables (removed 0) and now considering 6523/6523 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 1845/1845 places, 6523/6523 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6523/6523 transitions.
Applied a total of 0 rules in 169 ms. Remains 1845 /1845 variables (removed 0) and now considering 6523/6523 (removed 0) transitions.
[2024-05-22 16:49:51] [INFO ] Invariant cache hit.
[2024-05-22 16:49:53] [INFO ] Implicit Places using invariants in 1856 ms returned []
[2024-05-22 16:49:53] [INFO ] Invariant cache hit.
[2024-05-22 16:49:55] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2024-05-22 16:50:25] [INFO ] Performed 636/1845 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 16:50:55] [INFO ] Performed 1565/1845 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-22 16:51:04] [INFO ] Implicit Places using invariants and state equation in 70773 ms returned []
Implicit Place search using SMT with State Equation took 72631 ms to find 0 implicit places.
[2024-05-22 16:51:04] [INFO ] Redundant transitions in 520 ms returned []
Running 6483 sub problems to find dead transitions.
[2024-05-22 16:51:05] [INFO ] Invariant cache hit.
[2024-05-22 16:51:05] [INFO ] State equation strengthened by 6393 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6483 unsolved
SMT process timed out in 36038ms, After SMT, problems are : Problem set: 0 solved, 6483 unsolved
Search for dead transitions found 0 dead transitions in 36086ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109427 ms. Remains : 1845/1845 places, 6523/6523 transitions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (AND p0 p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p2 p0))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F p2), (F (NOT (AND p1 p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT (AND (NOT p2) p0)))]
Knowledge based reduction with 19 factoid took 434 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Product exploration explored 100000 steps with 103 reset in 701 ms.
Product exploration explored 100000 steps with 105 reset in 832 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 3683 transition count 9840
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 40 Pre rules applied. Total rules applied 200 place count 3683 transition count 9840
Deduced a syphon composed of 240 places in 3 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 240 place count 3683 transition count 9840
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 320 place count 3603 transition count 9760
Deduced a syphon composed of 160 places in 3 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 400 place count 3603 transition count 9760
Performed 1597 Post agglomeration using F-continuation condition.Transition count delta: -3034
Deduced a syphon composed of 1757 places in 3 ms
Iterating global reduction 1 with 1597 rules applied. Total rules applied 1997 place count 3603 transition count 12794
Discarding 160 places :
Symmetric choice reduction at 1 with 160 rule applications. Total rules 2157 place count 3443 transition count 12634
Deduced a syphon composed of 1597 places in 2 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 2317 place count 3443 transition count 12634
Deduced a syphon composed of 1597 places in 2 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1479 transitions
Redundant transition composition rules discarded 1479 transitions
Iterating global reduction 1 with 1479 rules applied. Total rules applied 3796 place count 3443 transition count 11155
Deduced a syphon composed of 1597 places in 2 ms
Applied a total of 3796 rules in 2440 ms. Remains 3443 /3683 variables (removed 240) and now considering 11155/9840 (removed -1315) transitions.
Running 11115 sub problems to find dead transitions.
// Phase 1: matrix 11155 rows 3443 cols
[2024-05-22 16:51:46] [INFO ] Computed 42 invariants in 405 ms
[2024-05-22 16:51:46] [INFO ] State equation strengthened by 4755 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3442 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 11115 unsolved
SMT process timed out in 41903ms, After SMT, problems are : Problem set: 0 solved, 11115 unsolved
Search for dead transitions found 0 dead transitions in 41980ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3443/3683 places, 11155/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44434 ms. Remains : 3443/3683 places, 11155/9840 transitions.
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 226 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-22 16:52:28] [INFO ] Computed 42 invariants in 456 ms
[2024-05-22 16:52:31] [INFO ] Implicit Places using invariants in 2604 ms returned []
[2024-05-22 16:52:31] [INFO ] Invariant cache hit.
[2024-05-22 16:52:34] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-22 16:53:04] [INFO ] Performed 334/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 16:53:18] [INFO ] Implicit Places using invariants and state equation in 47204 ms returned []
Implicit Place search using SMT with State Equation took 49810 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-22 16:53:18] [INFO ] Invariant cache hit.
[2024-05-22 16:53:18] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38833ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 38903ms
Finished structural reductions in LTL mode , in 1 iterations and 88950 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-03 finished in 674455 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 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 219 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2024-05-22 16:53:57] [INFO ] Invariant cache hit.
[2024-05-22 16:53:59] [INFO ] Implicit Places using invariants in 2013 ms returned []
[2024-05-22 16:53:59] [INFO ] Invariant cache hit.
[2024-05-22 16:54:02] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-22 16:54:33] [INFO ] Performed 273/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 16:54:54] [INFO ] Implicit Places using invariants and state equation in 54276 ms returned []
Implicit Place search using SMT with State Equation took 56291 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-22 16:54:54] [INFO ] Invariant cache hit.
[2024-05-22 16:54:54] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 39771ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39876ms
Finished structural reductions in LTL mode , in 1 iterations and 96408 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-04
Stuttering criterion allowed to conclude after 812 steps with 0 reset in 7 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-04 finished in 96554 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((G((G(p1) U p2))||p0))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5157 place count 1845 transition count 6521
Applied a total of 5157 rules in 875 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6521/9840 (removed 3319) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-22 16:55:35] [INFO ] Computed 42 invariants in 164 ms
[2024-05-22 16:55:36] [INFO ] Implicit Places using invariants in 1342 ms returned []
[2024-05-22 16:55:36] [INFO ] Invariant cache hit.
[2024-05-22 16:55:37] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-22 16:55:55] [INFO ] Implicit Places using invariants and state equation in 18515 ms returned []
Implicit Place search using SMT with State Equation took 19860 ms to find 0 implicit places.
[2024-05-22 16:55:55] [INFO ] Redundant transitions in 713 ms returned []
Running 6481 sub problems to find dead transitions.
[2024-05-22 16:55:55] [INFO ] Invariant cache hit.
[2024-05-22 16:55:55] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 35690ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 35750ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/3683 places, 6521/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57213 ms. Remains : 1845/3683 places, 6521/9840 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-07
Product exploration explored 100000 steps with 489 reset in 878 ms.
Product exploration explored 100000 steps with 493 reset in 931 ms.
Computed a total of 124 stabilizing places and 201 stable transitions
Computed a total of 124 stabilizing places and 201 stable transitions
Detected a total of 124/1845 stabilizing places and 201/6521 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 17 factoid took 218 ms. Reduced automaton from 4 states, 15 edges and 3 AP (stutter insensitive) to 4 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (194 resets) in 735 ms. (54 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 7/7 properties
[2024-05-22 16:56:34] [INFO ] Invariant cache hit.
[2024-05-22 16:56:34] [INFO ] State equation strengthened by 4757 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 76/1841 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1841 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/1843 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1843 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 6521/8364 variables, 1843/1885 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8364 variables, 4757/6642 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8364 variables, 0/6642 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/8366 variables, 2/6644 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8366 variables, 0/6644 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8366/8366 variables, and 6644 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 4757/4757 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 16:56:39] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2024-05-22 16:56:39] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 16:56:42] [INFO ] Deduced a trap composed of 46 places in 1413 ms of which 11 ms to minimize.
[2024-05-22 16:56:43] [INFO ] Deduced a trap composed of 56 places in 1419 ms of which 11 ms to minimize.
[2024-05-22 16:56:44] [INFO ] Deduced a trap composed of 46 places in 1352 ms of which 11 ms to minimize.
SMT process timed out in 10480ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1638 times.
Drop transitions (Partial Free agglomeration) removed 1638 transitions
Iterating global reduction 1 with 1638 rules applied. Total rules applied 1642 place count 1843 transition count 6519
Applied a total of 1642 rules in 521 ms. Remains 1843 /1845 variables (removed 2) and now considering 6519/6521 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 523 ms. Remains : 1843/1845 places, 6519/6521 transitions.
RANDOM walk for 40000 steps (212 resets) in 2064 ms. (19 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 72237 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 7
Probabilistic random walk after 72237 steps, saw 22027 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-22 16:56:49] [INFO ] Computed 42 invariants in 167 ms
[2024-05-22 16:56:49] [INFO ] State equation strengthened by 6394 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 76/1839 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1839 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/1841 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 6519/8360 variables, 1841/1883 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8360 variables, 6394/8277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8360 variables, 0/8277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/8362 variables, 2/8279 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8362 variables, 0/8279 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/8362 variables, 0/8279 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8362/8362 variables, and 8279 constraints, problems are : Problem set: 0 solved, 7 unsolved in 6797 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1843/1843 constraints, ReadFeed: 6394/6394 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 16:56:56] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 16:56:58] [INFO ] Deduced a trap composed of 57 places in 1456 ms of which 11 ms to minimize.
[2024-05-22 16:57:00] [INFO ] Deduced a trap composed of 53 places in 1486 ms of which 12 ms to minimize.
[2024-05-22 16:57:01] [INFO ] Deduced a trap composed of 57 places in 1480 ms of which 11 ms to minimize.
[2024-05-22 16:57:03] [INFO ] Deduced a trap composed of 56 places in 1470 ms of which 12 ms to minimize.
[2024-05-22 16:57:04] [INFO ] Deduced a trap composed of 60 places in 1419 ms of which 11 ms to minimize.
[2024-05-22 16:57:06] [INFO ] Deduced a trap composed of 55 places in 1380 ms of which 11 ms to minimize.
[2024-05-22 16:57:07] [INFO ] Deduced a trap composed of 58 places in 1362 ms of which 10 ms to minimize.
[2024-05-22 16:57:08] [INFO ] Deduced a trap composed of 56 places in 1336 ms of which 11 ms to minimize.
[2024-05-22 16:57:10] [INFO ] Deduced a trap composed of 59 places in 1318 ms of which 11 ms to minimize.
[2024-05-22 16:57:11] [INFO ] Deduced a trap composed of 58 places in 1357 ms of which 11 ms to minimize.
[2024-05-22 16:57:13] [INFO ] Deduced a trap composed of 59 places in 1296 ms of which 10 ms to minimize.
[2024-05-22 16:57:14] [INFO ] Deduced a trap composed of 55 places in 1287 ms of which 11 ms to minimize.
[2024-05-22 16:57:15] [INFO ] Deduced a trap composed of 57 places in 1290 ms of which 11 ms to minimize.
[2024-05-22 16:57:17] [INFO ] Deduced a trap composed of 55 places in 1313 ms of which 10 ms to minimize.
[2024-05-22 16:57:18] [INFO ] Deduced a trap composed of 58 places in 1322 ms of which 11 ms to minimize.
[2024-05-22 16:57:19] [INFO ] Deduced a trap composed of 50 places in 1331 ms of which 10 ms to minimize.
[2024-05-22 16:57:21] [INFO ] Deduced a trap composed of 53 places in 1269 ms of which 10 ms to minimize.
[2024-05-22 16:57:22] [INFO ] Deduced a trap composed of 45 places in 1227 ms of which 10 ms to minimize.
[2024-05-22 16:57:23] [INFO ] Deduced a trap composed of 55 places in 1200 ms of which 9 ms to minimize.
[2024-05-22 16:57:24] [INFO ] Deduced a trap composed of 58 places in 1202 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 16:57:25] [INFO ] Deduced a trap composed of 64 places in 1172 ms of which 9 ms to minimize.
[2024-05-22 16:57:27] [INFO ] Deduced a trap composed of 50 places in 1055 ms of which 9 ms to minimize.
[2024-05-22 16:57:28] [INFO ] Deduced a trap composed of 51 places in 1041 ms of which 9 ms to minimize.
[2024-05-22 16:57:29] [INFO ] Deduced a trap composed of 56 places in 1035 ms of which 9 ms to minimize.
[2024-05-22 16:57:30] [INFO ] Deduced a trap composed of 54 places in 1049 ms of which 9 ms to minimize.
[2024-05-22 16:57:31] [INFO ] Deduced a trap composed of 58 places in 1005 ms of which 9 ms to minimize.
[2024-05-22 16:57:32] [INFO ] Deduced a trap composed of 54 places in 1047 ms of which 9 ms to minimize.
[2024-05-22 16:57:33] [INFO ] Deduced a trap composed of 61 places in 1011 ms of which 9 ms to minimize.
[2024-05-22 16:57:34] [INFO ] Deduced a trap composed of 47 places in 991 ms of which 9 ms to minimize.
[2024-05-22 16:57:35] [INFO ] Deduced a trap composed of 52 places in 913 ms of which 8 ms to minimize.
[2024-05-22 16:57:36] [INFO ] Deduced a trap composed of 83 places in 991 ms of which 8 ms to minimize.
[2024-05-22 16:57:37] [INFO ] Deduced a trap composed of 76 places in 940 ms of which 8 ms to minimize.
[2024-05-22 16:57:38] [INFO ] Deduced a trap composed of 61 places in 907 ms of which 8 ms to minimize.
[2024-05-22 16:57:39] [INFO ] Deduced a trap composed of 57 places in 911 ms of which 7 ms to minimize.
[2024-05-22 16:57:40] [INFO ] Deduced a trap composed of 53 places in 897 ms of which 8 ms to minimize.
[2024-05-22 16:57:41] [INFO ] Deduced a trap composed of 75 places in 874 ms of which 8 ms to minimize.
[2024-05-22 16:57:42] [INFO ] Deduced a trap composed of 58 places in 893 ms of which 8 ms to minimize.
SMT process timed out in 52759ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 179 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 193 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2024-05-22 16:57:42] [INFO ] Invariant cache hit.
[2024-05-22 16:57:44] [INFO ] Implicit Places using invariants in 1809 ms returned []
[2024-05-22 16:57:44] [INFO ] Invariant cache hit.
[2024-05-22 16:57:45] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-22 16:58:16] [INFO ] Performed 727/1843 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 16:58:46] [INFO ] Performed 1602/1843 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-22 16:58:54] [INFO ] Implicit Places using invariants and state equation in 69866 ms returned []
Implicit Place search using SMT with State Equation took 71677 ms to find 0 implicit places.
[2024-05-22 16:58:54] [INFO ] Redundant transitions in 523 ms returned []
Running 6479 sub problems to find dead transitions.
[2024-05-22 16:58:54] [INFO ] Invariant cache hit.
[2024-05-22 16:58:54] [INFO ] State equation strengthened by 6394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1842 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6479 unsolved
SMT process timed out in 36289ms, After SMT, problems are : Problem set: 0 solved, 6479 unsolved
Search for dead transitions found 0 dead transitions in 36339ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108752 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F p2)]
Knowledge based reduction with 17 factoid took 257 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter insensitive) to 4 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Applied a total of 0 rules in 186 ms. Remains 1845 /1845 variables (removed 0) and now considering 6521/6521 (removed 0) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-22 16:59:31] [INFO ] Computed 42 invariants in 126 ms
[2024-05-22 16:59:33] [INFO ] Implicit Places using invariants in 1300 ms returned []
[2024-05-22 16:59:33] [INFO ] Invariant cache hit.
[2024-05-22 16:59:34] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-22 16:59:51] [INFO ] Implicit Places using invariants and state equation in 18674 ms returned []
Implicit Place search using SMT with State Equation took 19977 ms to find 0 implicit places.
[2024-05-22 16:59:52] [INFO ] Redundant transitions in 473 ms returned []
Running 6481 sub problems to find dead transitions.
[2024-05-22 16:59:52] [INFO ] Invariant cache hit.
[2024-05-22 16:59:52] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 35086ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 35132ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55787 ms. Remains : 1845/1845 places, 6521/6521 transitions.
Computed a total of 124 stabilizing places and 201 stable transitions
Computed a total of 124 stabilizing places and 201 stable transitions
Detected a total of 124/1845 stabilizing places and 201/6521 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 17 factoid took 214 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter insensitive) to 4 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (194 resets) in 2035 ms. (19 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 7/7 properties
[2024-05-22 17:00:28] [INFO ] Invariant cache hit.
[2024-05-22 17:00:28] [INFO ] State equation strengthened by 4757 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 76/1841 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1841 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/1843 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1843 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 6521/8364 variables, 1843/1885 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8364 variables, 4757/6642 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8364 variables, 0/6642 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/8366 variables, 2/6644 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8366 variables, 0/6644 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8366/8366 variables, and 6644 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 4757/4757 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 17:00:34] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2024-05-22 17:00:34] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 17:00:36] [INFO ] Deduced a trap composed of 46 places in 1417 ms of which 11 ms to minimize.
[2024-05-22 17:00:37] [INFO ] Deduced a trap composed of 56 places in 1412 ms of which 12 ms to minimize.
[2024-05-22 17:00:39] [INFO ] Deduced a trap composed of 46 places in 1425 ms of which 12 ms to minimize.
SMT process timed out in 10543ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1638 times.
Drop transitions (Partial Free agglomeration) removed 1638 transitions
Iterating global reduction 1 with 1638 rules applied. Total rules applied 1642 place count 1843 transition count 6519
Applied a total of 1642 rules in 508 ms. Remains 1843 /1845 variables (removed 2) and now considering 6519/6521 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 509 ms. Remains : 1843/1845 places, 6519/6521 transitions.
RANDOM walk for 40000 steps (216 resets) in 2310 ms. (17 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 75993 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 7
Probabilistic random walk after 75993 steps, saw 22439 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-22 17:00:43] [INFO ] Computed 42 invariants in 160 ms
[2024-05-22 17:00:43] [INFO ] State equation strengthened by 6394 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 76/1839 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1839 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/1841 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 6519/8360 variables, 1841/1883 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8360 variables, 6394/8277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8360 variables, 0/8277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/8362 variables, 2/8279 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8362 variables, 0/8279 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/8362 variables, 0/8279 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8362/8362 variables, and 8279 constraints, problems are : Problem set: 0 solved, 7 unsolved in 6950 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1843/1843 constraints, ReadFeed: 6394/6394 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 17:00:51] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 17:00:53] [INFO ] Deduced a trap composed of 57 places in 1482 ms of which 12 ms to minimize.
[2024-05-22 17:00:54] [INFO ] Deduced a trap composed of 53 places in 1450 ms of which 12 ms to minimize.
[2024-05-22 17:00:56] [INFO ] Deduced a trap composed of 57 places in 1415 ms of which 11 ms to minimize.
[2024-05-22 17:00:57] [INFO ] Deduced a trap composed of 56 places in 1393 ms of which 11 ms to minimize.
[2024-05-22 17:00:59] [INFO ] Deduced a trap composed of 60 places in 1457 ms of which 12 ms to minimize.
[2024-05-22 17:01:00] [INFO ] Deduced a trap composed of 55 places in 1417 ms of which 11 ms to minimize.
[2024-05-22 17:01:02] [INFO ] Deduced a trap composed of 58 places in 1390 ms of which 11 ms to minimize.
[2024-05-22 17:01:03] [INFO ] Deduced a trap composed of 56 places in 1356 ms of which 11 ms to minimize.
[2024-05-22 17:01:04] [INFO ] Deduced a trap composed of 59 places in 1341 ms of which 11 ms to minimize.
[2024-05-22 17:01:06] [INFO ] Deduced a trap composed of 58 places in 1386 ms of which 11 ms to minimize.
[2024-05-22 17:01:07] [INFO ] Deduced a trap composed of 59 places in 1264 ms of which 10 ms to minimize.
[2024-05-22 17:01:08] [INFO ] Deduced a trap composed of 55 places in 1324 ms of which 10 ms to minimize.
[2024-05-22 17:01:10] [INFO ] Deduced a trap composed of 57 places in 1256 ms of which 10 ms to minimize.
[2024-05-22 17:01:11] [INFO ] Deduced a trap composed of 55 places in 1327 ms of which 10 ms to minimize.
[2024-05-22 17:01:12] [INFO ] Deduced a trap composed of 58 places in 1306 ms of which 11 ms to minimize.
[2024-05-22 17:01:14] [INFO ] Deduced a trap composed of 50 places in 1321 ms of which 10 ms to minimize.
[2024-05-22 17:01:15] [INFO ] Deduced a trap composed of 53 places in 1260 ms of which 10 ms to minimize.
[2024-05-22 17:01:16] [INFO ] Deduced a trap composed of 45 places in 1205 ms of which 10 ms to minimize.
[2024-05-22 17:01:17] [INFO ] Deduced a trap composed of 55 places in 1198 ms of which 9 ms to minimize.
[2024-05-22 17:01:19] [INFO ] Deduced a trap composed of 58 places in 1136 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 17:01:20] [INFO ] Deduced a trap composed of 64 places in 1180 ms of which 10 ms to minimize.
[2024-05-22 17:01:21] [INFO ] Deduced a trap composed of 50 places in 1026 ms of which 9 ms to minimize.
[2024-05-22 17:01:22] [INFO ] Deduced a trap composed of 51 places in 1105 ms of which 9 ms to minimize.
[2024-05-22 17:01:23] [INFO ] Deduced a trap composed of 56 places in 1110 ms of which 10 ms to minimize.
[2024-05-22 17:01:24] [INFO ] Deduced a trap composed of 54 places in 1111 ms of which 9 ms to minimize.
[2024-05-22 17:01:25] [INFO ] Deduced a trap composed of 58 places in 1044 ms of which 9 ms to minimize.
[2024-05-22 17:01:26] [INFO ] Deduced a trap composed of 54 places in 1063 ms of which 9 ms to minimize.
[2024-05-22 17:01:27] [INFO ] Deduced a trap composed of 61 places in 1020 ms of which 9 ms to minimize.
[2024-05-22 17:01:28] [INFO ] Deduced a trap composed of 47 places in 964 ms of which 8 ms to minimize.
[2024-05-22 17:01:29] [INFO ] Deduced a trap composed of 52 places in 983 ms of which 9 ms to minimize.
[2024-05-22 17:01:30] [INFO ] Deduced a trap composed of 83 places in 950 ms of which 8 ms to minimize.
[2024-05-22 17:01:31] [INFO ] Deduced a trap composed of 76 places in 952 ms of which 8 ms to minimize.
[2024-05-22 17:01:32] [INFO ] Deduced a trap composed of 61 places in 893 ms of which 9 ms to minimize.
[2024-05-22 17:01:33] [INFO ] Deduced a trap composed of 57 places in 904 ms of which 8 ms to minimize.
[2024-05-22 17:01:34] [INFO ] Deduced a trap composed of 53 places in 903 ms of which 8 ms to minimize.
[2024-05-22 17:01:35] [INFO ] Deduced a trap composed of 75 places in 876 ms of which 8 ms to minimize.
[2024-05-22 17:01:36] [INFO ] Deduced a trap composed of 58 places in 951 ms of which 8 ms to minimize.
SMT process timed out in 52990ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 176 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 175 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2024-05-22 17:01:36] [INFO ] Invariant cache hit.
[2024-05-22 17:01:38] [INFO ] Implicit Places using invariants in 1887 ms returned []
[2024-05-22 17:01:38] [INFO ] Invariant cache hit.
[2024-05-22 17:01:40] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-22 17:02:10] [INFO ] Performed 705/1843 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 17:02:40] [INFO ] Performed 1596/1843 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-22 17:02:48] [INFO ] Implicit Places using invariants and state equation in 69960 ms returned []
Implicit Place search using SMT with State Equation took 71849 ms to find 0 implicit places.
[2024-05-22 17:02:49] [INFO ] Redundant transitions in 520 ms returned []
Running 6479 sub problems to find dead transitions.
[2024-05-22 17:02:49] [INFO ] Invariant cache hit.
[2024-05-22 17:02:49] [INFO ] State equation strengthened by 6394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1842 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6479 unsolved
SMT process timed out in 36886ms, After SMT, problems are : Problem set: 0 solved, 6479 unsolved
Search for dead transitions found 0 dead transitions in 36948ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109508 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F p2)]
Knowledge based reduction with 17 factoid took 262 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter insensitive) to 4 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Product exploration explored 100000 steps with 491 reset in 1093 ms.
Product exploration explored 100000 steps with 495 reset in 1175 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Applied a total of 0 rules in 177 ms. Remains 1845 /1845 variables (removed 0) and now considering 6521/6521 (removed 0) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-22 17:03:29] [INFO ] Computed 42 invariants in 123 ms
[2024-05-22 17:03:30] [INFO ] Implicit Places using invariants in 1316 ms returned []
[2024-05-22 17:03:30] [INFO ] Invariant cache hit.
[2024-05-22 17:03:32] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-22 17:03:50] [INFO ] Implicit Places using invariants and state equation in 19244 ms returned []
Implicit Place search using SMT with State Equation took 20561 ms to find 0 implicit places.
[2024-05-22 17:03:50] [INFO ] Redundant transitions in 476 ms returned []
Running 6481 sub problems to find dead transitions.
[2024-05-22 17:03:50] [INFO ] Invariant cache hit.
[2024-05-22 17:03:50] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 35338ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 35386ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56616 ms. Remains : 1845/1845 places, 6521/6521 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-07 finished in 532012 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&&G(F(p1)))))))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 226 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-22 17:04:26] [INFO ] Computed 42 invariants in 397 ms
[2024-05-22 17:04:28] [INFO ] Implicit Places using invariants in 2489 ms returned []
[2024-05-22 17:04:28] [INFO ] Invariant cache hit.
[2024-05-22 17:04:31] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-22 17:05:02] [INFO ] Performed 321/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 17:05:17] [INFO ] Implicit Places using invariants and state equation in 48311 ms returned []
Implicit Place search using SMT with State Equation took 50801 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-22 17:05:17] [INFO ] Invariant cache hit.
[2024-05-22 17:05:17] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 39405ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39473ms
Finished structural reductions in LTL mode , in 1 iterations and 90512 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-08
Product exploration explored 100000 steps with 104 reset in 969 ms.
Product exploration explored 100000 steps with 108 reset in 787 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 30450 steps (30 resets) in 345 ms. (88 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 94 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 p1), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 3683 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 909 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2024-05-22 17:06:00] [INFO ] Computed 42 invariants in 160 ms
[2024-05-22 17:06:01] [INFO ] Implicit Places using invariants in 1332 ms returned []
[2024-05-22 17:06:01] [INFO ] Invariant cache hit.
[2024-05-22 17:06:02] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-22 17:06:17] [INFO ] Implicit Places using invariants and state equation in 15722 ms returned []
Implicit Place search using SMT with State Equation took 17055 ms to find 0 implicit places.
[2024-05-22 17:06:17] [INFO ] Redundant transitions in 510 ms returned []
Running 6480 sub problems to find dead transitions.
[2024-05-22 17:06:17] [INFO ] Invariant cache hit.
[2024-05-22 17:06:17] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1843 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6480 unsolved
SMT process timed out in 35011ms, After SMT, problems are : Problem set: 0 solved, 6480 unsolved
Search for dead transitions found 0 dead transitions in 35057ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53544 ms. Remains : 1844/3683 places, 6520/9840 transitions.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 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 65 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 35856 steps (173 resets) in 411 ms. (87 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 494 reset in 870 ms.
Product exploration explored 100000 steps with 494 reset in 933 ms.
Support contains 1 out of 1844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Applied a total of 0 rules in 163 ms. Remains 1844 /1844 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
[2024-05-22 17:06:55] [INFO ] Invariant cache hit.
[2024-05-22 17:06:56] [INFO ] Implicit Places using invariants in 1220 ms returned []
[2024-05-22 17:06:56] [INFO ] Invariant cache hit.
[2024-05-22 17:06:58] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-22 17:07:12] [INFO ] Implicit Places using invariants and state equation in 15681 ms returned []
Implicit Place search using SMT with State Equation took 16902 ms to find 0 implicit places.
[2024-05-22 17:07:12] [INFO ] Redundant transitions in 466 ms returned []
Running 6480 sub problems to find dead transitions.
[2024-05-22 17:07:12] [INFO ] Invariant cache hit.
[2024-05-22 17:07:13] [INFO ] State equation strengthened by 4757 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1843 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6480 unsolved
SMT process timed out in 34872ms, After SMT, problems are : Problem set: 0 solved, 6480 unsolved
Search for dead transitions found 0 dead transitions in 34920ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52469 ms. Remains : 1844/1844 places, 6520/6520 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-08 finished in 201752 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 3 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 280 rules applied. Total rules applied 559 place count 3404 transition count 9560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1481 Post agglomeration using F-continuation condition.Transition count delta: 1481
Deduced a syphon composed of 1481 places in 3 ms
Reduce places removed 1481 places and 0 transitions.
Iterating global reduction 3 with 2962 rules applied. Total rules applied 3522 place count 1922 transition count 8079
Drop transitions (Redundant composition of simpler transitions.) removed 1405 transitions
Redundant transition composition rules discarded 1405 transitions
Iterating global reduction 3 with 1405 rules applied. Total rules applied 4927 place count 1922 transition count 6674
Partial Post-agglomeration rule applied 154 times.
Drop transitions (Partial Post agglomeration) removed 154 transitions
Iterating global reduction 3 with 154 rules applied. Total rules applied 5081 place count 1922 transition count 6674
Discarding 76 places :
Symmetric choice reduction at 3 with 76 rule applications. Total rules 5157 place count 1846 transition count 6598
Iterating global reduction 3 with 76 rules applied. Total rules applied 5233 place count 1846 transition count 6598
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 5271 place count 1846 transition count 6560
Applied a total of 5271 rules in 1376 ms. Remains 1846 /3683 variables (removed 1837) and now considering 6560/9840 (removed 3280) transitions.
// Phase 1: matrix 6560 rows 1846 cols
[2024-05-22 17:07:49] [INFO ] Computed 42 invariants in 138 ms
[2024-05-22 17:07:50] [INFO ] Implicit Places using invariants in 1315 ms returned []
[2024-05-22 17:07:50] [INFO ] Invariant cache hit.
[2024-05-22 17:07:52] [INFO ] State equation strengthened by 4793 read => feed constraints.
[2024-05-22 17:08:10] [INFO ] Implicit Places using invariants and state equation in 20029 ms returned []
Implicit Place search using SMT with State Equation took 21347 ms to find 0 implicit places.
[2024-05-22 17:08:11] [INFO ] Redundant transitions in 706 ms returned []
Running 6520 sub problems to find dead transitions.
[2024-05-22 17:08:11] [INFO ] Invariant cache hit.
[2024-05-22 17:08:11] [INFO ] State equation strengthened by 4793 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1845 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6520 unsolved
SMT process timed out in 35717ms, After SMT, problems are : Problem set: 0 solved, 6520 unsolved
Search for dead transitions found 0 dead transitions in 35778ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1846/3683 places, 6560/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59224 ms. Remains : 1846/3683 places, 6560/9840 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-10
Product exploration explored 100000 steps with 488 reset in 879 ms.
Product exploration explored 100000 steps with 485 reset in 931 ms.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 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 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (191 resets) in 507 ms. (78 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 107071 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 1
Probabilistic random walk after 107071 steps, saw 29798 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
[2024-05-22 17:08:52] [INFO ] Invariant cache hit.
[2024-05-22 17:08:52] [INFO ] State equation strengthened by 4793 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1761/1764 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:08:52] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1764 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1764 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1842 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1842 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1844 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:08:54] [INFO ] Deduced a trap composed of 77 places in 1489 ms of which 12 ms to minimize.
[2024-05-22 17:08:56] [INFO ] Deduced a trap composed of 52 places in 1467 ms of which 11 ms to minimize.
[2024-05-22 17:08:57] [INFO ] Deduced a trap composed of 66 places in 1513 ms of which 11 ms to minimize.
SMT process timed out in 5083ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6560/6560 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1846 transition count 6559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1845 transition count 6559
Partial Free-agglomeration rule applied 1601 times.
Drop transitions (Partial Free agglomeration) removed 1601 transitions
Iterating global reduction 1 with 1601 rules applied. Total rules applied 1603 place count 1845 transition count 6559
Applied a total of 1603 rules in 526 ms. Remains 1845 /1846 variables (removed 1) and now considering 6559/6560 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 526 ms. Remains : 1845/1846 places, 6559/6560 transitions.
RANDOM walk for 40000 steps (211 resets) in 610 ms. (65 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 102758 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 1
Probabilistic random walk after 102758 steps, saw 27909 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
// Phase 1: matrix 6559 rows 1845 cols
[2024-05-22 17:09:01] [INFO ] Computed 42 invariants in 151 ms
[2024-05-22 17:09:01] [INFO ] State equation strengthened by 6393 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:09:01] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-22 17:09:01] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1841 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:09:03] [INFO ] Deduced a trap composed of 68 places in 1469 ms of which 12 ms to minimize.
[2024-05-22 17:09:05] [INFO ] Deduced a trap composed of 48 places in 1453 ms of which 11 ms to minimize.
[2024-05-22 17:09:05] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6559/8402 variables, 1843/1890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8402 variables, 6393/8283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8402 variables, 0/8283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/8404 variables, 2/8285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8404 variables, 0/8285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/8404 variables, 0/8285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8404/8404 variables, and 8285 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6478 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6393/6393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:09:08] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-22 17:09:08] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 0 ms to minimize.
[2024-05-22 17:09:08] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-22 17:09:08] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-22 17:09:08] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 0 ms to minimize.
[2024-05-22 17:09:08] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-22 17:09:08] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-22 17:09:08] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-22 17:09:08] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-22 17:09:09] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 0 ms to minimize.
[2024-05-22 17:09:09] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-22 17:09:09] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-22 17:09:09] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-22 17:09:09] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-22 17:09:09] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-22 17:09:09] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-22 17:09:09] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-22 17:09:09] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-05-22 17:09:09] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-22 17:09:09] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:09:09] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-22 17:09:09] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-22 17:09:09] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-22 17:09:10] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-22 17:09:10] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-22 17:09:10] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-22 17:09:10] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-22 17:09:10] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-22 17:09:10] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-22 17:09:10] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-22 17:09:10] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-22 17:09:10] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-22 17:09:10] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-22 17:09:10] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-22 17:09:10] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-22 17:09:10] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-22 17:09:10] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1763 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1763 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 78/1841 variables, 39/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/1843 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1843 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1843 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6559/8402 variables, 1843/1927 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8402 variables, 6393/8320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8402 variables, 1/8321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/8402 variables, 0/8321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/8404 variables, 2/8323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/8404 variables, 0/8323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/8404 variables, 0/8323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8404/8404 variables, and 8323 constraints, problems are : Problem set: 0 solved, 1 unsolved in 12257 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6393/6393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 42/42 constraints]
After SMT, in 18948ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 3 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6559/6559 transitions.
Applied a total of 0 rules in 212 ms. Remains 1845 /1845 variables (removed 0) and now considering 6559/6559 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 1845/1845 places, 6559/6559 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6559/6559 transitions.
Applied a total of 0 rules in 227 ms. Remains 1845 /1845 variables (removed 0) and now considering 6559/6559 (removed 0) transitions.
[2024-05-22 17:09:20] [INFO ] Invariant cache hit.
[2024-05-22 17:09:22] [INFO ] Implicit Places using invariants in 1962 ms returned []
[2024-05-22 17:09:22] [INFO ] Invariant cache hit.
[2024-05-22 17:09:24] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2024-05-22 17:09:54] [INFO ] Performed 699/1845 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 17:10:24] [INFO ] Performed 1605/1845 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-22 17:10:31] [INFO ] Implicit Places using invariants and state equation in 69054 ms returned []
Implicit Place search using SMT with State Equation took 71018 ms to find 0 implicit places.
[2024-05-22 17:10:32] [INFO ] Redundant transitions in 523 ms returned []
Running 6519 sub problems to find dead transitions.
[2024-05-22 17:10:32] [INFO ] Invariant cache hit.
[2024-05-22 17:10:32] [INFO ] State equation strengthened by 6393 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6519 unsolved
SMT process timed out in 36042ms, After SMT, problems are : Problem set: 0 solved, 6519 unsolved
Search for dead transitions found 0 dead transitions in 36094ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107882 ms. Remains : 1845/1845 places, 6559/6559 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 1846 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1846/1846 places, 6560/6560 transitions.
Applied a total of 0 rules in 191 ms. Remains 1846 /1846 variables (removed 0) and now considering 6560/6560 (removed 0) transitions.
// Phase 1: matrix 6560 rows 1846 cols
[2024-05-22 17:11:09] [INFO ] Computed 42 invariants in 130 ms
[2024-05-22 17:11:10] [INFO ] Implicit Places using invariants in 1301 ms returned []
[2024-05-22 17:11:10] [INFO ] Invariant cache hit.
[2024-05-22 17:11:11] [INFO ] State equation strengthened by 4793 read => feed constraints.
[2024-05-22 17:11:28] [INFO ] Implicit Places using invariants and state equation in 18261 ms returned []
Implicit Place search using SMT with State Equation took 19564 ms to find 0 implicit places.
[2024-05-22 17:11:29] [INFO ] Redundant transitions in 487 ms returned []
Running 6520 sub problems to find dead transitions.
[2024-05-22 17:11:29] [INFO ] Invariant cache hit.
[2024-05-22 17:11:29] [INFO ] State equation strengthened by 4793 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1845 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6520 unsolved
SMT process timed out in 35162ms, After SMT, problems are : Problem set: 0 solved, 6520 unsolved
Search for dead transitions found 0 dead transitions in 35208ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55465 ms. Remains : 1846/1846 places, 6560/6560 transitions.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 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 40000 steps (192 resets) in 487 ms. (81 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 107063 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 1
Probabilistic random walk after 107063 steps, saw 29798 distinct states, run finished after 3002 ms. (steps per millisecond=35 ) properties seen :0
[2024-05-22 17:12:07] [INFO ] Invariant cache hit.
[2024-05-22 17:12:07] [INFO ] State equation strengthened by 4793 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1761/1764 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:12:07] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1764 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1764 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1842 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1842 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1844 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:12:09] [INFO ] Deduced a trap composed of 77 places in 1493 ms of which 11 ms to minimize.
[2024-05-22 17:12:11] [INFO ] Deduced a trap composed of 52 places in 1495 ms of which 13 ms to minimize.
[2024-05-22 17:12:12] [INFO ] Deduced a trap composed of 66 places in 1497 ms of which 12 ms to minimize.
SMT process timed out in 5072ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6560/6560 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1846 transition count 6559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1845 transition count 6559
Partial Free-agglomeration rule applied 1601 times.
Drop transitions (Partial Free agglomeration) removed 1601 transitions
Iterating global reduction 1 with 1601 rules applied. Total rules applied 1603 place count 1845 transition count 6559
Applied a total of 1603 rules in 584 ms. Remains 1845 /1846 variables (removed 1) and now considering 6559/6560 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 585 ms. Remains : 1845/1846 places, 6559/6560 transitions.
RANDOM walk for 40000 steps (211 resets) in 526 ms. (75 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 101515 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 1
Probabilistic random walk after 101515 steps, saw 27753 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
// Phase 1: matrix 6559 rows 1845 cols
[2024-05-22 17:12:16] [INFO ] Computed 42 invariants in 153 ms
[2024-05-22 17:12:16] [INFO ] State equation strengthened by 6393 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:12:16] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2024-05-22 17:12:17] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1841 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:12:18] [INFO ] Deduced a trap composed of 68 places in 1506 ms of which 11 ms to minimize.
[2024-05-22 17:12:20] [INFO ] Deduced a trap composed of 48 places in 1426 ms of which 10 ms to minimize.
[2024-05-22 17:12:20] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6559/8402 variables, 1843/1890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8402 variables, 6393/8283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8402 variables, 0/8283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/8404 variables, 2/8285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8404 variables, 0/8285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/8404 variables, 0/8285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8404/8404 variables, and 8285 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6391 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6393/6393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:12:23] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2024-05-22 17:12:23] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-22 17:12:23] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-22 17:12:23] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-22 17:12:23] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-22 17:12:23] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 0 ms to minimize.
[2024-05-22 17:12:23] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-22 17:12:23] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-22 17:12:23] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-22 17:12:23] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-22 17:12:24] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-22 17:12:24] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-22 17:12:24] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-22 17:12:24] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-22 17:12:24] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-22 17:12:24] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-22 17:12:24] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-22 17:12:24] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-22 17:12:24] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 0 ms to minimize.
[2024-05-22 17:12:24] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:12:24] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-22 17:12:24] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-22 17:12:24] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-22 17:12:24] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-22 17:12:24] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-22 17:12:25] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-22 17:12:25] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-22 17:12:25] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-22 17:12:25] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-22 17:12:25] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-22 17:12:25] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-22 17:12:25] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-22 17:12:25] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-22 17:12:25] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
[2024-05-22 17:12:25] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-22 17:12:25] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-22 17:12:25] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1763 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1763 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 78/1841 variables, 39/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/1843 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1843 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1843 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6559/8402 variables, 1843/1927 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8402 variables, 6393/8320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8402 variables, 1/8321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/8402 variables, 0/8321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/8404 variables, 2/8323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/8404 variables, 0/8323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/8404 variables, 0/8323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8404/8404 variables, and 8323 constraints, problems are : Problem set: 0 solved, 1 unsolved in 12208 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6393/6393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 42/42 constraints]
After SMT, in 18825ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 3 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6559/6559 transitions.
Applied a total of 0 rules in 219 ms. Remains 1845 /1845 variables (removed 0) and now considering 6559/6559 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 1845/1845 places, 6559/6559 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6559/6559 transitions.
Applied a total of 0 rules in 208 ms. Remains 1845 /1845 variables (removed 0) and now considering 6559/6559 (removed 0) transitions.
[2024-05-22 17:12:35] [INFO ] Invariant cache hit.
[2024-05-22 17:12:37] [INFO ] Implicit Places using invariants in 1878 ms returned []
[2024-05-22 17:12:37] [INFO ] Invariant cache hit.
[2024-05-22 17:12:39] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2024-05-22 17:13:09] [INFO ] Performed 681/1845 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 17:13:39] [INFO ] Performed 1672/1845 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-22 17:13:43] [INFO ] Implicit Places using invariants and state equation in 65936 ms returned []
Implicit Place search using SMT with State Equation took 67814 ms to find 0 implicit places.
[2024-05-22 17:13:44] [INFO ] Redundant transitions in 519 ms returned []
Running 6519 sub problems to find dead transitions.
[2024-05-22 17:13:44] [INFO ] Invariant cache hit.
[2024-05-22 17:13:44] [INFO ] State equation strengthened by 6393 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6519 unsolved
SMT process timed out in 36130ms, After SMT, problems are : Problem set: 0 solved, 6519 unsolved
Search for dead transitions found 0 dead transitions in 36178ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104739 ms. Remains : 1845/1845 places, 6559/6559 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 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 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 486 reset in 882 ms.
Product exploration explored 100000 steps with 490 reset in 903 ms.
Support contains 3 out of 1846 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1846/1846 places, 6560/6560 transitions.
Applied a total of 0 rules in 308 ms. Remains 1846 /1846 variables (removed 0) and now considering 6560/6560 (removed 0) transitions.
// Phase 1: matrix 6560 rows 1846 cols
[2024-05-22 17:14:22] [INFO ] Computed 42 invariants in 129 ms
[2024-05-22 17:14:24] [INFO ] Implicit Places using invariants in 1315 ms returned []
[2024-05-22 17:14:24] [INFO ] Invariant cache hit.
[2024-05-22 17:14:25] [INFO ] State equation strengthened by 4793 read => feed constraints.
[2024-05-22 17:14:40] [INFO ] Implicit Places using invariants and state equation in 16827 ms returned []
Implicit Place search using SMT with State Equation took 18144 ms to find 0 implicit places.
[2024-05-22 17:14:41] [INFO ] Redundant transitions in 538 ms returned []
Running 6520 sub problems to find dead transitions.
[2024-05-22 17:14:41] [INFO ] Invariant cache hit.
[2024-05-22 17:14:41] [INFO ] State equation strengthened by 4793 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 timeout
1.0)
(s101 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1845 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6520 unsolved
SMT process timed out in 35077ms, After SMT, problems are : Problem set: 0 solved, 6520 unsolved
Search for dead transitions found 0 dead transitions in 35124ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54132 ms. Remains : 1846/1846 places, 6560/6560 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-10 finished in 448738 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((G(p0)||G(p1))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 299 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-22 17:15:17] [INFO ] Computed 42 invariants in 385 ms
[2024-05-22 17:15:19] [INFO ] Implicit Places using invariants in 2390 ms returned []
[2024-05-22 17:15:19] [INFO ] Invariant cache hit.
[2024-05-22 17:15:22] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-22 17:15:52] [INFO ] Performed 343/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 17:16:05] [INFO ] Implicit Places using invariants and state equation in 46097 ms returned []
Implicit Place search using SMT with State Equation took 48488 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-22 17:16:05] [INFO ] Invariant cache hit.
[2024-05-22 17:16:05] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38822ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 38894ms
Finished structural reductions in LTL mode , in 1 iterations and 87693 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 26 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-11 finished in 87917 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||X(p1))))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 287 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2024-05-22 17:16:44] [INFO ] Invariant cache hit.
[2024-05-22 17:16:47] [INFO ] Implicit Places using invariants in 2126 ms returned []
[2024-05-22 17:16:47] [INFO ] Invariant cache hit.
[2024-05-22 17:16:50] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-22 17:17:20] [INFO ] Performed 315/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 17:17:35] [INFO ] Implicit Places using invariants and state equation in 48819 ms returned []
Implicit Place search using SMT with State Equation took 50947 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-22 17:17:36] [INFO ] Invariant cache hit.
[2024-05-22 17:17:36] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38956ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39027ms
Finished structural reductions in LTL mode , in 1 iterations and 90273 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-12
Stuttering criterion allowed to conclude after 1064 steps with 0 reset in 9 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-12 finished in 90379 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 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 1055 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2024-05-22 17:18:16] [INFO ] Computed 42 invariants in 123 ms
[2024-05-22 17:18:17] [INFO ] Implicit Places using invariants in 1305 ms returned []
[2024-05-22 17:18:17] [INFO ] Invariant cache hit.
[2024-05-22 17:18:18] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-22 17:18:32] [INFO ] Implicit Places using invariants and state equation in 15495 ms returned []
Implicit Place search using SMT with State Equation took 16803 ms to find 0 implicit places.
[2024-05-22 17:18:33] [INFO ] Redundant transitions in 672 ms returned []
Running 6480 sub problems to find dead transitions.
[2024-05-22 17:18:33] [INFO ] Invariant cache hit.
[2024-05-22 17:18:33] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1843 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6480 unsolved
SMT process timed out in 34757ms, After SMT, problems are : Problem set: 0 solved, 6480 unsolved
Search for dead transitions found 0 dead transitions in 34804ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53354 ms. Remains : 1844/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-13
Product exploration explored 100000 steps with 495 reset in 861 ms.
Stack based approach found an accepted trace after 22920 steps with 115 reset with depth 184 and stack size 184 in 210 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-13 finished in 54505 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(G(p0))))'
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 293 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-22 17:19:10] [INFO ] Computed 42 invariants in 422 ms
[2024-05-22 17:19:12] [INFO ] Implicit Places using invariants in 2456 ms returned []
[2024-05-22 17:19:12] [INFO ] Invariant cache hit.
[2024-05-22 17:19:15] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-22 17:19:45] [INFO ] Performed 343/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 17:19:59] [INFO ] Implicit Places using invariants and state equation in 46784 ms returned []
Implicit Place search using SMT with State Equation took 49242 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-22 17:19:59] [INFO ] Invariant cache hit.
[2024-05-22 17:19:59] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38834ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 38904ms
Finished structural reductions in LTL mode , in 1 iterations and 88451 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-14 finished in 88644 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)) U G(p1)))'
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 3683 transition count 9563
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 3406 transition count 9562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1560 Post agglomeration using F-continuation condition.Transition count delta: 1560
Deduced a syphon composed of 1560 places in 3 ms
Reduce places removed 1560 places and 0 transitions.
Iterating global reduction 3 with 3120 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions (Redundant composition of simpler transitions.) removed 1482 transitions
Redundant transition composition rules discarded 1482 transitions
Iterating global reduction 3 with 1482 rules applied. Total rules applied 5158 place count 1845 transition count 6520
Applied a total of 5158 rules in 999 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1845 cols
[2024-05-22 17:20:39] [INFO ] Computed 42 invariants in 137 ms
[2024-05-22 17:20:40] [INFO ] Implicit Places using invariants in 1259 ms returned []
[2024-05-22 17:20:40] [INFO ] Invariant cache hit.
[2024-05-22 17:20:41] [INFO ] State equation strengthened by 4758 read => feed constraints.
[2024-05-22 17:20:57] [INFO ] Implicit Places using invariants and state equation in 16942 ms returned []
Implicit Place search using SMT with State Equation took 18202 ms to find 0 implicit places.
[2024-05-22 17:20:58] [INFO ] Redundant transitions in 673 ms returned []
Running 6480 sub problems to find dead transitions.
[2024-05-22 17:20:58] [INFO ] Invariant cache hit.
[2024-05-22 17:20:58] [INFO ] State equation strengthened by 4758 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6480 unsolved
SMT process timed out in 34800ms, After SMT, problems are : Problem set: 0 solved, 6480 unsolved
Search for dead transitions found 0 dead transitions in 34847ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54740 ms. Remains : 1845/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-15
Product exploration explored 100000 steps with 501 reset in 899 ms.
Product exploration explored 100000 steps with 502 reset in 935 ms.
Computed a total of 125 stabilizing places and 202 stable transitions
Computed a total of 125 stabilizing places and 202 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 120 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 62 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (195 resets) in 582 ms. (68 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
[2024-05-22 17:21:35] [INFO ] Invariant cache hit.
[2024-05-22 17:21:35] [INFO ] State equation strengthened by 4758 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1761/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:21:35] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-22 17:21:35] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1841 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:21:37] [INFO ] Deduced a trap composed of 54 places in 1455 ms of which 12 ms to minimize.
[2024-05-22 17:21:38] [INFO ] Deduced a trap composed of 59 places in 1400 ms of which 12 ms to minimize.
[2024-05-22 17:21:40] [INFO ] Deduced a trap composed of 46 places in 1375 ms of which 10 ms to minimize.
[2024-05-22 17:21:41] [INFO ] Deduced a trap composed of 48 places in 1326 ms of which 11 ms to minimize.
SMT process timed out in 6233ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6520/6520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6518
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6518
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1843 transition count 6517
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 1842 transition count 6517
Partial Free-agglomeration rule applied 1639 times.
Drop transitions (Partial Free agglomeration) removed 1639 transitions
Iterating global reduction 3 with 1639 rules applied. Total rules applied 1645 place count 1842 transition count 6517
Applied a total of 1645 rules in 591 ms. Remains 1842 /1845 variables (removed 3) and now considering 6517/6520 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 591 ms. Remains : 1842/1845 places, 6517/6520 transitions.
RANDOM walk for 40000 steps (216 resets) in 525 ms. (76 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 106933 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 1
Probabilistic random walk after 106933 steps, saw 28356 distinct states, run finished after 3003 ms. (steps per millisecond=35 ) properties seen :0
// Phase 1: matrix 6517 rows 1842 cols
[2024-05-22 17:21:45] [INFO ] Computed 42 invariants in 170 ms
[2024-05-22 17:21:45] [INFO ] State equation strengthened by 6396 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1760 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:21:45] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1760 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1760 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1838 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1838 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1840 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:21:47] [INFO ] Deduced a trap composed of 51 places in 1357 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1840 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1840 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6517/8357 variables, 1840/1884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8357 variables, 6396/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8357 variables, 0/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/8359 variables, 2/8282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8359 variables, 0/8282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/8359 variables, 0/8282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8359/8359 variables, and 8282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4204 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1842/1842 constraints, ReadFeed: 6396/6396 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1760 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1760 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:21:50] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-22 17:21:50] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 0 ms to minimize.
[2024-05-22 17:21:50] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-22 17:21:50] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-22 17:21:50] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-22 17:21:50] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 0 ms to minimize.
[2024-05-22 17:21:50] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-22 17:21:50] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 0 ms to minimize.
[2024-05-22 17:21:50] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-22 17:21:50] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
[2024-05-22 17:21:50] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-22 17:21:50] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-22 17:21:50] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
[2024-05-22 17:21:50] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
[2024-05-22 17:21:51] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-22 17:21:51] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
[2024-05-22 17:21:51] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-22 17:21:51] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-22 17:21:51] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-22 17:21:51] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1760 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:21:51] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-22 17:21:51] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-22 17:21:51] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-22 17:21:51] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-22 17:21:51] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-22 17:21:51] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-22 17:21:51] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-22 17:21:51] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-22 17:21:51] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-22 17:21:51] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-22 17:21:52] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-22 17:21:52] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-22 17:21:52] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-22 17:21:52] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-22 17:21:52] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-22 17:21:52] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-22 17:21:52] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1760 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1760 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 78/1838 variables, 39/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1838 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/1840 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1840 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:21:54] [INFO ] Deduced a trap composed of 47 places in 1419 ms of which 12 ms to minimize.
[2024-05-22 17:21:55] [INFO ] Deduced a trap composed of 52 places in 1409 ms of which 10 ms to minimize.
[2024-05-22 17:21:57] [INFO ] Deduced a trap composed of 62 places in 1448 ms of which 11 ms to minimize.
[2024-05-22 17:21:58] [INFO ] Deduced a trap composed of 83 places in 1484 ms of which 11 ms to minimize.
[2024-05-22 17:22:00] [INFO ] Deduced a trap composed of 63 places in 1471 ms of which 11 ms to minimize.
[2024-05-22 17:22:01] [INFO ] Deduced a trap composed of 51 places in 1437 ms of which 14 ms to minimize.
[2024-05-22 17:22:03] [INFO ] Deduced a trap composed of 58 places in 1439 ms of which 11 ms to minimize.
[2024-05-22 17:22:04] [INFO ] Deduced a trap composed of 47 places in 1447 ms of which 12 ms to minimize.
[2024-05-22 17:22:06] [INFO ] Deduced a trap composed of 49 places in 1455 ms of which 11 ms to minimize.
[2024-05-22 17:22:07] [INFO ] Deduced a trap composed of 61 places in 1422 ms of which 11 ms to minimize.
[2024-05-22 17:22:08] [INFO ] Deduced a trap composed of 64 places in 1465 ms of which 11 ms to minimize.
[2024-05-22 17:22:10] [INFO ] Deduced a trap composed of 48 places in 1470 ms of which 11 ms to minimize.
[2024-05-22 17:22:11] [INFO ] Deduced a trap composed of 59 places in 1419 ms of which 11 ms to minimize.
[2024-05-22 17:22:13] [INFO ] Deduced a trap composed of 56 places in 1460 ms of which 11 ms to minimize.
[2024-05-22 17:22:14] [INFO ] Deduced a trap composed of 52 places in 1402 ms of which 11 ms to minimize.
[2024-05-22 17:22:16] [INFO ] Deduced a trap composed of 81 places in 1466 ms of which 11 ms to minimize.
[2024-05-22 17:22:17] [INFO ] Deduced a trap composed of 93 places in 1458 ms of which 11 ms to minimize.
[2024-05-22 17:22:19] [INFO ] Deduced a trap composed of 62 places in 1424 ms of which 11 ms to minimize.
[2024-05-22 17:22:20] [INFO ] Deduced a trap composed of 48 places in 1401 ms of which 12 ms to minimize.
[2024-05-22 17:22:22] [INFO ] Deduced a trap composed of 57 places in 1447 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1840 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:22:23] [INFO ] Deduced a trap composed of 59 places in 1423 ms of which 13 ms to minimize.
[2024-05-22 17:22:25] [INFO ] Deduced a trap composed of 67 places in 1432 ms of which 11 ms to minimize.
[2024-05-22 17:22:26] [INFO ] Deduced a trap composed of 49 places in 1385 ms of which 11 ms to minimize.
[2024-05-22 17:22:27] [INFO ] Deduced a trap composed of 64 places in 1451 ms of which 12 ms to minimize.
[2024-05-22 17:22:29] [INFO ] Deduced a trap composed of 49 places in 1469 ms of which 11 ms to minimize.
[2024-05-22 17:22:30] [INFO ] Deduced a trap composed of 64 places in 1436 ms of which 11 ms to minimize.
[2024-05-22 17:22:32] [INFO ] Deduced a trap composed of 45 places in 1405 ms of which 11 ms to minimize.
[2024-05-22 17:22:33] [INFO ] Deduced a trap composed of 51 places in 1307 ms of which 10 ms to minimize.
[2024-05-22 17:22:35] [INFO ] Deduced a trap composed of 53 places in 1421 ms of which 11 ms to minimize.
SMT process timed out in 49822ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1842 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 226 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 215 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
[2024-05-22 17:22:35] [INFO ] Invariant cache hit.
[2024-05-22 17:22:37] [INFO ] Implicit Places using invariants in 1837 ms returned []
[2024-05-22 17:22:37] [INFO ] Invariant cache hit.
[2024-05-22 17:22:38] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2024-05-22 17:23:09] [INFO ] Performed 688/1842 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 17:23:39] [INFO ] Performed 1675/1842 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-22 17:23:43] [INFO ] Implicit Places using invariants and state equation in 66128 ms returned []
Implicit Place search using SMT with State Equation took 67967 ms to find 0 implicit places.
[2024-05-22 17:23:44] [INFO ] Redundant transitions in 510 ms returned []
Running 6477 sub problems to find dead transitions.
[2024-05-22 17:23:44] [INFO ] Invariant cache hit.
[2024-05-22 17:23:44] [INFO ] State equation strengthened by 6396 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1841 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6477 unsolved
SMT process timed out in 35985ms, After SMT, problems are : Problem set: 0 solved, 6477 unsolved
Search for dead transitions found 0 dead transitions in 36033ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104745 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 163 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 77 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p0)]
Support contains 4 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6520/6520 transitions.
Applied a total of 0 rules in 195 ms. Remains 1845 /1845 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
// Phase 1: matrix 6520 rows 1845 cols
[2024-05-22 17:24:20] [INFO ] Computed 42 invariants in 127 ms
[2024-05-22 17:24:21] [INFO ] Implicit Places using invariants in 1270 ms returned []
[2024-05-22 17:24:21] [INFO ] Invariant cache hit.
[2024-05-22 17:24:23] [INFO ] State equation strengthened by 4758 read => feed constraints.
[2024-05-22 17:24:38] [INFO ] Implicit Places using invariants and state equation in 16806 ms returned []
Implicit Place search using SMT with State Equation took 18076 ms to find 0 implicit places.
[2024-05-22 17:24:39] [INFO ] Redundant transitions in 470 ms returned []
Running 6480 sub problems to find dead transitions.
[2024-05-22 17:24:39] [INFO ] Invariant cache hit.
[2024-05-22 17:24:39] [INFO ] State equation strengthened by 4758 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 1.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 1.0)
(s652 1.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 0.0)
(s671 0.0)
(s672 1.0)
(s673 0.0)
(s674 1.0)
(s675 0.0)
(s676 1.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 1.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 1.0)
(s686 1.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 1.0)
(s691 0.0)
(s692 0.0)
(s693 1.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 1.0)
(s701 0.0)
(s702 1.0)
(s703 0.0)
(s704 1.0)
(s705 0.0)
(s706 1.0)
(s707 1.0)
(s708 0.0)
(s709 1.0)
(s710 0.0)
(s711 1.0)
(s712 0.0)
(s713 0.0)
(s714 1.0)
(s715 1.0)
(s716 0.0)
(s717 1.0)
(s718 0.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6480 unsolved
SMT process timed out in 35095ms, After SMT, problems are : Problem set: 0 solved, 6480 unsolved
Search for dead transitions found 0 dead transitions in 35143ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53900 ms. Remains : 1845/1845 places, 6520/6520 transitions.
Computed a total of 125 stabilizing places and 202 stable transitions
Computed a total of 125 stabilizing places and 202 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 129 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 78 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (195 resets) in 486 ms. (82 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
[2024-05-22 17:25:14] [INFO ] Invariant cache hit.
[2024-05-22 17:25:14] [INFO ] State equation strengthened by 4758 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1761/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:25:15] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
[2024-05-22 17:25:15] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1841 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:25:16] [INFO ] Deduced a trap composed of 54 places in 1477 ms of which 11 ms to minimize.
[2024-05-22 17:25:18] [INFO ] Deduced a trap composed of 59 places in 1386 ms of which 11 ms to minimize.
[2024-05-22 17:25:19] [INFO ] Deduced a trap composed of 46 places in 1345 ms of which 11 ms to minimize.
[2024-05-22 17:25:20] [INFO ] Deduced a trap composed of 48 places in 1290 ms of which 10 ms to minimize.
SMT process timed out in 6173ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6520/6520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6518
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6518
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1843 transition count 6517
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 1842 transition count 6517
Partial Free-agglomeration rule applied 1639 times.
Drop transitions (Partial Free agglomeration) removed 1639 transitions
Iterating global reduction 3 with 1639 rules applied. Total rules applied 1645 place count 1842 transition count 6517
Applied a total of 1645 rules in 593 ms. Remains 1842 /1845 variables (removed 3) and now considering 6517/6520 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 593 ms. Remains : 1842/1845 places, 6517/6520 transitions.
RANDOM walk for 40000 steps (215 resets) in 624 ms. (64 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 107025 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 1
Probabilistic random walk after 107025 steps, saw 28372 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
// Phase 1: matrix 6517 rows 1842 cols
[2024-05-22 17:25:24] [INFO ] Computed 42 invariants in 165 ms
[2024-05-22 17:25:24] [INFO ] State equation strengthened by 6396 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1760 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:25:25] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1760 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1760 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1838 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1838 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1840 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:25:26] [INFO ] Deduced a trap composed of 51 places in 1415 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1840 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1840 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6517/8357 variables, 1840/1884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8357 variables, 6396/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8357 variables, 0/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/8359 variables, 2/8282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8359 variables, 0/8282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/8359 variables, 0/8282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8359/8359 variables, and 8282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4178 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1842/1842 constraints, ReadFeed: 6396/6396 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1760 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1760 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:25:29] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-22 17:25:29] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-22 17:25:29] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-22 17:25:29] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-22 17:25:29] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-22 17:25:29] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-22 17:25:29] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-22 17:25:29] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-22 17:25:29] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-22 17:25:29] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-22 17:25:30] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 0 ms to minimize.
[2024-05-22 17:25:30] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-22 17:25:30] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-22 17:25:30] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-22 17:25:30] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-22 17:25:30] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-22 17:25:30] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-22 17:25:30] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-22 17:25:30] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 0 ms to minimize.
[2024-05-22 17:25:30] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1760 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:25:30] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-22 17:25:30] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-22 17:25:30] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-22 17:25:30] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-22 17:25:30] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-22 17:25:31] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-22 17:25:31] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-22 17:25:31] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-22 17:25:31] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-22 17:25:31] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-22 17:25:31] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-22 17:25:31] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-22 17:25:31] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-22 17:25:31] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-22 17:25:31] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-22 17:25:31] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 0 ms to minimize.
[2024-05-22 17:25:31] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1760 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1760 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 78/1838 variables, 39/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1838 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/1840 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1840 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:25:33] [INFO ] Deduced a trap composed of 47 places in 1425 ms of which 11 ms to minimize.
[2024-05-22 17:25:34] [INFO ] Deduced a trap composed of 52 places in 1422 ms of which 11 ms to minimize.
[2024-05-22 17:25:36] [INFO ] Deduced a trap composed of 62 places in 1464 ms of which 11 ms to minimize.
[2024-05-22 17:25:37] [INFO ] Deduced a trap composed of 83 places in 1488 ms of which 11 ms to minimize.
[2024-05-22 17:25:39] [INFO ] Deduced a trap composed of 63 places in 1483 ms of which 11 ms to minimize.
[2024-05-22 17:25:40] [INFO ] Deduced a trap composed of 51 places in 1358 ms of which 11 ms to minimize.
[2024-05-22 17:25:42] [INFO ] Deduced a trap composed of 58 places in 1491 ms of which 12 ms to minimize.
[2024-05-22 17:25:43] [INFO ] Deduced a trap composed of 47 places in 1462 ms of which 11 ms to minimize.
[2024-05-22 17:25:45] [INFO ] Deduced a trap composed of 49 places in 1489 ms of which 11 ms to minimize.
[2024-05-22 17:25:46] [INFO ] Deduced a trap composed of 61 places in 1485 ms of which 11 ms to minimize.
[2024-05-22 17:25:48] [INFO ] Deduced a trap composed of 64 places in 1500 ms of which 12 ms to minimize.
[2024-05-22 17:25:49] [INFO ] Deduced a trap composed of 48 places in 1430 ms of which 11 ms to minimize.
[2024-05-22 17:25:51] [INFO ] Deduced a trap composed of 59 places in 1392 ms of which 11 ms to minimize.
[2024-05-22 17:25:52] [INFO ] Deduced a trap composed of 56 places in 1393 ms of which 11 ms to minimize.
[2024-05-22 17:25:54] [INFO ] Deduced a trap composed of 52 places in 1490 ms of which 11 ms to minimize.
[2024-05-22 17:25:55] [INFO ] Deduced a trap composed of 81 places in 1478 ms of which 11 ms to minimize.
[2024-05-22 17:25:57] [INFO ] Deduced a trap composed of 93 places in 1454 ms of which 11 ms to minimize.
[2024-05-22 17:25:58] [INFO ] Deduced a trap composed of 62 places in 1417 ms of which 11 ms to minimize.
[2024-05-22 17:25:59] [INFO ] Deduced a trap composed of 48 places in 1389 ms of which 11 ms to minimize.
[2024-05-22 17:26:01] [INFO ] Deduced a trap composed of 57 places in 1413 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1840 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:26:02] [INFO ] Deduced a trap composed of 59 places in 1346 ms of which 11 ms to minimize.
[2024-05-22 17:26:04] [INFO ] Deduced a trap composed of 67 places in 1392 ms of which 11 ms to minimize.
[2024-05-22 17:26:05] [INFO ] Deduced a trap composed of 49 places in 1442 ms of which 12 ms to minimize.
[2024-05-22 17:26:07] [INFO ] Deduced a trap composed of 64 places in 1459 ms of which 11 ms to minimize.
[2024-05-22 17:26:08] [INFO ] Deduced a trap composed of 49 places in 1451 ms of which 11 ms to minimize.
[2024-05-22 17:26:10] [INFO ] Deduced a trap composed of 64 places in 1438 ms of which 11 ms to minimize.
[2024-05-22 17:26:11] [INFO ] Deduced a trap composed of 45 places in 1399 ms of which 12 ms to minimize.
[2024-05-22 17:26:13] [INFO ] Deduced a trap composed of 51 places in 1454 ms of which 11 ms to minimize.
[2024-05-22 17:26:14] [INFO ] Deduced a trap composed of 53 places in 1444 ms of which 11 ms to minimize.
SMT process timed out in 49776ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1842 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 212 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 212 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 206 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
[2024-05-22 17:26:14] [INFO ] Invariant cache hit.
[2024-05-22 17:26:16] [INFO ] Implicit Places using invariants in 1856 ms returned []
[2024-05-22 17:26:16] [INFO ] Invariant cache hit.
[2024-05-22 17:26:18] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2024-05-22 17:26:48] [INFO ] Performed 588/1842 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 17:27:18] [INFO ] Performed 1471/1842 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-22 17:27:29] [INFO ] Implicit Places using invariants and state equation in 73158 ms returned []
Implicit Place search using SMT with State Equation took 75017 ms to find 0 implicit places.
[2024-05-22 17:27:30] [INFO ] Redundant transitions in 517 ms returned []
Running 6477 sub problems to find dead transitions.
[2024-05-22 17:27:30] [INFO ] Invariant cache hit.
[2024-05-22 17:27:30] [INFO ] State equation strengthened by 6396 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1841 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6477 unsolved
SMT process timed out in 36028ms, After SMT, problems are : Problem set: 0 solved, 6477 unsolved
Search for dead transitions found 0 dead transitions in 36075ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111832 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 173 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 :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 498 reset in 927 ms.
Product exploration explored 100000 steps with 497 reset in 912 ms.
Support contains 4 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6520/6520 transitions.
Applied a total of 0 rules in 192 ms. Remains 1845 /1845 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
// Phase 1: matrix 6520 rows 1845 cols
[2024-05-22 17:28:09] [INFO ] Computed 42 invariants in 134 ms
[2024-05-22 17:28:10] [INFO ] Implicit Places using invariants in 1291 ms returned []
[2024-05-22 17:28:10] [INFO ] Invariant cache hit.
[2024-05-22 17:28:11] [INFO ] State equation strengthened by 4758 read => feed constraints.
[2024-05-22 17:28:27] [INFO ] Implicit Places using invariants and state equation in 16845 ms returned []
Implicit Place search using SMT with State Equation took 18136 ms to find 0 implicit places.
[2024-05-22 17:28:27] [INFO ] Redundant transitions in 479 ms returned []
Running 6480 sub problems to find dead transitions.
[2024-05-22 17:28:27] [INFO ] Invariant cache hit.
[2024-05-22 17:28:27] [INFO ] State equation strengthened by 4758 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6480 unsolved
SMT process timed out in 34918ms, After SMT, problems are : Problem set: 0 solved, 6480 unsolved
Search for dead transitions found 0 dead transitions in 34964ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53789 ms. Remains : 1845/1845 places, 6520/6520 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-15 finished in 504601 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 U (X(G(p1))||F((!p0&&X((F(p2)||G(!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' '!(G(F((G((G(p1) U p2))||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(X(F((p0&&G(F(p1)))))))'
Found a Shortening insensitive property : CANInsertWithFailure-PT-040-LTLCardinality-08
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 934 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2024-05-22 17:29:04] [INFO ] Computed 42 invariants in 175 ms
[2024-05-22 17:29:05] [INFO ] Implicit Places using invariants in 1357 ms returned []
[2024-05-22 17:29:05] [INFO ] Invariant cache hit.
[2024-05-22 17:29:07] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-22 17:29:23] [INFO ] Implicit Places using invariants and state equation in 17373 ms returned []
Implicit Place search using SMT with State Equation took 18731 ms to find 0 implicit places.
Running 6480 sub problems to find dead transitions.
[2024-05-22 17:29:23] [INFO ] Invariant cache hit.
[2024-05-22 17:29:23] [INFO ] State equation strengthened by 4757 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1843 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6480 unsolved
SMT process timed out in 34792ms, After SMT, problems are : Problem set: 0 solved, 6480 unsolved
Search for dead transitions found 0 dead transitions in 34839ms
Starting structural reductions in LI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 54511 ms. Remains : 1844/3683 places, 6520/9840 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-08
Product exploration explored 100000 steps with 494 reset in 850 ms.
Product exploration explored 100000 steps with 493 reset in 892 ms.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 25389 steps (122 resets) in 387 ms. (65 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 117 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 84 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 1844 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Applied a total of 0 rules in 200 ms. Remains 1844 /1844 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
[2024-05-22 17:30:00] [INFO ] Invariant cache hit.
[2024-05-22 17:30:01] [INFO ] Implicit Places using invariants in 1133 ms returned []
[2024-05-22 17:30:01] [INFO ] Invariant cache hit.
[2024-05-22 17:30:02] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-22 17:30:17] [INFO ] Implicit Places using invariants and state equation in 15678 ms returned []
Implicit Place search using SMT with State Equation took 16813 ms to find 0 implicit places.
[2024-05-22 17:30:17] [INFO ] Redundant transitions in 465 ms returned []
Running 6480 sub problems to find dead transitions.
[2024-05-22 17:30:17] [INFO ] Invariant cache hit.
[2024-05-22 17:30:17] [INFO ] State equation strengthened by 4757 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1843 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6480 unsolved
SMT process timed out in 34780ms, After SMT, problems are : Problem set: 0 solved, 6480 unsolved
Search for dead transitions found 0 dead transitions in 34826ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52322 ms. Remains : 1844/1844 places, 6520/6520 transitions.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
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 68 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 34867 steps (170 resets) in 352 ms. (98 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
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 93 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 490 reset in 857 ms.
Product exploration explored 100000 steps with 498 reset in 927 ms.
Support contains 1 out of 1844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Applied a total of 0 rules in 196 ms. Remains 1844 /1844 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
[2024-05-22 17:30:55] [INFO ] Invariant cache hit.
[2024-05-22 17:30:56] [INFO ] Implicit Places using invariants in 1148 ms returned []
[2024-05-22 17:30:56] [INFO ] Invariant cache hit.
[2024-05-22 17:30:57] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-22 17:31:11] [INFO ] Implicit Places using invariants and state equation in 15036 ms returned []
Implicit Place search using SMT with State Equation took 16185 ms to find 0 implicit places.
[2024-05-22 17:31:11] [INFO ] Redundant transitions in 468 ms returned []
Running 6480 sub problems to find dead transitions.
[2024-05-22 17:31:11] [INFO ] Invariant cache hit.
[2024-05-22 17:31:11] [INFO ] State equation strengthened by 4757 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1843 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6480 unsolved
SMT process timed out in 34760ms, After SMT, problems are : Problem set: 0 solved, 6480 unsolved
Search for dead transitions found 0 dead transitions in 34807ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51672 ms. Remains : 1844/1844 places, 6520/6520 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-08 finished in 163840 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)) U G(p1)))'
[2024-05-22 17:31:47] [INFO ] Flatten gal took : 200 ms
[2024-05-22 17:31:47] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-22 17:31:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3683 places, 9840 transitions and 26320 arcs took 44 ms.
Total runtime 3585005 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running CANInsertWithFailure-PT-040
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 3683
TRANSITIONS: 9840
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.152s, Sys 0.020s]
SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.025s, Sys 0.003s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 4142
MODEL NAME: /home/mcc/execution/411/model
3683 places, 9840 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
BK_TIME_CONFINEMENT_REACHED
--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
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="CANInsertWithFailure-PT-040"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is CANInsertWithFailure-PT-040, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r069-tall-171620503800123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-040.tgz
mv CANInsertWithFailure-PT-040 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;