Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r026-smll-171620167500348.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 itstools
Input is AutonomousCar-PT-09a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167500348
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 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 781K 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 AutonomousCar-PT-09a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-09a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716347858519

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-09a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 03:17:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 03:17:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 03:17:41] [INFO ] Load time of PNML (sax parser for PT used): 448 ms
[2024-05-22 03:17:41] [INFO ] Transformed 89 places.
[2024-05-22 03:17:41] [INFO ] Transformed 1249 transitions.
[2024-05-22 03:17:41] [INFO ] Found NUPN structural information;
[2024-05-22 03:17:41] [INFO ] Parsed PT model containing 89 places and 1249 transitions and 15631 arcs in 714 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 345 transitions
Reduce redundant transitions removed 345 transitions.
FORMULA AutonomousCar-PT-09a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 904/904 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 863
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 863
Applied a total of 10 rules in 55 ms. Remains 84 /89 variables (removed 5) and now considering 863/904 (removed 41) transitions.
// Phase 1: matrix 863 rows 84 cols
[2024-05-22 03:17:42] [INFO ] Computed 13 invariants in 36 ms
[2024-05-22 03:17:42] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-05-22 03:17:42] [INFO ] Invariant cache hit.
[2024-05-22 03:17:43] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-22 03:17:43] [INFO ] Implicit Places using invariants and state equation in 835 ms returned [80, 82]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1279 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/89 places, 863/904 transitions.
Applied a total of 0 rules in 11 ms. Remains 82 /82 variables (removed 0) and now considering 863/863 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1373 ms. Remains : 82/89 places, 863/904 transitions.
Support contains 39 out of 82 places after structural reductions.
[2024-05-22 03:17:44] [INFO ] Flatten gal took : 479 ms
[2024-05-22 03:17:44] [INFO ] Flatten gal took : 168 ms
[2024-05-22 03:17:44] [INFO ] Input system was already deterministic with 863 transitions.
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 40000 steps (1962 resets) in 3560 ms. (11 steps per ms) remains 9/18 properties
BEST_FIRST walk for 40004 steps (147 resets) in 300 ms. (132 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (108 resets) in 151 ms. (263 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (121 resets) in 393 ms. (101 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (146 resets) in 171 ms. (232 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40003 steps (120 resets) in 367 ms. (108 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (147 resets) in 184 ms. (216 steps per ms) remains 3/4 properties
// Phase 1: matrix 863 rows 82 cols
[2024-05-22 03:17:46] [INFO ] Computed 11 invariants in 27 ms
[2024-05-22 03:17:46] [INFO ] State equation strengthened by 291 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 25/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 38/73 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 854/927 variables, 73/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/927 variables, 290/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/927 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 13/940 variables, 5/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/940 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4/944 variables, 4/383 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/944 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/945 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/945 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/945 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 945/945 variables, and 384 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1064 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 82/82 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 25/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 38/73 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 854/927 variables, 73/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/927 variables, 290/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/927 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 13/940 variables, 5/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/940 variables, 3/382 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/940 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/944 variables, 4/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/944 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/945 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/945 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/945 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 945/945 variables, and 387 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 82/82 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 4433ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 24439 ms.
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 863/863 transitions.
Graph (complete) has 990 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.25 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 81 transition count 850
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 23 place count 72 transition count 849
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 71 transition count 849
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24 place count 71 transition count 848
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 70 transition count 848
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 30 place count 66 transition count 817
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 66 transition count 817
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 40 place count 63 transition count 814
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 48 place count 63 transition count 806
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 71 rules applied. Total rules applied 119 place count 55 transition count 743
Applied a total of 119 rules in 344 ms. Remains 55 /82 variables (removed 27) and now considering 743/863 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 345 ms. Remains : 55/82 places, 743/863 transitions.
RANDOM walk for 40000 steps (60 resets) in 962 ms. (41 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (130 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (115 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (77 resets) in 149 ms. (266 steps per ms) remains 2/3 properties
// Phase 1: matrix 743 rows 55 cols
[2024-05-22 03:18:16] [INFO ] Computed 13 invariants in 6 ms
[2024-05-22 03:18:16] [INFO ] State equation strengthened by 199 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/55 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 743/798 variables, 55/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 199/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/798 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/798 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 798/798 variables, and 267 constraints, problems are : Problem set: 0 solved, 2 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 55/55 constraints, ReadFeed: 199/199 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/55 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 743/798 variables, 55/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 199/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/798 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/798 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/798 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 798/798 variables, and 269 constraints, problems are : Problem set: 0 solved, 2 unsolved in 775 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 55/55 constraints, ReadFeed: 199/199 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1235ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1142 ms.
Support contains 6 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 743/743 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 741
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 53 transition count 723
Applied a total of 22 rules in 189 ms. Remains 53 /55 variables (removed 2) and now considering 723/743 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 53/55 places, 723/743 transitions.
RANDOM walk for 40000 steps (11 resets) in 1200 ms. (33 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (175 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (173 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1102238 steps, run timeout after 3001 ms. (steps per millisecond=367 ) properties seen :1 out of 2
Probabilistic random walk after 1102238 steps, saw 132762 distinct states, run finished after 3006 ms. (steps per millisecond=366 ) properties seen :1
// Phase 1: matrix 723 rows 53 cols
[2024-05-22 03:18:22] [INFO ] Computed 13 invariants in 7 ms
[2024-05-22 03:18:22] [INFO ] State equation strengthened by 181 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/53 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 723/776 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/776 variables, 181/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/776 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/776 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 776/776 variables, and 247 constraints, problems are : Problem set: 0 solved, 1 unsolved in 719 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 53/53 constraints, ReadFeed: 181/181 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/53 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 723/776 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/776 variables, 181/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/776 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/776 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/776 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 776/776 variables, and 248 constraints, problems are : Problem set: 0 solved, 1 unsolved in 917 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 53/53 constraints, ReadFeed: 181/181 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1706ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 265 ms.
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 723/723 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 52 transition count 713
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 52 transition count 713
Applied a total of 2 rules in 85 ms. Remains 52 /53 variables (removed 1) and now considering 713/723 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 52/53 places, 713/723 transitions.
RANDOM walk for 40000 steps (12 resets) in 1151 ms. (34 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (173 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 948706 steps, run timeout after 3001 ms. (steps per millisecond=316 ) properties seen :0 out of 1
Probabilistic random walk after 948706 steps, saw 115481 distinct states, run finished after 3001 ms. (steps per millisecond=316 ) properties seen :0
// Phase 1: matrix 713 rows 52 cols
[2024-05-22 03:18:27] [INFO ] Computed 13 invariants in 7 ms
[2024-05-22 03:18:27] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/52 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 713/765 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 172/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/765 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 765/765 variables, and 237 constraints, problems are : Problem set: 0 solved, 1 unsolved in 486 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 52/52 constraints, ReadFeed: 172/172 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/52 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 713/765 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 172/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/765 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/765 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 765/765 variables, and 238 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 52/52 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1545ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 256 ms.
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 713/713 transitions.
Applied a total of 0 rules in 58 ms. Remains 52 /52 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 52/52 places, 713/713 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 713/713 transitions.
Applied a total of 0 rules in 56 ms. Remains 52 /52 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2024-05-22 03:18:29] [INFO ] Invariant cache hit.
[2024-05-22 03:18:30] [INFO ] Implicit Places using invariants in 505 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 513 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 51/52 places, 713/713 transitions.
Applied a total of 0 rules in 68 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 639 ms. Remains : 51/52 places, 713/713 transitions.
RANDOM walk for 40000 steps (11 resets) in 1403 ms. (28 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (175 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1047003 steps, run timeout after 3001 ms. (steps per millisecond=348 ) properties seen :0 out of 1
Probabilistic random walk after 1047003 steps, saw 126220 distinct states, run finished after 3001 ms. (steps per millisecond=348 ) properties seen :0
// Phase 1: matrix 713 rows 51 cols
[2024-05-22 03:18:33] [INFO ] Computed 12 invariants in 9 ms
[2024-05-22 03:18:33] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/51 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 713/764 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 172/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/764 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/764 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 764/764 variables, and 235 constraints, problems are : Problem set: 0 solved, 1 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 51/51 constraints, ReadFeed: 172/172 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/51 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 713/764 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 172/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/764 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/764 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/764 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 764/764 variables, and 236 constraints, problems are : Problem set: 0 solved, 1 unsolved in 907 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 51/51 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1356ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 290 ms.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 60 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 51/51 places, 713/713 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 60 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2024-05-22 03:18:35] [INFO ] Invariant cache hit.
[2024-05-22 03:18:36] [INFO ] Implicit Places using invariants in 498 ms returned []
[2024-05-22 03:18:36] [INFO ] Invariant cache hit.
[2024-05-22 03:18:36] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-22 03:18:36] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1389 ms to find 0 implicit places.
[2024-05-22 03:18:37] [INFO ] Redundant transitions in 79 ms returned []
Running 712 sub problems to find dead transitions.
[2024-05-22 03:18:37] [INFO ] Invariant cache hit.
[2024-05-22 03:18:37] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-22 03:19:01] [INFO ] Deduced a trap composed of 21 places in 802 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 4 (OVERLAPS) 713/764 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 172/236 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 764/764 variables, and 236 constraints, problems are : Problem set: 0 solved, 712 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 51/51 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 712/712 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 712 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 4 (OVERLAPS) 713/764 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 172/236 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 764/764 variables, and 948 constraints, problems are : Problem set: 0 solved, 712 unsolved in 32819 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 51/51 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 712/712 constraints, Known Traps: 1/1 constraints]
After SMT, in 78519ms problems are : Problem set: 0 solved, 712 unsolved
Search for dead transitions found 0 dead transitions in 78547ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80098 ms. Remains : 51/51 places, 713/713 transitions.
Computed a total of 3 stabilizing places and 2 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' '!(F(G(p0)))'
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 82 transition count 854
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 73 transition count 854
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 73 transition count 852
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 71 transition count 852
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 66 transition count 802
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 66 transition count 802
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 65 transition count 801
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 64 transition count 801
Applied a total of 36 rules in 334 ms. Remains 64 /82 variables (removed 18) and now considering 801/863 (removed 62) transitions.
// Phase 1: matrix 801 rows 64 cols
[2024-05-22 03:19:56] [INFO ] Computed 11 invariants in 10 ms
[2024-05-22 03:19:56] [INFO ] Implicit Places using invariants in 385 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 388 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/82 places, 801/863 transitions.
Applied a total of 0 rules in 96 ms. Remains 63 /63 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 818 ms. Remains : 63/82 places, 801/863 transitions.
Stuttering acceptance computed with spot in 288 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-00
Product exploration explored 100000 steps with 231 reset in 404 ms.
Product exploration explored 100000 steps with 252 reset in 212 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
RANDOM walk for 30418 steps (1791 resets) in 673 ms. (45 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Support contains 10 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 801/801 transitions.
Applied a total of 0 rules in 59 ms. Remains 63 /63 variables (removed 0) and now considering 801/801 (removed 0) transitions.
// Phase 1: matrix 801 rows 63 cols
[2024-05-22 03:19:58] [INFO ] Computed 10 invariants in 5 ms
[2024-05-22 03:19:58] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-22 03:19:58] [INFO ] Invariant cache hit.
[2024-05-22 03:19:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:19:59] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
[2024-05-22 03:19:59] [INFO ] Redundant transitions in 162 ms returned []
Running 800 sub problems to find dead transitions.
[2024-05-22 03:19:59] [INFO ] Invariant cache hit.
[2024-05-22 03:19:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 3 (OVERLAPS) 800/863 variables, 63/73 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 863/864 variables, and 73 constraints, problems are : Problem set: 0 solved, 800 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 63/63 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 800/800 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 800 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 3 (OVERLAPS) 800/863 variables, 63/73 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 863/864 variables, and 873 constraints, problems are : Problem set: 0 solved, 800 unsolved in 31834 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 63/63 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 800/800 constraints, Known Traps: 0/0 constraints]
After SMT, in 78666ms problems are : Problem set: 0 solved, 800 unsolved
Search for dead transitions found 0 dead transitions in 78681ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 79664 ms. Remains : 63/63 places, 801/801 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2355 resets) in 674 ms. (59 steps per ms) remains 1/1 properties
BEST_FIRST walk for 26383 steps (106 resets) in 211 ms. (124 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 369 reset in 156 ms.
Product exploration explored 100000 steps with 1100 reset in 498 ms.
Built C files in :
/tmp/ltsmin11570614303069205179
[2024-05-22 03:21:19] [INFO ] Computing symmetric may disable matrix : 801 transitions.
[2024-05-22 03:21:19] [INFO ] Computation of Complete disable matrix. took 121 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:21:19] [INFO ] Computing symmetric may enable matrix : 801 transitions.
[2024-05-22 03:21:19] [INFO ] Computation of Complete enable matrix. took 42 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:21:19] [INFO ] Computing Do-Not-Accords matrix : 801 transitions.
[2024-05-22 03:21:19] [INFO ] Computation of Completed DNA matrix. took 53 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:21:19] [INFO ] Built C files in 490ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11570614303069205179
Running compilation step : cd /tmp/ltsmin11570614303069205179;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11570614303069205179;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11570614303069205179;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 10 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 801/801 transitions.
Applied a total of 0 rules in 44 ms. Remains 63 /63 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2024-05-22 03:21:23] [INFO ] Invariant cache hit.
[2024-05-22 03:21:23] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-22 03:21:23] [INFO ] Invariant cache hit.
[2024-05-22 03:21:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:21:23] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2024-05-22 03:21:23] [INFO ] Redundant transitions in 28 ms returned []
Running 800 sub problems to find dead transitions.
[2024-05-22 03:21:23] [INFO ] Invariant cache hit.
[2024-05-22 03:21:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 3 (OVERLAPS) 800/863 variables, 63/73 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 863/864 variables, and 73 constraints, problems are : Problem set: 0 solved, 800 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 63/63 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 800/800 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 800 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 3 (OVERLAPS) 800/863 variables, 63/73 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 863/864 variables, and 873 constraints, problems are : Problem set: 0 solved, 800 unsolved in 32901 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 63/63 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 800/800 constraints, Known Traps: 0/0 constraints]
After SMT, in 77486ms problems are : Problem set: 0 solved, 800 unsolved
Search for dead transitions found 0 dead transitions in 77496ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 78209 ms. Remains : 63/63 places, 801/801 transitions.
Built C files in :
/tmp/ltsmin2755751392528641001
[2024-05-22 03:22:41] [INFO ] Computing symmetric may disable matrix : 801 transitions.
[2024-05-22 03:22:41] [INFO ] Computation of Complete disable matrix. took 169 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:22:41] [INFO ] Computing symmetric may enable matrix : 801 transitions.
[2024-05-22 03:22:41] [INFO ] Computation of Complete enable matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:22:41] [INFO ] Computing Do-Not-Accords matrix : 801 transitions.
[2024-05-22 03:22:41] [INFO ] Computation of Completed DNA matrix. took 60 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:22:41] [INFO ] Built C files in 601ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2755751392528641001
Running compilation step : cd /tmp/ltsmin2755751392528641001;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2755751392528641001;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2755751392528641001;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-22 03:22:45] [INFO ] Flatten gal took : 193 ms
[2024-05-22 03:22:45] [INFO ] Flatten gal took : 235 ms
[2024-05-22 03:22:45] [INFO ] Time to serialize gal into /tmp/LTL15907968661087918454.gal : 70 ms
[2024-05-22 03:22:45] [INFO ] Time to serialize properties into /tmp/LTL903785866678009721.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15907968661087918454.gal' '-t' 'CGAL' '-hoa' '/tmp/aut490809064785073548.hoa' '-atoms' '/tmp/LTL903785866678009721.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL903785866678009721.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut490809064785073548.hoa
Detected timeout of ITS tools.
[2024-05-22 03:23:00] [INFO ] Flatten gal took : 115 ms
[2024-05-22 03:23:00] [INFO ] Flatten gal took : 121 ms
[2024-05-22 03:23:00] [INFO ] Time to serialize gal into /tmp/LTL4535936384251245574.gal : 28 ms
[2024-05-22 03:23:00] [INFO ] Time to serialize properties into /tmp/LTL17275768127276250375.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4535936384251245574.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17275768127276250375.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((p19==0)||(p23==0))||((p33==0)||(p37==0)))||(((p47==0)||(p51==0))||((p61==0)||(p65==0))))||((p72==0)||(p82==0)))"))))
Formula 0 simplified : GF!"(((((p19==0)||(p23==0))||((p33==0)||(p37==0)))||(((p47==0)||(p51==0))||((p61==0)||(p65==0))))||((p72==0)||(p82==0)))"
Detected timeout of ITS tools.
[2024-05-22 03:23:16] [INFO ] Flatten gal took : 175 ms
[2024-05-22 03:23:16] [INFO ] Applying decomposition
[2024-05-22 03:23:16] [INFO ] Flatten gal took : 174 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13991215567352080055.txt' '-o' '/tmp/graph13991215567352080055.bin' '-w' '/tmp/graph13991215567352080055.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13991215567352080055.bin' '-l' '-1' '-v' '-w' '/tmp/graph13991215567352080055.weights' '-q' '0' '-e' '0.001'
[2024-05-22 03:23:17] [INFO ] Decomposing Gal with order
[2024-05-22 03:23:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 03:23:17] [INFO ] Removed a total of 5811 redundant transitions.
[2024-05-22 03:23:17] [INFO ] Flatten gal took : 560 ms
[2024-05-22 03:23:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 91 ms.
[2024-05-22 03:23:17] [INFO ] Time to serialize gal into /tmp/LTL14774403546193844614.gal : 12 ms
[2024-05-22 03:23:17] [INFO ] Time to serialize properties into /tmp/LTL3197154984080536030.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14774403546193844614.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3197154984080536030.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((u1.p19==0)||(i0.u2.p23==0))||((u5.p33==0)||(i0.u6.p37==0)))||(((u9.p47==0)||(i0.u10.p51==0))||((u13.p61==0)||(i0.u14.p65=...202
Formula 0 simplified : GF!"(((((u1.p19==0)||(i0.u2.p23==0))||((u5.p33==0)||(i0.u6.p37==0)))||(((u9.p47==0)||(i0.u10.p51==0))||((u13.p61==0)||(i0.u14.p65==0...196
Reverse transition relation is NOT exact ! Due to transitions t339, t340, t341, t342, t343, t344, t345, t346, t347, t348, t349, t350, t351, t352, t353, t35...1937
Computing Next relation with stutter on 393130 deadlock states
Detected timeout of ITS tools.
Treatment of property AutonomousCar-PT-09a-LTLFireability-00 finished in 217050 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((X((G(p1)||X(G(p2))))||p0))))'
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 78 transition count 823
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 78 transition count 823
Applied a total of 8 rules in 13 ms. Remains 78 /82 variables (removed 4) and now considering 823/863 (removed 40) transitions.
// Phase 1: matrix 823 rows 78 cols
[2024-05-22 03:23:32] [INFO ] Computed 11 invariants in 5 ms
[2024-05-22 03:23:33] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-22 03:23:33] [INFO ] Invariant cache hit.
[2024-05-22 03:23:33] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-22 03:23:34] [INFO ] Implicit Places using invariants and state equation in 811 ms returned []
Implicit Place search using SMT with State Equation took 1219 ms to find 0 implicit places.
Running 822 sub problems to find dead transitions.
[2024-05-22 03:23:34] [INFO ] Invariant cache hit.
[2024-05-22 03:23:34] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 3 (OVERLAPS) 822/900 variables, 78/89 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/900 variables, 254/343 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 03:24:16] [INFO ] Deduced a trap composed of 15 places in 901 ms of which 3 ms to minimize.
[2024-05-22 03:24:16] [INFO ] Deduced a trap composed of 22 places in 872 ms of which 2 ms to minimize.
[2024-05-22 03:24:17] [INFO ] Deduced a trap composed of 7 places in 862 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 900/901 variables, and 346 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 78/78 constraints, ReadFeed: 254/255 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 4 (OVERLAPS) 822/900 variables, 78/92 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/900 variables, 254/346 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 900/901 variables, and 1168 constraints, problems are : Problem set: 0 solved, 822 unsolved in 33018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 78/78 constraints, ReadFeed: 254/255 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 3/3 constraints]
After SMT, in 79102ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 79122ms
Starting structural reductions in LTL mode, iteration 1 : 78/82 places, 823/863 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80364 ms. Remains : 78/82 places, 823/863 transitions.
Stuttering acceptance computed with spot in 300 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-02
Product exploration explored 100000 steps with 1431 reset in 654 ms.
Product exploration explored 100000 steps with 474 reset in 201 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (1917 resets) in 1098 ms. (36 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (143 resets) in 240 ms. (165 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (110 resets) in 511 ms. (78 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (115 resets) in 381 ms. (104 steps per ms) remains 3/3 properties
[2024-05-22 03:24:55] [INFO ] Invariant cache hit.
[2024-05-22 03:24:55] [INFO ] State equation strengthened by 255 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 15/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 48/69 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 814/883 variables, 69/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/883 variables, 254/334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/883 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 13/896 variables, 5/339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/896 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4/900 variables, 4/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/900 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/901 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/901 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/901 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 901/901 variables, and 344 constraints, problems are : Problem set: 0 solved, 3 unsolved in 546 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 78/78 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 15/21 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/69 variables, 8/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 814/883 variables, 69/80 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/883 variables, 254/334 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/883 variables, 0/334 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 13/896 variables, 5/339 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/896 variables, 2/341 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/896 variables, 0/341 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/900 variables, 4/345 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/900 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/901 variables, 1/346 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/901 variables, 0/346 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/901 variables, 0/346 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 901/901 variables, and 346 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1830 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 78/78 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2493ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7852 ms.
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 823/823 transitions.
Graph (complete) has 946 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 77 transition count 808
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 26 place count 66 transition count 808
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 66 transition count 807
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 65 transition count 807
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 64 transition count 806
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 64 transition count 806
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 61 transition count 803
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 45 place count 61 transition count 794
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 135 place count 52 transition count 713
Applied a total of 135 rules in 125 ms. Remains 52 /78 variables (removed 26) and now considering 713/823 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 52/78 places, 713/823 transitions.
RANDOM walk for 40000 steps (10 resets) in 1874 ms. (21 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (175 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (171 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 559570 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 2
Probabilistic random walk after 559570 steps, saw 69258 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :0
// Phase 1: matrix 713 rows 52 cols
[2024-05-22 03:25:09] [INFO ] Computed 13 invariants in 6 ms
[2024-05-22 03:25:09] [INFO ] State equation strengthened by 172 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/52 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 713/765 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 172/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/765 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 765/765 variables, and 237 constraints, problems are : Problem set: 0 solved, 2 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 52/52 constraints, ReadFeed: 172/172 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/52 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 713/765 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 172/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/765 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/765 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 765/765 variables, and 239 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1066 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 52/52 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1477ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 289 ms.
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 713/713 transitions.
Applied a total of 0 rules in 34 ms. Remains 52 /52 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 52/52 places, 713/713 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 713/713 transitions.
Applied a total of 0 rules in 34 ms. Remains 52 /52 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2024-05-22 03:25:11] [INFO ] Invariant cache hit.
[2024-05-22 03:25:12] [INFO ] Implicit Places using invariants in 433 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 435 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 51/52 places, 713/713 transitions.
Applied a total of 0 rules in 35 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 505 ms. Remains : 51/52 places, 713/713 transitions.
RANDOM walk for 40000 steps (9 resets) in 1497 ms. (26 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (173 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (171 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 618477 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :0 out of 2
Probabilistic random walk after 618477 steps, saw 75980 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
// Phase 1: matrix 713 rows 51 cols
[2024-05-22 03:25:15] [INFO ] Computed 12 invariants in 3 ms
[2024-05-22 03:25:15] [INFO ] State equation strengthened by 172 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/51 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 713/764 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 172/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/764 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/764 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 764/764 variables, and 235 constraints, problems are : Problem set: 0 solved, 2 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 51/51 constraints, ReadFeed: 172/172 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/51 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 713/764 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 172/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/764 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/764 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/764 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 764/764 variables, and 237 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1120 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 51/51 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1457ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 291 ms.
Support contains 6 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 44 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 51/51 places, 713/713 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 36 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2024-05-22 03:25:17] [INFO ] Invariant cache hit.
[2024-05-22 03:25:18] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-22 03:25:18] [INFO ] Invariant cache hit.
[2024-05-22 03:25:18] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-22 03:25:18] [INFO ] Implicit Places using invariants and state equation in 916 ms returned []
Implicit Place search using SMT with State Equation took 1259 ms to find 0 implicit places.
[2024-05-22 03:25:18] [INFO ] Redundant transitions in 50 ms returned []
Running 712 sub problems to find dead transitions.
[2024-05-22 03:25:19] [INFO ] Invariant cache hit.
[2024-05-22 03:25:19] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-22 03:25:42] [INFO ] Deduced a trap composed of 21 places in 603 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 4 (OVERLAPS) 713/764 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 172/236 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 764/764 variables, and 236 constraints, problems are : Problem set: 0 solved, 712 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 51/51 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 712/712 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 712 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 4 (OVERLAPS) 713/764 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 172/236 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 764/764 variables, and 948 constraints, problems are : Problem set: 0 solved, 712 unsolved in 32137 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 51/51 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 712/712 constraints, Known Traps: 1/1 constraints]
After SMT, in 78268ms problems are : Problem set: 0 solved, 712 unsolved
Search for dead transitions found 0 dead transitions in 78282ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79637 ms. Remains : 51/51 places, 713/713 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (X p0)), (X (X p1)), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT (AND p2 p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 255 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 400 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 299 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 823/823 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 823/823 (removed 0) transitions.
// Phase 1: matrix 823 rows 78 cols
[2024-05-22 03:26:38] [INFO ] Computed 11 invariants in 7 ms
[2024-05-22 03:26:38] [INFO ] Implicit Places using invariants in 537 ms returned []
[2024-05-22 03:26:38] [INFO ] Invariant cache hit.
[2024-05-22 03:26:39] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-22 03:26:39] [INFO ] Implicit Places using invariants and state equation in 1031 ms returned []
Implicit Place search using SMT with State Equation took 1586 ms to find 0 implicit places.
Running 822 sub problems to find dead transitions.
[2024-05-22 03:26:39] [INFO ] Invariant cache hit.
[2024-05-22 03:26:39] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 3 (OVERLAPS) 822/900 variables, 78/89 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/900 variables, 254/343 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 03:27:18] [INFO ] Deduced a trap composed of 15 places in 535 ms of which 1 ms to minimize.
[2024-05-22 03:27:18] [INFO ] Deduced a trap composed of 22 places in 702 ms of which 2 ms to minimize.
[2024-05-22 03:27:19] [INFO ] Deduced a trap composed of 7 places in 687 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 900/901 variables, and 346 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 78/78 constraints, ReadFeed: 254/255 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 4 (OVERLAPS) 822/900 variables, 78/92 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/900 variables, 254/346 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 900/901 variables, and 1168 constraints, problems are : Problem set: 0 solved, 822 unsolved in 31808 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 78/78 constraints, ReadFeed: 254/255 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 3/3 constraints]
After SMT, in 78428ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 78445ms
Finished structural reductions in LTL mode , in 1 iterations and 80038 ms. Remains : 78/78 places, 823/823 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (1960 resets) in 734 ms. (54 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (115 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
[2024-05-22 03:27:58] [INFO ] Invariant cache hit.
[2024-05-22 03:27:58] [INFO ] State equation strengthened by 255 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/69 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 814/883 variables, 69/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/883 variables, 254/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/883 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 13/896 variables, 5/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/896 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/900 variables, 4/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/900 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/901 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/901 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/901 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 901/901 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 436 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 78/78 constraints, ReadFeed: 255/255 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/69 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 814/883 variables, 69/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/883 variables, 254/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/883 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 13/896 variables, 5/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/896 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/896 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/900 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/900 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/901 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/901 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/901 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 901/901 variables, and 345 constraints, problems are : Problem set: 0 solved, 1 unsolved in 880 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 78/78 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1358ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3830 ms.
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 823/823 transitions.
Graph (complete) has 946 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 77 transition count 808
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 26 place count 66 transition count 808
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 66 transition count 807
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 65 transition count 807
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 64 transition count 806
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 64 transition count 806
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 61 transition count 803
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 45 place count 61 transition count 794
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 135 place count 52 transition count 713
Applied a total of 135 rules in 119 ms. Remains 52 /78 variables (removed 26) and now considering 713/823 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 52/78 places, 713/823 transitions.
RANDOM walk for 40000 steps (12 resets) in 494 ms. (80 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (173 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 973614 steps, run timeout after 3001 ms. (steps per millisecond=324 ) properties seen :0 out of 1
Probabilistic random walk after 973614 steps, saw 117395 distinct states, run finished after 3004 ms. (steps per millisecond=324 ) properties seen :0
// Phase 1: matrix 713 rows 52 cols
[2024-05-22 03:28:07] [INFO ] Computed 13 invariants in 3 ms
[2024-05-22 03:28:07] [INFO ] State equation strengthened by 172 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/52 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 713/765 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 172/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/765 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 765/765 variables, and 237 constraints, problems are : Problem set: 0 solved, 1 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 52/52 constraints, ReadFeed: 172/172 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/52 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 713/765 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 172/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/765 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/765 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 765/765 variables, and 238 constraints, problems are : Problem set: 0 solved, 1 unsolved in 757 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 52/52 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1066ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 299 ms.
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 713/713 transitions.
Applied a total of 0 rules in 58 ms. Remains 52 /52 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 52/52 places, 713/713 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 713/713 transitions.
Applied a total of 0 rules in 58 ms. Remains 52 /52 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2024-05-22 03:28:08] [INFO ] Invariant cache hit.
[2024-05-22 03:28:09] [INFO ] Implicit Places using invariants in 378 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 381 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 51/52 places, 713/713 transitions.
Applied a total of 0 rules in 64 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 509 ms. Remains : 51/52 places, 713/713 transitions.
RANDOM walk for 40000 steps (12 resets) in 901 ms. (44 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (172 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 904454 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :0 out of 1
Probabilistic random walk after 904454 steps, saw 109791 distinct states, run finished after 3004 ms. (steps per millisecond=301 ) properties seen :0
// Phase 1: matrix 713 rows 51 cols
[2024-05-22 03:28:12] [INFO ] Computed 12 invariants in 3 ms
[2024-05-22 03:28:12] [INFO ] State equation strengthened by 172 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/51 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 713/764 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 172/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/764 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/764 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 764/764 variables, and 235 constraints, problems are : Problem set: 0 solved, 1 unsolved in 431 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 51/51 constraints, ReadFeed: 172/172 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/51 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 713/764 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 172/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/764 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/764 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/764 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 764/764 variables, and 236 constraints, problems are : Problem set: 0 solved, 1 unsolved in 739 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 51/51 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1201ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 316 ms.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 57 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 51/51 places, 713/713 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 713/713 transitions.
Applied a total of 0 rules in 58 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2024-05-22 03:28:14] [INFO ] Invariant cache hit.
[2024-05-22 03:28:14] [INFO ] Implicit Places using invariants in 462 ms returned []
[2024-05-22 03:28:14] [INFO ] Invariant cache hit.
[2024-05-22 03:28:15] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-22 03:28:15] [INFO ] Implicit Places using invariants and state equation in 993 ms returned []
Implicit Place search using SMT with State Equation took 1495 ms to find 0 implicit places.
[2024-05-22 03:28:15] [INFO ] Redundant transitions in 22 ms returned []
Running 712 sub problems to find dead transitions.
[2024-05-22 03:28:15] [INFO ] Invariant cache hit.
[2024-05-22 03:28:15] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 712 unsolved
[2024-05-22 03:28:39] [INFO ] Deduced a trap composed of 21 places in 736 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 4 (OVERLAPS) 713/764 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 172/236 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 764/764 variables, and 236 constraints, problems are : Problem set: 0 solved, 712 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 51/51 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 712/712 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 712 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 4 (OVERLAPS) 713/764 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 172/236 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 764/764 variables, and 948 constraints, problems are : Problem set: 0 solved, 712 unsolved in 32321 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 51/51 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 712/712 constraints, Known Traps: 1/1 constraints]
After SMT, in 77139ms problems are : Problem set: 0 solved, 712 unsolved
Search for dead transitions found 0 dead transitions in 77154ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78752 ms. Remains : 51/51 places, 713/713 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 47 ms. Remains 51 /51 variables (removed 0) and now considering 713/713 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 03:29:33] [INFO ] Invariant cache hit.
[2024-05-22 03:29:33] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 03:29:33] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-22 03:29:33] [INFO ] After 393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 03:29:33] [INFO ] After 562ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 03:29:33] [INFO ] After 729ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 841 ms.
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p2 p1)))]
Knowledge based reduction with 4 factoid took 154 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 243 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 333 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 351 reset in 180 ms.
Product exploration explored 100000 steps with 201 reset in 158 ms.
Applying partial POR strategy [true, true, true, false, false, false, false]
Stuttering acceptance computed with spot in 331 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 823/823 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 78 transition count 823
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 11 place count 78 transition count 825
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 78 transition count 825
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 78 transition count 825
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 77 transition count 824
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 77 transition count 824
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 77 transition count 827
Deduced a syphon composed of 14 places in 0 ms
Applied a total of 17 rules in 181 ms. Remains 77 /78 variables (removed 1) and now considering 827/823 (removed -4) transitions.
[2024-05-22 03:29:36] [INFO ] Redundant transitions in 48 ms returned []
Running 826 sub problems to find dead transitions.
// Phase 1: matrix 827 rows 77 cols
[2024-05-22 03:29:36] [INFO ] Computed 11 invariants in 5 ms
[2024-05-22 03:29:36] [INFO ] State equation strengthened by 259 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 826 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 826 unsolved
[2024-05-22 03:30:01] [INFO ] Deduced a trap composed of 6 places in 741 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-22 03:30:01] [INFO ] Deduced a trap composed of 6 places in 545 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-22 03:30:02] [INFO ] Deduced a trap composed of 6 places in 617 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-22 03:30:03] [INFO ] Deduced a trap composed of 6 places in 644 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-22 03:30:03] [INFO ] Deduced a trap composed of 6 places in 605 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-22 03:30:04] [INFO ] Deduced a trap composed of 6 places in 525 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-22 03:30:04] [INFO ] Deduced a trap composed of 6 places in 502 ms of which 2 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-05-22 03:30:05] [INFO ] Deduced a trap composed of 7 places in 608 ms of which 2 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-22 03:30:05] [INFO ] Deduced a trap composed of 6 places in 437 ms of which 3 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-22 03:30:06] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 10/21 constraints. Problems are: Problem set: 10 solved, 816 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/21 constraints. Problems are: Problem set: 10 solved, 816 unsolved
SMT process timed out in 48518ms, After SMT, problems are : Problem set: 10 solved, 816 unsolved
Search for dead transitions found 10 dead transitions in 48544ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 77/78 places, 817/823 transitions.
Graph (complete) has 990 edges and 77 vertex of which 67 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.5 ms
Discarding 10 places :
Also discarding 0 output transitions
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 1 rules in 145 ms. Remains 67 /77 variables (removed 10) and now considering 817/817 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/78 places, 817/823 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48934 ms. Remains : 67/78 places, 817/823 transitions.
Built C files in :
/tmp/ltsmin6525456401019706990
[2024-05-22 03:30:24] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6525456401019706990
Running compilation step : cd /tmp/ltsmin6525456401019706990;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6525456401019706990;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6525456401019706990;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 823/823 transitions.
Applied a total of 0 rules in 4 ms. Remains 78 /78 variables (removed 0) and now considering 823/823 (removed 0) transitions.
// Phase 1: matrix 823 rows 78 cols
[2024-05-22 03:30:27] [INFO ] Computed 11 invariants in 7 ms
[2024-05-22 03:30:28] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-05-22 03:30:28] [INFO ] Invariant cache hit.
[2024-05-22 03:30:28] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-22 03:30:28] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 1083 ms to find 0 implicit places.
Running 822 sub problems to find dead transitions.
[2024-05-22 03:30:29] [INFO ] Invariant cache hit.
[2024-05-22 03:30:29] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 3 (OVERLAPS) 822/900 variables, 78/89 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/900 variables, 254/343 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 03:31:09] [INFO ] Deduced a trap composed of 15 places in 776 ms of which 2 ms to minimize.
[2024-05-22 03:31:09] [INFO ] Deduced a trap composed of 22 places in 871 ms of which 2 ms to minimize.
[2024-05-22 03:31:10] [INFO ] Deduced a trap composed of 7 places in 851 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 900/901 variables, and 346 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 78/78 constraints, ReadFeed: 254/255 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 4 (OVERLAPS) 822/900 variables, 78/92 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/900 variables, 254/346 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 900/901 variables, and 1168 constraints, problems are : Problem set: 0 solved, 822 unsolved in 33388 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 78/78 constraints, ReadFeed: 254/255 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 3/3 constraints]
After SMT, in 79065ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 79076ms
Finished structural reductions in LTL mode , in 1 iterations and 80165 ms. Remains : 78/78 places, 823/823 transitions.
Built C files in :
/tmp/ltsmin943112143439124132
[2024-05-22 03:31:48] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin943112143439124132
Running compilation step : cd /tmp/ltsmin943112143439124132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin943112143439124132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin943112143439124132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-22 03:31:51] [INFO ] Flatten gal took : 78 ms
[2024-05-22 03:31:51] [INFO ] Flatten gal took : 77 ms
[2024-05-22 03:31:51] [INFO ] Time to serialize gal into /tmp/LTL11278014397525495159.gal : 14 ms
[2024-05-22 03:31:51] [INFO ] Time to serialize properties into /tmp/LTL5886522147743319874.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11278014397525495159.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11365862713959549558.hoa' '-atoms' '/tmp/LTL5886522147743319874.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL5886522147743319874.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11365862713959549558.hoa
Detected timeout of ITS tools.
[2024-05-22 03:32:06] [INFO ] Flatten gal took : 78 ms
[2024-05-22 03:32:06] [INFO ] Flatten gal took : 80 ms
[2024-05-22 03:32:06] [INFO ] Time to serialize gal into /tmp/LTL11638766247091207281.gal : 13 ms
[2024-05-22 03:32:06] [INFO ] Time to serialize properties into /tmp/LTL7849528711751643133.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11638766247091207281.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7849528711751643133.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((p1==0)||(p6==0))||((p24==0)||(p81==0)))")||(X((G("(((p1==0)||(p6==0))||((p24==0)||(p81==0)))"))||(X(G("(((p1==0)||(p12==0)...189
Formula 0 simplified : XF(!"(((p1==0)||(p6==0))||((p24==0)||(p81==0)))" & X(F!"(((p1==0)||(p6==0))||((p24==0)||(p81==0)))" & XF!"(((p1==0)||(p12==0))||((p2...175
Detected timeout of ITS tools.
[2024-05-22 03:32:21] [INFO ] Flatten gal took : 74 ms
[2024-05-22 03:32:21] [INFO ] Applying decomposition
[2024-05-22 03:32:21] [INFO ] Flatten gal took : 73 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8006296316129208138.txt' '-o' '/tmp/graph8006296316129208138.bin' '-w' '/tmp/graph8006296316129208138.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8006296316129208138.bin' '-l' '-1' '-v' '-w' '/tmp/graph8006296316129208138.weights' '-q' '0' '-e' '0.001'
[2024-05-22 03:32:22] [INFO ] Decomposing Gal with order
[2024-05-22 03:32:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 03:32:22] [INFO ] Removed a total of 6171 redundant transitions.
[2024-05-22 03:32:22] [INFO ] Flatten gal took : 166 ms
[2024-05-22 03:32:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 83 ms.
[2024-05-22 03:32:22] [INFO ] Time to serialize gal into /tmp/LTL16617260167897351056.gal : 9 ms
[2024-05-22 03:32:22] [INFO ] Time to serialize properties into /tmp/LTL13472838962399303637.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16617260167897351056.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13472838962399303637.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((u0.p1==0)||(u0.p6==0))||((i5.u5.p24==0)||(u0.p81==0)))")||(X((G("(((u0.p1==0)||(u0.p6==0))||((i5.u5.p24==0)||(u0.p81==0)))...234
Formula 0 simplified : XF(!"(((u0.p1==0)||(u0.p6==0))||((i5.u5.p24==0)||(u0.p81==0)))" & X(F!"(((u0.p1==0)||(u0.p6==0))||((i5.u5.p24==0)||(u0.p81==0)))" & ...220
Detected timeout of ITS tools.
Treatment of property AutonomousCar-PT-09a-LTLFireability-02 finished in 544607 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 14 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 82 transition count 855
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 74 transition count 854
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 73 transition count 854
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 18 place count 73 transition count 852
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 71 transition count 852
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 27 place count 66 transition count 802
Iterating global reduction 3 with 5 rules applied. Total rules applied 32 place count 66 transition count 802
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 65 transition count 801
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 64 transition count 801
Applied a total of 36 rules in 98 ms. Remains 64 /82 variables (removed 18) and now considering 801/863 (removed 62) transitions.
// Phase 1: matrix 801 rows 64 cols
[2024-05-22 03:32:37] [INFO ] Computed 11 invariants in 5 ms
[2024-05-22 03:32:37] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-22 03:32:37] [INFO ] Invariant cache hit.
[2024-05-22 03:32:38] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-22 03:32:38] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 968 ms to find 0 implicit places.
[2024-05-22 03:32:38] [INFO ] Redundant transitions in 27 ms returned []
Running 800 sub problems to find dead transitions.
[2024-05-22 03:32:38] [INFO ] Invariant cache hit.
[2024-05-22 03:32:38] [INFO ] State equation strengthened by 248 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 3 (OVERLAPS) 800/864 variables, 64/75 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/864 variables, 247/322 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 864/865 variables, and 322 constraints, problems are : Problem set: 0 solved, 800 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 64/64 constraints, ReadFeed: 247/248 constraints, PredecessorRefiner: 800/800 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 800 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 3 (OVERLAPS) 800/864 variables, 64/75 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/864 variables, 247/322 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 864/865 variables, and 1122 constraints, problems are : Problem set: 0 solved, 800 unsolved in 31879 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 64/64 constraints, ReadFeed: 247/248 constraints, PredecessorRefiner: 800/800 constraints, Known Traps: 0/0 constraints]
After SMT, in 76661ms problems are : Problem set: 0 solved, 800 unsolved
Search for dead transitions found 0 dead transitions in 76670ms
Starting structural reductions in SI_LTL mode, iteration 1 : 64/82 places, 801/863 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77774 ms. Remains : 64/82 places, 801/863 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-03
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-03 finished in 77855 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 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 82 transition count 854
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 73 transition count 854
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 73 transition count 852
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 71 transition count 852
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 66 transition count 802
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 66 transition count 802
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 65 transition count 801
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 64 transition count 801
Applied a total of 36 rules in 157 ms. Remains 64 /82 variables (removed 18) and now considering 801/863 (removed 62) transitions.
// Phase 1: matrix 801 rows 64 cols
[2024-05-22 03:33:55] [INFO ] Computed 11 invariants in 8 ms
[2024-05-22 03:33:56] [INFO ] Implicit Places using invariants in 542 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 557 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/82 places, 801/863 transitions.
Applied a total of 0 rules in 73 ms. Remains 63 /63 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 787 ms. Remains : 63/82 places, 801/863 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-06
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-06 finished in 907 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((F(p0)||X(p1)))))'
Support contains 15 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 82 transition count 856
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 75 transition count 854
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 73 transition count 854
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 18 place count 73 transition count 852
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 71 transition count 852
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 27 place count 66 transition count 802
Iterating global reduction 3 with 5 rules applied. Total rules applied 32 place count 66 transition count 802
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 65 transition count 802
Applied a total of 34 rules in 156 ms. Remains 65 /82 variables (removed 17) and now considering 802/863 (removed 61) transitions.
// Phase 1: matrix 802 rows 65 cols
[2024-05-22 03:33:56] [INFO ] Computed 11 invariants in 6 ms
[2024-05-22 03:33:56] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-22 03:33:56] [INFO ] Invariant cache hit.
[2024-05-22 03:33:57] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-22 03:33:57] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
[2024-05-22 03:33:57] [INFO ] Redundant transitions in 38 ms returned []
Running 801 sub problems to find dead transitions.
[2024-05-22 03:33:57] [INFO ] Invariant cache hit.
[2024-05-22 03:33:57] [INFO ] State equation strengthened by 248 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 3 (OVERLAPS) 801/866 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/866 variables, 247/323 constraints. Problems are: Problem set: 0 solved, 801 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 866/867 variables, and 323 constraints, problems are : Problem set: 0 solved, 801 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/65 constraints, ReadFeed: 247/248 constraints, PredecessorRefiner: 801/801 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 801 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 3 (OVERLAPS) 801/866 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/866 variables, 247/323 constraints. Problems are: Problem set: 0 solved, 801 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 866/867 variables, and 1124 constraints, problems are : Problem set: 0 solved, 801 unsolved in 32999 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/65 constraints, ReadFeed: 247/248 constraints, PredecessorRefiner: 801/801 constraints, Known Traps: 0/0 constraints]
After SMT, in 79417ms problems are : Problem set: 0 solved, 801 unsolved
Search for dead transitions found 0 dead transitions in 79433ms
Starting structural reductions in SI_LTL mode, iteration 1 : 65/82 places, 802/863 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80490 ms. Remains : 65/82 places, 802/863 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-08
Product exploration explored 100000 steps with 1543 reset in 470 ms.
Product exploration explored 100000 steps with 2255 reset in 697 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 137 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 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 235 steps (14 resets) in 11 ms. (19 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 307 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 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 15 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 802/802 transitions.
Applied a total of 0 rules in 85 ms. Remains 65 /65 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2024-05-22 03:35:19] [INFO ] Invariant cache hit.
[2024-05-22 03:35:19] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-22 03:35:19] [INFO ] Invariant cache hit.
[2024-05-22 03:35:19] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-22 03:35:19] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
[2024-05-22 03:35:19] [INFO ] Redundant transitions in 31 ms returned []
Running 801 sub problems to find dead transitions.
[2024-05-22 03:35:19] [INFO ] Invariant cache hit.
[2024-05-22 03:35:19] [INFO ] State equation strengthened by 248 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 3 (OVERLAPS) 801/866 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/866 variables, 247/323 constraints. Problems are: Problem set: 0 solved, 801 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 866/867 variables, and 323 constraints, problems are : Problem set: 0 solved, 801 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/65 constraints, ReadFeed: 247/248 constraints, PredecessorRefiner: 801/801 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 801 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 3 (OVERLAPS) 801/866 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/866 variables, 247/323 constraints. Problems are: Problem set: 0 solved, 801 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 866/867 variables, and 1124 constraints, problems are : Problem set: 0 solved, 801 unsolved in 32276 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/65 constraints, ReadFeed: 247/248 constraints, PredecessorRefiner: 801/801 constraints, Known Traps: 0/0 constraints]
After SMT, in 78709ms problems are : Problem set: 0 solved, 801 unsolved
Search for dead transitions found 0 dead transitions in 78718ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 79632 ms. Remains : 65/65 places, 802/802 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 105 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 72 steps (3 resets) in 7 ms. (9 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 227 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 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 577 reset in 201 ms.
Product exploration explored 100000 steps with 10838 reset in 2227 ms.
Built C files in :
/tmp/ltsmin7635371986907087975
[2024-05-22 03:36:41] [INFO ] Computing symmetric may disable matrix : 802 transitions.
[2024-05-22 03:36:41] [INFO ] Computation of Complete disable matrix. took 137 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:36:41] [INFO ] Computing symmetric may enable matrix : 802 transitions.
[2024-05-22 03:36:41] [INFO ] Computation of Complete enable matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:36:42] [INFO ] Computing Do-Not-Accords matrix : 802 transitions.
[2024-05-22 03:36:42] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:36:42] [INFO ] Built C files in 494ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7635371986907087975
Running compilation step : cd /tmp/ltsmin7635371986907087975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7635371986907087975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7635371986907087975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 15 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 802/802 transitions.
Applied a total of 0 rules in 54 ms. Remains 65 /65 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2024-05-22 03:36:45] [INFO ] Invariant cache hit.
[2024-05-22 03:36:45] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-22 03:36:45] [INFO ] Invariant cache hit.
[2024-05-22 03:36:45] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-22 03:36:46] [INFO ] Implicit Places using invariants and state equation in 689 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
[2024-05-22 03:36:46] [INFO ] Redundant transitions in 30 ms returned []
Running 801 sub problems to find dead transitions.
[2024-05-22 03:36:46] [INFO ] Invariant cache hit.
[2024-05-22 03:36:46] [INFO ] State equation strengthened by 248 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 3 (OVERLAPS) 801/866 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/866 variables, 247/323 constraints. Problems are: Problem set: 0 solved, 801 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 866/867 variables, and 323 constraints, problems are : Problem set: 0 solved, 801 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/65 constraints, ReadFeed: 247/248 constraints, PredecessorRefiner: 801/801 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 801 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 3 (OVERLAPS) 801/866 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/866 variables, 247/323 constraints. Problems are: Problem set: 0 solved, 801 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 866/867 variables, and 1124 constraints, problems are : Problem set: 0 solved, 801 unsolved in 32880 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 65/65 constraints, ReadFeed: 247/248 constraints, PredecessorRefiner: 801/801 constraints, Known Traps: 0/0 constraints]
After SMT, in 78775ms problems are : Problem set: 0 solved, 801 unsolved
Search for dead transitions found 0 dead transitions in 78784ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 79806 ms. Remains : 65/65 places, 802/802 transitions.
Built C files in :
/tmp/ltsmin16929888321785275226
[2024-05-22 03:38:05] [INFO ] Computing symmetric may disable matrix : 802 transitions.
[2024-05-22 03:38:05] [INFO ] Computation of Complete disable matrix. took 94 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:38:05] [INFO ] Computing symmetric may enable matrix : 802 transitions.
[2024-05-22 03:38:05] [INFO ] Computation of Complete enable matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:38:05] [INFO ] Computing Do-Not-Accords matrix : 802 transitions.
[2024-05-22 03:38:05] [INFO ] Computation of Completed DNA matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:38:05] [INFO ] Built C files in 397ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16929888321785275226
Running compilation step : cd /tmp/ltsmin16929888321785275226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16929888321785275226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16929888321785275226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-22 03:38:08] [INFO ] Flatten gal took : 99 ms
[2024-05-22 03:38:08] [INFO ] Flatten gal took : 128 ms
[2024-05-22 03:38:08] [INFO ] Time to serialize gal into /tmp/LTL762650221183015467.gal : 46 ms
[2024-05-22 03:38:08] [INFO ] Time to serialize properties into /tmp/LTL14075883830762223938.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL762650221183015467.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11956407208438029251.hoa' '-atoms' '/tmp/LTL14075883830762223938.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14075883830762223938.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11956407208438029251.hoa
Detected timeout of ITS tools.
[2024-05-22 03:38:23] [INFO ] Flatten gal took : 87 ms
[2024-05-22 03:38:24] [INFO ] Flatten gal took : 84 ms
[2024-05-22 03:38:24] [INFO ] Time to serialize gal into /tmp/LTL1043836869648118242.gal : 11 ms
[2024-05-22 03:38:24] [INFO ] Time to serialize properties into /tmp/LTL15240781907701125455.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1043836869648118242.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15240781907701125455.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G((F("((((p1==0)||(p2==0))||((p18==0)||(p81==0)))&&(((((p19==0)||(p26==0))||((p30==0)||(p40==0)))||(((p47==0)||(p54==0))||((p61==...252
Formula 0 simplified : G(FG!"((((p1==0)||(p2==0))||((p18==0)||(p81==0)))&&(((((p19==0)||(p26==0))||((p30==0)||(p40==0)))||(((p47==0)||(p54==0))||((p61==0)|...242
Detected timeout of ITS tools.
[2024-05-22 03:38:39] [INFO ] Flatten gal took : 89 ms
[2024-05-22 03:38:39] [INFO ] Applying decomposition
[2024-05-22 03:38:39] [INFO ] Flatten gal took : 133 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6827348026179500835.txt' '-o' '/tmp/graph6827348026179500835.bin' '-w' '/tmp/graph6827348026179500835.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6827348026179500835.bin' '-l' '-1' '-v' '-w' '/tmp/graph6827348026179500835.weights' '-q' '0' '-e' '0.001'
[2024-05-22 03:38:39] [INFO ] Decomposing Gal with order
[2024-05-22 03:38:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 03:38:39] [INFO ] Removed a total of 5811 redundant transitions.
[2024-05-22 03:38:39] [INFO ] Flatten gal took : 146 ms
[2024-05-22 03:38:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 25 ms.
[2024-05-22 03:38:39] [INFO ] Time to serialize gal into /tmp/LTL17298650552518179932.gal : 3 ms
[2024-05-22 03:38:39] [INFO ] Time to serialize properties into /tmp/LTL2644721930049928617.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17298650552518179932.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2644721930049928617.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G((F("((((i8.u18.p1==0)||(i8.u18.p2==0))||((u1.p18==0)||(i8.u18.p81==0)))&&(((((u1.p19==0)||(u3.p26==0))||((i2.u4.p30==0)||(i2.u7...346
Formula 0 simplified : G(FG!"((((i8.u18.p1==0)||(i8.u18.p2==0))||((u1.p18==0)||(i8.u18.p81==0)))&&(((((u1.p19==0)||(u3.p26==0))||((i2.u4.p30==0)||(i2.u7.p4...336
Reverse transition relation is NOT exact ! Due to transitions t339, t340, t341, t342, t355, t356, t357, t358, t371, t372, t373, t374, t387, t388, t389, t39...1180
Computing Next relation with stutter on 393130 deadlock states
Detected timeout of ITS tools.
Treatment of property AutonomousCar-PT-09a-LTLFireability-08 finished in 298533 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(p1)))))'
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 79 transition count 833
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 79 transition count 833
Applied a total of 6 rules in 7 ms. Remains 79 /82 variables (removed 3) and now considering 833/863 (removed 30) transitions.
// Phase 1: matrix 833 rows 79 cols
[2024-05-22 03:38:54] [INFO ] Computed 11 invariants in 4 ms
[2024-05-22 03:38:55] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-22 03:38:55] [INFO ] Invariant cache hit.
[2024-05-22 03:38:55] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-22 03:38:56] [INFO ] Implicit Places using invariants and state equation in 859 ms returned []
Implicit Place search using SMT with State Equation took 1182 ms to find 0 implicit places.
Running 832 sub problems to find dead transitions.
[2024-05-22 03:38:56] [INFO ] Invariant cache hit.
[2024-05-22 03:38:56] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 832 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 832 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 832 unsolved
At refinement iteration 3 (OVERLAPS) 832/911 variables, 79/90 constraints. Problems are: Problem set: 0 solved, 832 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/911 variables, 263/353 constraints. Problems are: Problem set: 0 solved, 832 unsolved
[2024-05-22 03:39:38] [INFO ] Deduced a trap composed of 15 places in 858 ms of which 2 ms to minimize.
[2024-05-22 03:39:39] [INFO ] Deduced a trap composed of 22 places in 886 ms of which 4 ms to minimize.
[2024-05-22 03:39:40] [INFO ] Deduced a trap composed of 7 places in 844 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 911/912 variables, and 356 constraints, problems are : Problem set: 0 solved, 832 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 79/79 constraints, ReadFeed: 263/264 constraints, PredecessorRefiner: 832/832 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 832 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 832 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 832 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 832 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 832 unsolved
At refinement iteration 4 (OVERLAPS) 832/911 variables, 79/93 constraints. Problems are: Problem set: 0 solved, 832 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/911 variables, 263/356 constraints. Problems are: Problem set: 0 solved, 832 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 911/912 variables, and 1188 constraints, problems are : Problem set: 0 solved, 832 unsolved in 33446 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 79/79 constraints, ReadFeed: 263/264 constraints, PredecessorRefiner: 832/832 constraints, Known Traps: 3/3 constraints]
After SMT, in 80151ms problems are : Problem set: 0 solved, 832 unsolved
Search for dead transitions found 0 dead transitions in 80162ms
Starting structural reductions in LTL mode, iteration 1 : 79/82 places, 833/863 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81354 ms. Remains : 79/82 places, 833/863 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-09
Product exploration explored 100000 steps with 33333 reset in 4458 ms.
Product exploration explored 100000 steps with 33333 reset in 4479 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 87 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-09a-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-09a-LTLFireability-09 finished in 90575 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((p0 U (p1||X(p2))))&&F(p0)))'
Support contains 15 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 78 transition count 823
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 78 transition count 823
Applied a total of 8 rules in 6 ms. Remains 78 /82 variables (removed 4) and now considering 823/863 (removed 40) transitions.
// Phase 1: matrix 823 rows 78 cols
[2024-05-22 03:40:25] [INFO ] Computed 11 invariants in 4 ms
[2024-05-22 03:40:25] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-22 03:40:25] [INFO ] Invariant cache hit.
[2024-05-22 03:40:26] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-22 03:40:26] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 834 ms to find 0 implicit places.
Running 822 sub problems to find dead transitions.
[2024-05-22 03:40:26] [INFO ] Invariant cache hit.
[2024-05-22 03:40:26] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 3 (OVERLAPS) 822/900 variables, 78/89 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/900 variables, 254/343 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-22 03:41:05] [INFO ] Deduced a trap composed of 15 places in 825 ms of which 2 ms to minimize.
[2024-05-22 03:41:06] [INFO ] Deduced a trap composed of 22 places in 729 ms of which 1 ms to minimize.
[2024-05-22 03:41:07] [INFO ] Deduced a trap composed of 7 places in 690 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 900/901 variables, and 346 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 78/78 constraints, ReadFeed: 254/255 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 4 (OVERLAPS) 822/900 variables, 78/92 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/900 variables, 254/346 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 900/901 variables, and 1168 constraints, problems are : Problem set: 0 solved, 822 unsolved in 33552 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 78/78 constraints, ReadFeed: 254/255 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 3/3 constraints]
After SMT, in 80148ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 80157ms
Starting structural reductions in LTL mode, iteration 1 : 78/82 places, 823/863 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81002 ms. Remains : 78/82 places, 823/863 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-10
Stuttering criterion allowed to conclude after 24 steps with 2 reset in 1 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-10 finished in 81269 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 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 77 transition count 813
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 77 transition count 813
Applied a total of 10 rules in 9 ms. Remains 77 /82 variables (removed 5) and now considering 813/863 (removed 50) transitions.
// Phase 1: matrix 813 rows 77 cols
[2024-05-22 03:41:46] [INFO ] Computed 11 invariants in 4 ms
[2024-05-22 03:41:47] [INFO ] Implicit Places using invariants in 341 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 345 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/82 places, 813/863 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 813/813 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 359 ms. Remains : 76/82 places, 813/863 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-11
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-11 finished in 470 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 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 80 transition count 851
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 69 transition count 851
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 23 place count 69 transition count 850
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 68 transition count 850
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 29 place count 64 transition count 810
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 64 transition count 810
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 2 with 4 rules applied. Total rules applied 37 place count 62 transition count 808
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 61 transition count 808
Applied a total of 39 rules in 108 ms. Remains 61 /82 variables (removed 21) and now considering 808/863 (removed 55) transitions.
// Phase 1: matrix 808 rows 61 cols
[2024-05-22 03:41:47] [INFO ] Computed 10 invariants in 3 ms
[2024-05-22 03:41:47] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-22 03:41:47] [INFO ] Invariant cache hit.
[2024-05-22 03:41:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 03:41:48] [INFO ] Implicit Places using invariants and state equation in 688 ms returned []
Implicit Place search using SMT with State Equation took 1057 ms to find 0 implicit places.
[2024-05-22 03:41:48] [INFO ] Redundant transitions in 27 ms returned []
Running 807 sub problems to find dead transitions.
[2024-05-22 03:41:48] [INFO ] Invariant cache hit.
[2024-05-22 03:41:48] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 2 (OVERLAPS) 807/868 variables, 61/71 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/868 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/868 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 5 (OVERLAPS) 1/869 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 807 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 869/869 variables, and 73 constraints, problems are : Problem set: 0 solved, 807 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 61/61 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 807/807 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 807 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 2 (OVERLAPS) 807/868 variables, 61/71 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/868 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 807 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 868/869 variables, and 879 constraints, problems are : Problem set: 0 solved, 807 unsolved in 31744 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 61/61 constraints, ReadFeed: 1/2 constraints, PredecessorRefiner: 807/807 constraints, Known Traps: 0/0 constraints]
After SMT, in 81261ms problems are : Problem set: 0 solved, 807 unsolved
Search for dead transitions found 0 dead transitions in 81275ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/82 places, 808/863 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82477 ms. Remains : 61/82 places, 808/863 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-12
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-12 finished in 82551 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)||G((p1||G(p2))))))'
Support contains 16 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 77 transition count 813
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 77 transition count 813
Applied a total of 10 rules in 11 ms. Remains 77 /82 variables (removed 5) and now considering 813/863 (removed 50) transitions.
// Phase 1: matrix 813 rows 77 cols
[2024-05-22 03:43:09] [INFO ] Computed 11 invariants in 6 ms
[2024-05-22 03:43:09] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-22 03:43:09] [INFO ] Invariant cache hit.
[2024-05-22 03:43:10] [INFO ] State equation strengthened by 246 read => feed constraints.
[2024-05-22 03:43:10] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 887 ms to find 0 implicit places.
Running 812 sub problems to find dead transitions.
[2024-05-22 03:43:10] [INFO ] Invariant cache hit.
[2024-05-22 03:43:10] [INFO ] State equation strengthened by 246 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 3 (OVERLAPS) 812/889 variables, 77/88 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/889 variables, 245/333 constraints. Problems are: Problem set: 0 solved, 812 unsolved
[2024-05-22 03:43:51] [INFO ] Deduced a trap composed of 15 places in 540 ms of which 2 ms to minimize.
[2024-05-22 03:43:51] [INFO ] Deduced a trap composed of 22 places in 541 ms of which 1 ms to minimize.
[2024-05-22 03:43:52] [INFO ] Deduced a trap composed of 7 places in 664 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 889/890 variables, and 336 constraints, problems are : Problem set: 0 solved, 812 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 77/77 constraints, ReadFeed: 245/246 constraints, PredecessorRefiner: 812/812 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 812 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 4 (OVERLAPS) 812/889 variables, 77/91 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/889 variables, 245/336 constraints. Problems are: Problem set: 0 solved, 812 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 889/890 variables, and 1148 constraints, problems are : Problem set: 0 solved, 812 unsolved in 31378 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 77/77 constraints, ReadFeed: 245/246 constraints, PredecessorRefiner: 812/812 constraints, Known Traps: 3/3 constraints]
After SMT, in 78316ms problems are : Problem set: 0 solved, 812 unsolved
Search for dead transitions found 0 dead transitions in 78332ms
Starting structural reductions in LTL mode, iteration 1 : 77/82 places, 813/863 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79234 ms. Remains : 77/82 places, 813/863 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-14
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-14 finished in 79413 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 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 82 transition count 854
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 73 transition count 854
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 73 transition count 852
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 71 transition count 852
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 66 transition count 802
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 66 transition count 802
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 65 transition count 801
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 64 transition count 801
Applied a total of 36 rules in 83 ms. Remains 64 /82 variables (removed 18) and now considering 801/863 (removed 62) transitions.
// Phase 1: matrix 801 rows 64 cols
[2024-05-22 03:44:29] [INFO ] Computed 11 invariants in 5 ms
[2024-05-22 03:44:29] [INFO ] Implicit Places using invariants in 309 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 311 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/82 places, 801/863 transitions.
Applied a total of 0 rules in 42 ms. Remains 63 /63 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 436 ms. Remains : 63/82 places, 801/863 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-15
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-09a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLFireability-15 finished in 538 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)))'
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((X((G(p1)||X(G(p2))))||p0))))'
Found a Lengthening insensitive property : AutonomousCar-PT-09a-LTLFireability-02
Stuttering acceptance computed with spot in 263 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 82/82 places, 863/863 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 82 transition count 852
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 71 transition count 852
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 22 place count 71 transition count 851
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 70 transition count 851
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 28 place count 66 transition count 811
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 66 transition count 811
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 64 transition count 809
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 63 transition count 809
Applied a total of 38 rules in 61 ms. Remains 63 /82 variables (removed 19) and now considering 809/863 (removed 54) transitions.
// Phase 1: matrix 809 rows 63 cols
[2024-05-22 03:44:30] [INFO ] Computed 11 invariants in 4 ms
[2024-05-22 03:44:30] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-22 03:44:30] [INFO ] Invariant cache hit.
[2024-05-22 03:44:31] [INFO ] State equation strengthened by 257 read => feed constraints.
[2024-05-22 03:44:31] [INFO ] Implicit Places using invariants and state equation in 978 ms returned []
Implicit Place search using SMT with State Equation took 1292 ms to find 0 implicit places.
Running 808 sub problems to find dead transitions.
[2024-05-22 03:44:31] [INFO ] Invariant cache hit.
[2024-05-22 03:44:31] [INFO ] State equation strengthened by 257 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 3 (OVERLAPS) 808/871 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/871 variables, 256/330 constraints. Problems are: Problem set: 0 solved, 808 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 871/872 variables, and 330 constraints, problems are : Problem set: 0 solved, 808 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 256/257 constraints, PredecessorRefiner: 808/808 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 808 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 3 (OVERLAPS) 808/871 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/871 variables, 256/330 constraints. Problems are: Problem set: 0 solved, 808 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 871/872 variables, and 1138 constraints, problems are : Problem set: 0 solved, 808 unsolved in 33195 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 256/257 constraints, PredecessorRefiner: 808/808 constraints, Known Traps: 0/0 constraints]
After SMT, in 81182ms problems are : Problem set: 0 solved, 808 unsolved
Search for dead transitions found 0 dead transitions in 81191ms
Starting structural reductions in LI_LTL mode, iteration 1 : 63/82 places, 809/863 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 82546 ms. Remains : 63/82 places, 809/863 transitions.
Running random walk in product with property : AutonomousCar-PT-09a-LTLFireability-02
Product exploration explored 100000 steps with 150 reset in 105 ms.
Product exploration explored 100000 steps with 358 reset in 161 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (2511 resets) in 684 ms. (58 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (171 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (130 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (132 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
[2024-05-22 03:45:53] [INFO ] Invariant cache hit.
[2024-05-22 03:45:53] [INFO ] State equation strengthened by 257 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 40/59 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 806/865 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 256/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/871 variables, 4/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/871 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/872 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/872 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/872 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 872/872 variables, and 331 constraints, problems are : Problem set: 0 solved, 3 unsolved in 676 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 257/257 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 13/19 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 40/59 variables, 8/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 806/865 variables, 59/70 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 256/326 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/326 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/871 variables, 4/330 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/871 variables, 2/332 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/871 variables, 0/332 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/872 variables, 1/333 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/872 variables, 0/333 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/872 variables, 0/333 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 872/872 variables, and 333 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1447 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 257/257 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2195ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 963 ms.
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 809/809 transitions.
Graph (complete) has 935 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 62 transition count 806
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 12 place count 62 transition count 797
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 102 place count 53 transition count 716
Applied a total of 102 rules in 88 ms. Remains 53 /63 variables (removed 10) and now considering 716/809 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 53/63 places, 716/809 transitions.
RANDOM walk for 40000 steps (172 resets) in 1760 ms. (22 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (173 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (170 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 527092 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 2
Probabilistic random walk after 527092 steps, saw 67768 distinct states, run finished after 3004 ms. (steps per millisecond=175 ) properties seen :0
// Phase 1: matrix 716 rows 53 cols
[2024-05-22 03:46:00] [INFO ] Computed 12 invariants in 3 ms
[2024-05-22 03:46:00] [INFO ] State equation strengthened by 175 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/50 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/53 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 716/769 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 175/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/769 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/769 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 769/769 variables, and 240 constraints, problems are : Problem set: 0 solved, 2 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 175/175 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/50 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/53 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 716/769 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 175/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/769 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/769 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/769 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 769/769 variables, and 242 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1009 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 175/175 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1355ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 740 ms.
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 716/716 transitions.
Applied a total of 0 rules in 58 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 53/53 places, 716/716 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 716/716 transitions.
Applied a total of 0 rules in 58 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2024-05-22 03:46:02] [INFO ] Invariant cache hit.
[2024-05-22 03:46:03] [INFO ] Implicit Places using invariants in 463 ms returned []
[2024-05-22 03:46:03] [INFO ] Invariant cache hit.
[2024-05-22 03:46:03] [INFO ] State equation strengthened by 175 read => feed constraints.
[2024-05-22 03:46:03] [INFO ] Implicit Places using invariants and state equation in 669 ms returned []
Implicit Place search using SMT with State Equation took 1134 ms to find 0 implicit places.
[2024-05-22 03:46:03] [INFO ] Redundant transitions in 20 ms returned []
Running 715 sub problems to find dead transitions.
[2024-05-22 03:46:03] [INFO ] Invariant cache hit.
[2024-05-22 03:46:03] [INFO ] State equation strengthened by 175 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 4 (OVERLAPS) 716/769 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/769 variables, 175/240 constraints. Problems are: Problem set: 0 solved, 715 unsolved
[2024-05-22 03:46:41] [INFO ] Deduced a trap composed of 21 places in 678 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/769 variables, and 241 constraints, problems are : Problem set: 0 solved, 715 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 175/175 constraints, PredecessorRefiner: 715/715 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 715 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 5 (OVERLAPS) 716/769 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 175/241 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/769 variables, and 956 constraints, problems are : Problem set: 0 solved, 715 unsolved in 32720 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 175/175 constraints, PredecessorRefiner: 715/715 constraints, Known Traps: 1/1 constraints]
After SMT, in 76665ms problems are : Problem set: 0 solved, 715 unsolved
Search for dead transitions found 0 dead transitions in 76678ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77900 ms. Remains : 53/53 places, 716/716 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 32 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-22 03:47:20] [INFO ] Invariant cache hit.
[2024-05-22 03:47:20] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 03:47:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-22 03:47:20] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 03:47:21] [INFO ] After 436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 03:47:21] [INFO ] After 670ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 03:47:21] [INFO ] After 908ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1006 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (X p0)), (X (X p1)), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT (AND p2 p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 254 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 809/809 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 809/809 (removed 0) transitions.
// Phase 1: matrix 809 rows 63 cols
[2024-05-22 03:47:22] [INFO ] Computed 11 invariants in 4 ms
[2024-05-22 03:47:22] [INFO ] Implicit Places using invariants in 474 ms returned []
[2024-05-22 03:47:22] [INFO ] Invariant cache hit.
[2024-05-22 03:47:23] [INFO ] State equation strengthened by 257 read => feed constraints.
[2024-05-22 03:47:23] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 1234 ms to find 0 implicit places.
Running 808 sub problems to find dead transitions.
[2024-05-22 03:47:23] [INFO ] Invariant cache hit.
[2024-05-22 03:47:23] [INFO ] State equation strengthened by 257 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 3 (OVERLAPS) 808/871 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/871 variables, 256/330 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-05-22 03:48:09] [INFO ] Deduced a trap composed of 21 places in 736 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 871/872 variables, and 331 constraints, problems are : Problem set: 0 solved, 808 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 256/257 constraints, PredecessorRefiner: 808/808 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 808 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 4 (OVERLAPS) 808/871 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/871 variables, 256/331 constraints. Problems are: Problem set: 0 solved, 808 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 871/872 variables, and 1139 constraints, problems are : Problem set: 0 solved, 808 unsolved in 33144 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 256/257 constraints, PredecessorRefiner: 808/808 constraints, Known Traps: 1/1 constraints]
After SMT, in 81452ms problems are : Problem set: 0 solved, 808 unsolved
Search for dead transitions found 0 dead transitions in 81469ms
Finished structural reductions in LTL mode , in 1 iterations and 82712 ms. Remains : 63/63 places, 809/809 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 143 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (2503 resets) in 1218 ms. (32 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (129 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
[2024-05-22 03:48:45] [INFO ] Invariant cache hit.
[2024-05-22 03:48:45] [INFO ] State equation strengthened by 257 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/59 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 806/865 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 256/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/871 variables, 4/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/871 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/872 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/872 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/872 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 872/872 variables, and 331 constraints, problems are : Problem set: 0 solved, 1 unsolved in 509 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 257/257 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/59 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 806/865 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 256/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/871 variables, 4/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/871 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/871 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/872 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/872 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/872 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 872/872 variables, and 332 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1058 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 257/257 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1605ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 617 ms.
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 809/809 transitions.
Graph (complete) has 935 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 62 transition count 806
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 12 place count 62 transition count 797
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 102 place count 53 transition count 716
Applied a total of 102 rules in 125 ms. Remains 53 /63 variables (removed 10) and now considering 716/809 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 53/63 places, 716/809 transitions.
RANDOM walk for 40000 steps (185 resets) in 669 ms. (59 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (173 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 901045 steps, run timeout after 3001 ms. (steps per millisecond=300 ) properties seen :0 out of 1
Probabilistic random walk after 901045 steps, saw 111796 distinct states, run finished after 3001 ms. (steps per millisecond=300 ) properties seen :0
// Phase 1: matrix 716 rows 53 cols
[2024-05-22 03:48:51] [INFO ] Computed 12 invariants in 3 ms
[2024-05-22 03:48:51] [INFO ] State equation strengthened by 175 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/50 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/53 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 716/769 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 175/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/769 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/769 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 769/769 variables, and 240 constraints, problems are : Problem set: 0 solved, 1 unsolved in 418 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 175/175 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/50 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/53 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 716/769 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 175/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/769 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/769 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/769 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 769/769 variables, and 241 constraints, problems are : Problem set: 0 solved, 1 unsolved in 917 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 175/175 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1362ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 292 ms.
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 716/716 transitions.
Applied a total of 0 rules in 58 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 53/53 places, 716/716 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 716/716 transitions.
Applied a total of 0 rules in 58 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2024-05-22 03:48:53] [INFO ] Invariant cache hit.
[2024-05-22 03:48:53] [INFO ] Implicit Places using invariants in 478 ms returned []
[2024-05-22 03:48:53] [INFO ] Invariant cache hit.
[2024-05-22 03:48:54] [INFO ] State equation strengthened by 175 read => feed constraints.
[2024-05-22 03:48:54] [INFO ] Implicit Places using invariants and state equation in 939 ms returned []
Implicit Place search using SMT with State Equation took 1419 ms to find 0 implicit places.
[2024-05-22 03:48:54] [INFO ] Redundant transitions in 20 ms returned []
Running 715 sub problems to find dead transitions.
[2024-05-22 03:48:54] [INFO ] Invariant cache hit.
[2024-05-22 03:48:54] [INFO ] State equation strengthened by 175 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 4 (OVERLAPS) 716/769 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/769 variables, 175/240 constraints. Problems are: Problem set: 0 solved, 715 unsolved
[2024-05-22 03:49:32] [INFO ] Deduced a trap composed of 21 places in 734 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/769 variables, and 241 constraints, problems are : Problem set: 0 solved, 715 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 175/175 constraints, PredecessorRefiner: 715/715 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 715 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 5 (OVERLAPS) 716/769 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 175/241 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/769 variables, and 956 constraints, problems are : Problem set: 0 solved, 715 unsolved in 32270 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 175/175 constraints, PredecessorRefiner: 715/715 constraints, Known Traps: 1/1 constraints]
After SMT, in 76263ms problems are : Problem set: 0 solved, 715 unsolved
Search for dead transitions found 0 dead transitions in 76277ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77787 ms. Remains : 53/53 places, 716/716 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 32 ms. Remains 53 /53 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 03:50:11] [INFO ] Invariant cache hit.
[2024-05-22 03:50:11] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 03:50:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-22 03:50:11] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 03:50:11] [INFO ] After 411ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 03:50:11] [INFO ] After 569ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 03:50:11] [INFO ] After 741ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 822 ms.
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p2 p1)))]
Knowledge based reduction with 4 factoid took 217 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 331 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 322 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 328 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 697 reset in 394 ms.
Product exploration explored 100000 steps with 1297 reset in 493 ms.
Applying partial POR strategy [true, true, true, false, false, false, false]
Stuttering acceptance computed with spot in 225 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 809/809 transitions.
Applied a total of 0 rules in 84 ms. Remains 63 /63 variables (removed 0) and now considering 809/809 (removed 0) transitions.
[2024-05-22 03:50:14] [INFO ] Redundant transitions in 33 ms returned []
Running 808 sub problems to find dead transitions.
// Phase 1: matrix 809 rows 63 cols
[2024-05-22 03:50:14] [INFO ] Computed 11 invariants in 4 ms
[2024-05-22 03:50:14] [INFO ] State equation strengthened by 257 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 3 (OVERLAPS) 808/871 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/871 variables, 256/330 constraints. Problems are: Problem set: 0 solved, 808 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 871/872 variables, and 330 constraints, problems are : Problem set: 0 solved, 808 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 256/257 constraints, PredecessorRefiner: 808/808 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 808 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 3 (OVERLAPS) 808/871 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/871 variables, 256/330 constraints. Problems are: Problem set: 0 solved, 808 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 871/872 variables, and 1138 constraints, problems are : Problem set: 0 solved, 808 unsolved in 32747 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 256/257 constraints, PredecessorRefiner: 808/808 constraints, Known Traps: 0/0 constraints]
After SMT, in 80778ms problems are : Problem set: 0 solved, 808 unsolved
Search for dead transitions found 0 dead transitions in 80791ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80929 ms. Remains : 63/63 places, 809/809 transitions.
Built C files in :
/tmp/ltsmin3192904984160108745
[2024-05-22 03:51:35] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3192904984160108745
Running compilation step : cd /tmp/ltsmin3192904984160108745;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3192904984160108745;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3192904984160108745;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 809/809 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 809/809 (removed 0) transitions.
[2024-05-22 03:51:38] [INFO ] Invariant cache hit.
[2024-05-22 03:51:38] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-05-22 03:51:38] [INFO ] Invariant cache hit.
[2024-05-22 03:51:39] [INFO ] State equation strengthened by 257 read => feed constraints.
[2024-05-22 03:51:39] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1351 ms to find 0 implicit places.
Running 808 sub problems to find dead transitions.
[2024-05-22 03:51:39] [INFO ] Invariant cache hit.
[2024-05-22 03:51:39] [INFO ] State equation strengthened by 257 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 3 (OVERLAPS) 808/871 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/871 variables, 256/330 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-05-22 03:52:23] [INFO ] Deduced a trap composed of 21 places in 539 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/871 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 808 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 871/872 variables, and 331 constraints, problems are : Problem set: 0 solved, 808 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 256/257 constraints, PredecessorRefiner: 808/808 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 808 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 4 (OVERLAPS) 808/871 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/871 variables, 256/331 constraints. Problems are: Problem set: 0 solved, 808 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 871/872 variables, and 1139 constraints, problems are : Problem set: 0 solved, 808 unsolved in 32796 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 256/257 constraints, PredecessorRefiner: 808/808 constraints, Known Traps: 1/1 constraints]
After SMT, in 80675ms problems are : Problem set: 0 solved, 808 unsolved
Search for dead transitions found 0 dead transitions in 80691ms
Finished structural reductions in LTL mode , in 1 iterations and 82050 ms. Remains : 63/63 places, 809/809 transitions.
Built C files in :
/tmp/ltsmin15290315016371165737
[2024-05-22 03:53:00] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15290315016371165737
Running compilation step : cd /tmp/ltsmin15290315016371165737;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15290315016371165737;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15290315016371165737;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-22 03:53:03] [INFO ] Flatten gal took : 145 ms
[2024-05-22 03:53:03] [INFO ] Flatten gal took : 144 ms
[2024-05-22 03:53:03] [INFO ] Time to serialize gal into /tmp/LTL6300572153101733310.gal : 19 ms
[2024-05-22 03:53:03] [INFO ] Time to serialize properties into /tmp/LTL7452666862599819903.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6300572153101733310.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12256401765598424165.hoa' '-atoms' '/tmp/LTL7452666862599819903.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7452666862599819903.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12256401765598424165.hoa
Detected timeout of ITS tools.
[2024-05-22 03:53:19] [INFO ] Flatten gal took : 150 ms
[2024-05-22 03:53:19] [INFO ] Flatten gal took : 102 ms
[2024-05-22 03:53:19] [INFO ] Time to serialize gal into /tmp/LTL1166583477720031818.gal : 12 ms
[2024-05-22 03:53:19] [INFO ] Time to serialize properties into /tmp/LTL5337405725578677325.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1166583477720031818.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5337405725578677325.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((p1==0)||(p6==0))||((p24==0)||(p81==0)))")||(X((G("(((p1==0)||(p6==0))||((p24==0)||(p81==0)))"))||(X(G("(((p1==0)||(p12==0)...189
Formula 0 simplified : XF(!"(((p1==0)||(p6==0))||((p24==0)||(p81==0)))" & X(F!"(((p1==0)||(p6==0))||((p24==0)||(p81==0)))" & XF!"(((p1==0)||(p12==0))||((p2...175
Detected timeout of ITS tools.
[2024-05-22 03:53:34] [INFO ] Flatten gal took : 97 ms
[2024-05-22 03:53:34] [INFO ] Applying decomposition
[2024-05-22 03:53:34] [INFO ] Flatten gal took : 95 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14880821920659506093.txt' '-o' '/tmp/graph14880821920659506093.bin' '-w' '/tmp/graph14880821920659506093.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14880821920659506093.bin' '-l' '-1' '-v' '-w' '/tmp/graph14880821920659506093.weights' '-q' '0' '-e' '0.001'
[2024-05-22 03:53:34] [INFO ] Decomposing Gal with order
[2024-05-22 03:53:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 03:53:34] [INFO ] Removed a total of 5570 redundant transitions.
[2024-05-22 03:53:34] [INFO ] Flatten gal took : 125 ms
[2024-05-22 03:53:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 28 ms.
[2024-05-22 03:53:34] [INFO ] Time to serialize gal into /tmp/LTL14986345443861298631.gal : 5 ms
[2024-05-22 03:53:34] [INFO ] Time to serialize properties into /tmp/LTL17895386857319959367.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14986345443861298631.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17895386857319959367.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((i9.u18.p1==0)||(i9.u18.p6==0))||((i2.u2.p24==0)||(i9.u18.p81==0)))")||(X((G("(((i9.u18.p1==0)||(i9.u18.p6==0))||((i2.u2.p2...270
Formula 0 simplified : XF(!"(((i9.u18.p1==0)||(i9.u18.p6==0))||((i2.u2.p24==0)||(i9.u18.p81==0)))" & X(F!"(((i9.u18.p1==0)||(i9.u18.p6==0))||((i2.u2.p24==0...256
Reverse transition relation is NOT exact ! Due to transitions t469, t470, t473, t474, t477, t478, t481, t482, t485, t486, t489, t490, t493, t494, t497, t49...1186
Computing Next relation with stutter on 393130 deadlock states
Detected timeout of ITS tools.
Treatment of property AutonomousCar-PT-09a-LTLFireability-02 finished in 560026 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((F(p0)||X(p1)))))'
[2024-05-22 03:53:50] [INFO ] Flatten gal took : 70 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14001082870455498812
[2024-05-22 03:53:50] [INFO ] Computing symmetric may disable matrix : 863 transitions.
[2024-05-22 03:53:50] [INFO ] Applying decomposition
[2024-05-22 03:53:50] [INFO ] Flatten gal took : 69 ms
[2024-05-22 03:53:50] [INFO ] Computation of Complete disable matrix. took 161 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:53:50] [INFO ] Computing symmetric may enable matrix : 863 transitions.
[2024-05-22 03:53:50] [INFO ] Computation of Complete enable matrix. took 39 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8398301623722074065.txt' '-o' '/tmp/graph8398301623722074065.bin' '-w' '/tmp/graph8398301623722074065.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8398301623722074065.bin' '-l' '-1' '-v' '-w' '/tmp/graph8398301623722074065.weights' '-q' '0' '-e' '0.001'
[2024-05-22 03:53:50] [INFO ] Decomposing Gal with order
[2024-05-22 03:53:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 03:53:50] [INFO ] Removed a total of 5983 redundant transitions.
[2024-05-22 03:53:50] [INFO ] Flatten gal took : 130 ms
[2024-05-22 03:53:50] [INFO ] Computing Do-Not-Accords matrix : 863 transitions.
[2024-05-22 03:53:50] [INFO ] Computation of Completed DNA matrix. took 59 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:53:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 40 ms.
[2024-05-22 03:53:50] [INFO ] Time to serialize gal into /tmp/LTLFireability18084189509330686344.gal : 8 ms
[2024-05-22 03:53:50] [INFO ] Time to serialize properties into /tmp/LTLFireability4294337790241449013.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18084189509330686344.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4294337790241449013.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
[2024-05-22 03:53:50] [INFO ] Built C files in 624ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14001082870455498812
Running compilation step : cd /tmp/ltsmin14001082870455498812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Checking formula 0 : !((F(G("(((((i1.u3.p19==0)||(i0.u5.p23==0))||((i3.u9.p33==0)||(u11.p37==0)))||(((i5.u15.p47==0)||(i0.u17.p51==0))||((i8.u21.p61==0)||(...213
Formula 0 simplified : GF!"(((((i1.u3.p19==0)||(i0.u5.p23==0))||((i3.u9.p33==0)||(u11.p37==0)))||(((i5.u15.p47==0)||(i0.u17.p51==0))||((i8.u21.p61==0)||(i0...207
Compilation finished in 8690 ms.
Running link step : cd /tmp/ltsmin14001082870455498812;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 109 ms.
Running LTSmin : cd /tmp/ltsmin14001082870455498812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t266, t329, t350, t366, t382, t398, t478, t494, t526, t606, t622, t638, t654, t734, t750, t76...579
Computing Next relation with stutter on 393130 deadlock states
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin14001082870455498812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14001082870455498812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(([]((LTLAPp2==true))||X([]((LTLAPp3==true)))))||(LTLAPp1==true))))' '--buchi-type=spotba'
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
26499 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,265.081,2884120,1,0,3.65324e+06,3340,6883,2.5362e+07,247,30763,7686688
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutonomousCar-PT-09a-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G(("(((i4.u0.p1==0)||(i4.u0.p6==0))||((i0.u5.p24==0)||(i4.u0.p81==0)))")||(X((G("(((i4.u0.p1==0)||(i4.u0.p6==0))||((i0.u5.p24==0)...261
Formula 1 simplified : XF(!"(((i4.u0.p1==0)||(i4.u0.p6==0))||((i0.u5.p24==0)||(i4.u0.p81==0)))" & X(F!"(((i4.u0.p1==0)||(i4.u0.p6==0))||((i0.u5.p24==0)||(i...247
Computing Next relation with stutter on 393130 deadlock states
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin14001082870455498812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(([]((LTLAPp2==true))||X([]((LTLAPp3==true)))))||(LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14001082870455498812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((<>((LTLAPp4==true))||X((LTLAPp5==true)))))' '--buchi-type=spotba'

BK_STOP 1716350959102

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-09a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-09a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-smll-171620167500348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-09a.tgz
mv AutonomousCar-PT-09a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;