Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r468-smll-171620167500364.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is AutonomousCar-PT-10a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167500364
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 17:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 12 17:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 17:53 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 1.5M 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-10a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717225334358

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-10a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:02:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:02:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:02:16] [INFO ] Load time of PNML (sax parser for PT used): 373 ms
[2024-06-01 07:02:16] [INFO ] Transformed 97 places.
[2024-06-01 07:02:16] [INFO ] Transformed 1921 transitions.
[2024-06-01 07:02:16] [INFO ] Found NUPN structural information;
[2024-06-01 07:02:16] [INFO ] Parsed PT model containing 97 places and 1921 transitions and 29152 arcs in 585 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 423 transitions
Reduce redundant transitions removed 423 transitions.
FORMULA AutonomousCar-PT-10a-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 1498/1498 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 91 transition count 1442
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 91 transition count 1442
Applied a total of 12 rules in 56 ms. Remains 91 /97 variables (removed 6) and now considering 1442/1498 (removed 56) transitions.
// Phase 1: matrix 1442 rows 91 cols
[2024-06-01 07:02:17] [INFO ] Computed 14 invariants in 63 ms
[2024-06-01 07:02:17] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-06-01 07:02:17] [INFO ] Invariant cache hit.
[2024-06-01 07:02:18] [INFO ] State equation strengthened by 353 read => feed constraints.
[2024-06-01 07:02:18] [INFO ] Implicit Places using invariants and state equation in 839 ms returned [87, 89]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1349 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/97 places, 1442/1498 transitions.
Applied a total of 0 rules in 10 ms. Remains 89 /89 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1443 ms. Remains : 89/97 places, 1442/1498 transitions.
Support contains 49 out of 89 places after structural reductions.
[2024-06-01 07:02:19] [INFO ] Flatten gal took : 478 ms
[2024-06-01 07:02:19] [INFO ] Flatten gal took : 329 ms
[2024-06-01 07:02:20] [INFO ] Input system was already deterministic with 1442 transitions.
Support contains 48 out of 89 places (down from 49) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 38 to 37
RANDOM walk for 40000 steps (1822 resets) in 4308 ms. (9 steps per ms) remains 30/37 properties
BEST_FIRST walk for 4003 steps (12 resets) in 67 ms. (58 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (10 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (12 resets) in 44 ms. (88 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (9 resets) in 27 ms. (143 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (13 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (15 resets) in 41 ms. (95 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (14 resets) in 66 ms. (59 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (9 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (10 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (13 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (13 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (14 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (14 resets) in 37 ms. (105 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (11 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (14 resets) in 25 ms. (154 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (9 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (11 resets) in 38 ms. (102 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (10 resets) in 68 ms. (58 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (12 resets) in 46 ms. (85 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (15 resets) in 39 ms. (100 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (12 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (10 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
// Phase 1: matrix 1442 rows 89 cols
[2024-06-01 07:02:21] [INFO ] Computed 12 invariants in 20 ms
[2024-06-01 07:02:22] [INFO ] State equation strengthened by 353 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 40/81 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 1435/1516 variables, 81/93 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1516 variables, 352/445 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1516 variables, 0/445 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 13/1529 variables, 7/452 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1529 variables, 0/452 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 1/1530 variables, 1/453 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1530 variables, 0/453 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 1/1531 variables, 1/454 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1531 variables, 0/454 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 0/1531 variables, 0/454 constraints. Problems are: Problem set: 2 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1531/1531 variables, and 454 constraints, problems are : Problem set: 2 solved, 27 unsolved in 4999 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 89/89 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 29/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 41/81 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 1435/1516 variables, 81/93 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1516 variables, 352/445 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1516 variables, 0/445 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 13/1529 variables, 7/452 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1529 variables, 0/452 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 1/1530 variables, 1/453 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1530 variables, 0/453 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 1/1531 variables, 1/454 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1531 variables, 0/454 constraints. Problems are: Problem set: 2 solved, 27 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1531/1531 variables, and 454 constraints, problems are : Problem set: 2 solved, 27 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 89/89 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 27/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 11181ms problems are : Problem set: 2 solved, 27 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Graph (complete) has 1186 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.38 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 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 88 transition count 1434
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 84 transition count 1432
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 82 transition count 1432
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 16 place count 82 transition count 1429
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 22 place count 79 transition count 1429
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 26 place count 75 transition count 1395
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 75 transition count 1395
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 3 with 2 rules applied. Total rules applied 32 place count 74 transition count 1394
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 74 transition count 1388
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 3 with 46 rules applied. Total rules applied 84 place count 68 transition count 1348
Applied a total of 84 rules in 488 ms. Remains 68 /89 variables (removed 21) and now considering 1348/1442 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 489 ms. Remains : 68/89 places, 1348/1442 transitions.
RANDOM walk for 40000 steps (142 resets) in 1553 ms. (25 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4004 steps (11 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (15 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (12 resets) in 27 ms. (143 steps per ms) remains 23/26 properties
BEST_FIRST walk for 4004 steps (11 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (13 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (11 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (12 resets) in 23 ms. (166 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (14 resets) in 21 ms. (182 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (13 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (11 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (10 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (11 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (13 resets) in 21 ms. (182 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (10 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (14 resets) in 24 ms. (160 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4002 steps (10 resets) in 21 ms. (181 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4004 steps (11 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (11 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (12 resets) in 19 ms. (200 steps per ms) remains 19/20 properties
// Phase 1: matrix 1348 rows 68 cols
[2024-06-01 07:02:34] [INFO ] Computed 14 invariants in 12 ms
[2024-06-01 07:02:34] [INFO ] State equation strengthened by 281 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 27/67 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 1/68 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 1348/1416 variables, 68/82 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1416 variables, 281/363 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1416 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 0/1416 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1416/1416 variables, and 363 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1693 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 281/281 constraints, PredecessorRefiner: 19/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 27/67 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 1/68 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 1348/1416 variables, 68/82 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1416 variables, 281/363 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1416 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 0/1416 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1416/1416 variables, and 363 constraints, problems are : Problem set: 0 solved, 19 unsolved in 2457 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 281/281 constraints, PredecessorRefiner: 19/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 4642ms problems are : Problem set: 0 solved, 19 unsolved
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 3578 ms.
Support contains 40 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 1348/1348 transitions.
Applied a total of 0 rules in 96 ms. Remains 68 /68 variables (removed 0) and now considering 1348/1348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 68/68 places, 1348/1348 transitions.
RANDOM walk for 40000 steps (345 resets) in 1392 ms. (28 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 18 ms. (210 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (14 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (12 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (14 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (12 resets) in 21 ms. (182 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4003 steps (11 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (11 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (13 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
[2024-06-01 07:02:43] [INFO ] Invariant cache hit.
[2024-06-01 07:02:43] [INFO ] State equation strengthened by 281 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 27/67 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1/68 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 1348/1416 variables, 68/82 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1416 variables, 281/363 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1416 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/1416 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1416/1416 variables, and 363 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1430 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 281/281 constraints, PredecessorRefiner: 16/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 27/67 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1/68 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 1348/1416 variables, 68/82 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1416 variables, 281/363 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1416 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/1416 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1416/1416 variables, and 363 constraints, problems are : Problem set: 0 solved, 16 unsolved in 2174 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 281/281 constraints, PredecessorRefiner: 16/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3962ms problems are : Problem set: 0 solved, 16 unsolved
Parikh walk visited 1 properties in 4292 ms.
Support contains 39 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 1348/1348 transitions.
Applied a total of 0 rules in 141 ms. Remains 68 /68 variables (removed 0) and now considering 1348/1348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 68/68 places, 1348/1348 transitions.
RANDOM walk for 40000 steps (520 resets) in 1600 ms. (24 steps per ms) remains 14/15 properties
BEST_FIRST walk for 40003 steps (103 resets) in 107 ms. (370 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (70 resets) in 142 ms. (279 steps per ms) remains 12/14 properties
BEST_FIRST walk for 40004 steps (96 resets) in 103 ms. (384 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (88 resets) in 100 ms. (396 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (41 resets) in 166 ms. (239 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40003 steps (63 resets) in 131 ms. (303 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40002 steps (97 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (103 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (106 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (98 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (117 resets) in 106 ms. (373 steps per ms) remains 8/8 properties
[2024-06-01 07:02:52] [INFO ] Invariant cache hit.
[2024-06-01 07:02:52] [INFO ] State equation strengthened by 281 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 39/67 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/68 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1348/1416 variables, 68/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1416 variables, 281/363 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1416 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/1416 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1416/1416 variables, and 363 constraints, problems are : Problem set: 0 solved, 8 unsolved in 944 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 281/281 constraints, PredecessorRefiner: 8/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 39/67 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/68 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1348/1416 variables, 68/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1416 variables, 281/363 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1416 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/1416 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1416/1416 variables, and 363 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1307 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 281/281 constraints, PredecessorRefiner: 8/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2447ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 2 properties in 10458 ms.
Support contains 13 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 1348/1348 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 68 transition count 1347
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 67 transition count 1347
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 6 place count 65 transition count 1345
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 65 transition count 1342
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 42 place count 62 transition count 1312
Applied a total of 42 rules in 266 ms. Remains 62 /68 variables (removed 6) and now considering 1312/1348 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 266 ms. Remains : 62/68 places, 1312/1348 transitions.
RANDOM walk for 40000 steps (25 resets) in 1559 ms. (25 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (79 resets) in 107 ms. (370 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (89 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (94 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (89 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (63 resets) in 108 ms. (367 steps per ms) remains 5/5 properties
// Phase 1: matrix 1312 rows 62 cols
[2024-06-01 07:03:06] [INFO ] Computed 14 invariants in 10 ms
[2024-06-01 07:03:06] [INFO ] State equation strengthened by 251 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 25/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 26/62 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1312/1374 variables, 62/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1374 variables, 251/327 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1374 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1374 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1374/1374 variables, and 327 constraints, problems are : Problem set: 0 solved, 5 unsolved in 683 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 62/62 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 25/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 26/62 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1312/1374 variables, 62/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1374 variables, 251/327 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1374 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1374 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1374/1374 variables, and 327 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1014 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 62/62 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1821ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 5732 ms.
Support contains 11 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 1312/1312 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 1301
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 1301
Applied a total of 2 rules in 116 ms. Remains 61 /62 variables (removed 1) and now considering 1301/1312 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 61/62 places, 1301/1312 transitions.
RANDOM walk for 40000 steps (61 resets) in 1281 ms. (31 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (83 resets) in 140 ms. (283 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (92 resets) in 138 ms. (287 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (95 resets) in 142 ms. (279 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (88 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (59 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 361261 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 5
Probabilistic random walk after 361261 steps, saw 57395 distinct states, run finished after 3008 ms. (steps per millisecond=120 ) properties seen :0
// Phase 1: matrix 1301 rows 61 cols
[2024-06-01 07:03:17] [INFO ] Computed 14 invariants in 10 ms
[2024-06-01 07:03:17] [INFO ] State equation strengthened by 241 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 25/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 25/61 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1301/1362 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1362 variables, 241/316 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1362 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1362 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1362/1362 variables, and 316 constraints, problems are : Problem set: 0 solved, 5 unsolved in 696 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 61/61 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 25/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 25/61 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1301/1362 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1362 variables, 241/316 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1362 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1362 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1362/1362 variables, and 316 constraints, problems are : Problem set: 0 solved, 5 unsolved in 961 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 61/61 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1762ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 5462 ms.
Support contains 11 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1301/1301 transitions.
Applied a total of 0 rules in 87 ms. Remains 61 /61 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 61/61 places, 1301/1301 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1301/1301 transitions.
Applied a total of 0 rules in 86 ms. Remains 61 /61 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2024-06-01 07:03:24] [INFO ] Invariant cache hit.
[2024-06-01 07:03:25] [INFO ] Implicit Places using invariants in 675 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 679 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/61 places, 1301/1301 transitions.
Applied a total of 0 rules in 89 ms. Remains 60 /60 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 855 ms. Remains : 60/61 places, 1301/1301 transitions.
RANDOM walk for 40000 steps (84 resets) in 1093 ms. (36 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (81 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (87 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (91 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (98 resets) in 110 ms. (360 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (72 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 385115 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 5
Probabilistic random walk after 385115 steps, saw 60666 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
// Phase 1: matrix 1301 rows 60 cols
[2024-06-01 07:03:29] [INFO ] Computed 13 invariants in 11 ms
[2024-06-01 07:03:29] [INFO ] State equation strengthened by 241 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 25/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 24/60 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1301/1361 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1361 variables, 241/314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1361 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1361 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1361/1361 variables, and 314 constraints, problems are : Problem set: 0 solved, 5 unsolved in 706 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 60/60 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 25/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 24/60 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1301/1361 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1361 variables, 241/314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1361 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1361 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1361/1361 variables, and 314 constraints, problems are : Problem set: 0 solved, 5 unsolved in 992 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 60/60 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1812ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 2800 ms.
Support contains 11 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1301/1301 transitions.
Applied a total of 0 rules in 86 ms. Remains 60 /60 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 60/60 places, 1301/1301 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1301/1301 transitions.
Applied a total of 0 rules in 92 ms. Remains 60 /60 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2024-06-01 07:03:33] [INFO ] Invariant cache hit.
[2024-06-01 07:03:34] [INFO ] Implicit Places using invariants in 629 ms returned []
[2024-06-01 07:03:34] [INFO ] Invariant cache hit.
[2024-06-01 07:03:34] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 07:03:35] [INFO ] Implicit Places using invariants and state equation in 1190 ms returned []
Implicit Place search using SMT with State Equation took 1821 ms to find 0 implicit places.
[2024-06-01 07:03:35] [INFO ] Redundant transitions in 111 ms returned []
Running 1300 sub problems to find dead transitions.
[2024-06-01 07:03:35] [INFO ] Invariant cache hit.
[2024-06-01 07:03:35] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
[2024-06-01 07:04:23] [INFO ] Deduced a trap composed of 23 places in 1429 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 60/1361 variables, and 14 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 30089 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/60 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 1300/35 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 4 (OVERLAPS) 1301/1361 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1361 variables, 241/315 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1361 variables, 35/350 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1361/1361 variables, and 350 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 60/60 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1300/35 constraints, Known Traps: 1/1 constraints]
After SMT, in 85283ms problems are : Problem set: 0 solved, 1300 unsolved
Search for dead transitions found 0 dead transitions in 85308ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87352 ms. Remains : 60/60 places, 1301/1301 transitions.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
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' '!(X(G(p0)))'
Support contains 11 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 1387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 1387
Applied a total of 10 rules in 20 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-06-01 07:05:01] [INFO ] Computed 12 invariants in 15 ms
[2024-06-01 07:05:02] [INFO ] Implicit Places using invariants in 836 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 847 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/89 places, 1387/1442 transitions.
Applied a total of 0 rules in 8 ms. Remains 83 /83 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 878 ms. Remains : 83/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 292 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-00
Product exploration explored 100000 steps with 1563 reset in 1212 ms.
Product exploration explored 100000 steps with 394 reset in 369 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (1850 resets) in 1282 ms. (31 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (136 resets) in 306 ms. (130 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 644739 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :0 out of 1
Probabilistic random walk after 644739 steps, saw 80101 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
// Phase 1: matrix 1387 rows 83 cols
[2024-06-01 07:05:08] [INFO ] Computed 11 invariants in 13 ms
[2024-06-01 07:05:08] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/62 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/74 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1380/1454 variables, 74/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1454 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/1468 variables, 8/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1468 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1469 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1469 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/1470 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1470 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1470 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1470/1470 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 599 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/62 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/74 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1380/1454 variables, 74/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1454 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/1468 variables, 8/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1468 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1469 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1469 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/1470 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1470 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1470 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1470/1470 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 890 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1534ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 187 ms.
Support contains 11 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 1387/1387 transitions.
Graph (complete) has 1092 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 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 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 82 transition count 1373
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 24 place count 72 transition count 1373
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 24 place count 72 transition count 1370
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 30 place count 69 transition count 1370
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 68 transition count 1369
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 68 transition count 1369
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 67 transition count 1368
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 44 place count 67 transition count 1358
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 2 with 110 rules applied. Total rules applied 154 place count 57 transition count 1258
Applied a total of 154 rules in 305 ms. Remains 57 /83 variables (removed 26) and now considering 1258/1387 (removed 129) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 306 ms. Remains : 57/83 places, 1258/1387 transitions.
RANDOM walk for 40000 steps (9 resets) in 1214 ms. (32 steps per ms) remains 1/1 properties
BEST_FIRST walk for 3776 steps (1 resets) in 26 ms. (139 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10a-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10a-LTLFireability-00 finished in 9129 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G((p0||F(p1))))&&F(p2))))'
Support contains 17 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 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 89 transition count 1434
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 81 transition count 1433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 80 transition count 1433
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 80 transition count 1431
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 78 transition count 1431
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 27 place count 73 transition count 1376
Iterating global reduction 3 with 5 rules applied. Total rules applied 32 place count 73 transition count 1376
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 3 with 2 rules applied. Total rules applied 34 place count 72 transition count 1375
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 71 transition count 1375
Applied a total of 36 rules in 585 ms. Remains 71 /89 variables (removed 18) and now considering 1375/1442 (removed 67) transitions.
// Phase 1: matrix 1375 rows 71 cols
[2024-06-01 07:05:11] [INFO ] Computed 12 invariants in 9 ms
[2024-06-01 07:05:11] [INFO ] Implicit Places using invariants in 541 ms returned []
[2024-06-01 07:05:11] [INFO ] Invariant cache hit.
[2024-06-01 07:05:12] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-06-01 07:05:13] [INFO ] Implicit Places using invariants and state equation in 1367 ms returned []
Implicit Place search using SMT with State Equation took 1921 ms to find 0 implicit places.
[2024-06-01 07:05:13] [INFO ] Redundant transitions in 95 ms returned []
Running 1374 sub problems to find dead transitions.
[2024-06-01 07:05:13] [INFO ] Invariant cache hit.
[2024-06-01 07:05:13] [INFO ] State equation strengthened by 305 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 3 (OVERLAPS) 1374/1445 variables, 71/83 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
SMT process timed out in 56201ms, After SMT, problems are : Problem set: 0 solved, 1374 unsolved
Search for dead transitions found 0 dead transitions in 56236ms
Starting structural reductions in SI_LTL mode, iteration 1 : 71/89 places, 1375/1442 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58886 ms. Remains : 71/89 places, 1375/1442 transitions.
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-02
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-02 finished in 59224 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)&&(!p2 U (p3||G(!p2))))))'
Support contains 21 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 1387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 1387
Applied a total of 10 rules in 12 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-06-01 07:06:10] [INFO ] Computed 12 invariants in 13 ms
[2024-06-01 07:06:10] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-06-01 07:06:10] [INFO ] Invariant cache hit.
[2024-06-01 07:06:10] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-06-01 07:06:11] [INFO ] Implicit Places using invariants and state equation in 971 ms returned []
Implicit Place search using SMT with State Equation took 1245 ms to find 0 implicit places.
Running 1386 sub problems to find dead transitions.
[2024-06-01 07:06:11] [INFO ] Invariant cache hit.
[2024-06-01 07:06:11] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 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 84/1471 variables, and 12 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/84 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 1386/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 3 (OVERLAPS) 1386/1470 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1470 variables, 302/398 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1470/1471 variables, and 458 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30233 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 302/303 constraints, PredecessorRefiner: 1386/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 84508ms problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 84548ms
Starting structural reductions in LTL mode, iteration 1 : 84/89 places, 1387/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85811 ms. Remains : 84/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) p2)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-03
Product exploration timeout after 69510 steps with 34755 reset in 10001 ms.
Product exploration timeout after 77900 steps with 38950 reset in 10001 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 p3 (NOT p2) (NOT p0) p1), (X (NOT p2)), (X p3), (X (NOT p0)), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 33 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10a-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10a-LTLFireability-03 finished in 106155 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((F(G(p0))&&F(p1))) U p2)))'
Support contains 8 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 87 transition count 1420
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 87 transition count 1420
Applied a total of 4 rules in 31 ms. Remains 87 /89 variables (removed 2) and now considering 1420/1442 (removed 22) transitions.
// Phase 1: matrix 1420 rows 87 cols
[2024-06-01 07:07:56] [INFO ] Computed 12 invariants in 9 ms
[2024-06-01 07:07:56] [INFO ] Implicit Places using invariants in 710 ms returned []
[2024-06-01 07:07:56] [INFO ] Invariant cache hit.
[2024-06-01 07:07:57] [INFO ] State equation strengthened by 333 read => feed constraints.
[2024-06-01 07:07:58] [INFO ] Implicit Places using invariants and state equation in 2084 ms returned []
Implicit Place search using SMT with State Equation took 2803 ms to find 0 implicit places.
Running 1419 sub problems to find dead transitions.
[2024-06-01 07:07:59] [INFO ] Invariant cache hit.
[2024-06-01 07:07:59] [INFO ] State equation strengthened by 333 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1419 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 87/1507 variables, and 12 constraints, problems are : Problem set: 0 solved, 1419 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/87 constraints, ReadFeed: 0/333 constraints, PredecessorRefiner: 1419/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1419 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1419 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1419 unsolved
SMT process timed out in 86179ms, After SMT, problems are : Problem set: 0 solved, 1419 unsolved
Search for dead transitions found 0 dead transitions in 86211ms
Starting structural reductions in LTL mode, iteration 1 : 87/89 places, 1420/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89055 ms. Remains : 87/89 places, 1420/1442 transitions.
Stuttering acceptance computed with spot in 281 ms :[(NOT p2), (NOT p2), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-04
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-04 finished in 89377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0 U p1)) U !p0)))'
Support contains 15 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 85 transition count 1398
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 85 transition count 1398
Applied a total of 8 rules in 20 ms. Remains 85 /89 variables (removed 4) and now considering 1398/1442 (removed 44) transitions.
// Phase 1: matrix 1398 rows 85 cols
[2024-06-01 07:09:25] [INFO ] Computed 12 invariants in 12 ms
[2024-06-01 07:09:26] [INFO ] Implicit Places using invariants in 544 ms returned []
[2024-06-01 07:09:26] [INFO ] Invariant cache hit.
[2024-06-01 07:09:26] [INFO ] State equation strengthened by 313 read => feed constraints.
[2024-06-01 07:09:27] [INFO ] Implicit Places using invariants and state equation in 1034 ms returned []
Implicit Place search using SMT with State Equation took 1581 ms to find 0 implicit places.
Running 1397 sub problems to find dead transitions.
[2024-06-01 07:09:27] [INFO ] Invariant cache hit.
[2024-06-01 07:09:27] [INFO ] State equation strengthened by 313 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
SMT process timed out in 55003ms, After SMT, problems are : Problem set: 0 solved, 1397 unsolved
Search for dead transitions found 0 dead transitions in 55020ms
Starting structural reductions in LTL mode, iteration 1 : 85/89 places, 1398/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56628 ms. Remains : 85/89 places, 1398/1442 transitions.
Stuttering acceptance computed with spot in 246 ms :[p0, p0, (NOT p1), (NOT p1), true]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-05
Product exploration timeout after 75060 steps with 37530 reset in 10002 ms.
Product exploration timeout after 75740 steps with 37870 reset in 10001 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 (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 25 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10a-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10a-LTLFireability-05 finished in 76964 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(p1)&&p0)))'
Support contains 11 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 89 transition count 1432
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 79 transition count 1432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 79 transition count 1430
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 24 place count 77 transition count 1430
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 72 transition count 1375
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 72 transition count 1375
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 36 place count 71 transition count 1374
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 70 transition count 1374
Applied a total of 38 rules in 344 ms. Remains 70 /89 variables (removed 19) and now considering 1374/1442 (removed 68) transitions.
// Phase 1: matrix 1374 rows 70 cols
[2024-06-01 07:10:42] [INFO ] Computed 12 invariants in 12 ms
[2024-06-01 07:10:43] [INFO ] Implicit Places using invariants in 693 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 698 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/89 places, 1374/1442 transitions.
Applied a total of 0 rules in 110 ms. Remains 69 /69 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1155 ms. Remains : 69/89 places, 1374/1442 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-06
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-06 finished in 1304 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(p1)||p0)))'
Support contains 18 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 89 transition count 1432
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 79 transition count 1432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 79 transition count 1430
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 24 place count 77 transition count 1430
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 72 transition count 1375
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 72 transition count 1375
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 36 place count 71 transition count 1374
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 2 with 2 rules applied. Total rules applied 38 place count 70 transition count 1374
Applied a total of 38 rules in 329 ms. Remains 70 /89 variables (removed 19) and now considering 1374/1442 (removed 68) transitions.
[2024-06-01 07:10:44] [INFO ] Invariant cache hit.
[2024-06-01 07:10:44] [INFO ] Implicit Places using invariants in 325 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 329 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/89 places, 1374/1442 transitions.
Applied a total of 0 rules in 100 ms. Remains 69 /69 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 763 ms. Remains : 69/89 places, 1374/1442 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-07
Product exploration explored 100000 steps with 994 reset in 631 ms.
Product exploration explored 100000 steps with 1138 reset in 633 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 : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (2236 resets) in 2446 ms. (16 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (42 resets) in 300 ms. (132 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (133 resets) in 312 ms. (127 steps per ms) remains 1/2 properties
// Phase 1: matrix 1374 rows 69 cols
[2024-06-01 07:10:47] [INFO ] Computed 11 invariants in 16 ms
[2024-06-01 07:10:47] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/52 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/63 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1371/1434 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1434 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/1442 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1442 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1443 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1443 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1443 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1443/1443 variables, and 81 constraints, problems are : Problem set: 0 solved, 1 unsolved in 816 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 52/1443 variables, and 10 constraints, problems are : Problem set: 1 solved, 0 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, State Equation: 0/69 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 923ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 18 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10a-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10a-LTLFireability-07 finished in 4446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&G(p1))))'
Support contains 17 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 1387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 1387
Applied a total of 10 rules in 18 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-06-01 07:10:48] [INFO ] Computed 12 invariants in 12 ms
[2024-06-01 07:10:48] [INFO ] Implicit Places using invariants in 674 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 682 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/89 places, 1387/1442 transitions.
Applied a total of 0 rules in 8 ms. Remains 83 /83 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 710 ms. Remains : 83/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 238 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-08
Entered a terminal (fully accepting) state of product in 9104 steps with 420 reset in 330 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-08 finished in 1304 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&&(!p1 U (G(!p1)||(!p1&&(!p2 U (p3||G(!p2))))))))))'
Support contains 19 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 1387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 1387
Applied a total of 10 rules in 17 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
[2024-06-01 07:10:49] [INFO ] Invariant cache hit.
[2024-06-01 07:10:50] [INFO ] Implicit Places using invariants in 512 ms returned []
[2024-06-01 07:10:50] [INFO ] Invariant cache hit.
[2024-06-01 07:10:50] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-06-01 07:10:51] [INFO ] Implicit Places using invariants and state equation in 1320 ms returned []
Implicit Place search using SMT with State Equation took 1838 ms to find 0 implicit places.
Running 1386 sub problems to find dead transitions.
[2024-06-01 07:10:51] [INFO ] Invariant cache hit.
[2024-06-01 07:10:51] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 84/1471 variables, and 12 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/84 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 1386/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1470/1471 variables, and 96 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 1326/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 85468ms problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 85496ms
Starting structural reductions in LTL mode, iteration 1 : 84/89 places, 1387/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87357 ms. Remains : 84/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (OR (AND (NOT p0) p2 (NOT p3)) (AND p1 p2 (NOT p3)))]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-09
Product exploration explored 100000 steps with 1463 reset in 1204 ms.
Product exploration explored 100000 steps with 2225 reset in 1231 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 (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (AND p0 (NOT p3) (NOT p2) (NOT p1))), (X (NOT (OR (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 147 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (OR (AND (NOT p0) p2 (NOT p3)) (AND p1 p2 (NOT p3)))]
RANDOM walk for 40000 steps (1834 resets) in 3185 ms. (12 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (104 resets) in 269 ms. (148 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (42 resets) in 640 ms. (62 steps per ms) remains 7/13 properties
BEST_FIRST walk for 40004 steps (101 resets) in 1038 ms. (38 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (100 resets) in 376 ms. (106 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (103 resets) in 284 ms. (140 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (103 resets) in 293 ms. (136 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (102 resets) in 338 ms. (118 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (98 resets) in 246 ms. (161 steps per ms) remains 4/7 properties
[2024-06-01 07:12:22] [INFO ] Invariant cache hit.
[2024-06-01 07:12:22] [INFO ] State equation strengthened by 303 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf3 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 57/76 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1380/1456 variables, 76/88 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1456 variables, 302/390 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1456 variables, 0/390 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 13/1469 variables, 7/397 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1469 variables, 0/397 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1470 variables, 1/398 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1470 variables, 0/398 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1471 variables, 1/399 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 399 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1139 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 59/76 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1380/1456 variables, 76/88 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1456 variables, 302/390 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1456 variables, 0/390 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 13/1469 variables, 7/397 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1469 variables, 0/397 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1470 variables, 1/398 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1470 variables, 0/398 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1471 variables, 1/399 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 399 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1350 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2662ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 895 ms.
Support contains 17 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Graph (complete) has 1126 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 83 transition count 1375
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 20 place count 75 transition count 1375
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 20 place count 75 transition count 1372
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 26 place count 72 transition count 1372
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 71 transition count 1371
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 71 transition count 1371
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 30 place count 70 transition count 1370
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 40 place count 70 transition count 1360
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 130 place count 60 transition count 1280
Applied a total of 130 rules in 226 ms. Remains 60 /84 variables (removed 24) and now considering 1280/1387 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 60/84 places, 1280/1387 transitions.
RANDOM walk for 40000 steps (50 resets) in 2554 ms. (15 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (48 resets) in 229 ms. (173 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (44 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 341262 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 2
Probabilistic random walk after 341262 steps, saw 50915 distinct states, run finished after 3004 ms. (steps per millisecond=113 ) properties seen :0
// Phase 1: matrix 1280 rows 60 cols
[2024-06-01 07:12:29] [INFO ] Computed 14 invariants in 15 ms
[2024-06-01 07:12:29] [INFO ] State equation strengthened by 221 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/59 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1280/1340 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1340 variables, 221/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1340 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1340 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1340/1340 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 831 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 60/60 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/59 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1280/1340 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1340 variables, 221/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1340 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1340 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1340/1340 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 60/60 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1930ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1041 ms.
Support contains 17 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1280/1280 transitions.
Applied a total of 0 rules in 116 ms. Remains 60 /60 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 60/60 places, 1280/1280 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1280/1280 transitions.
Applied a total of 0 rules in 116 ms. Remains 60 /60 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
[2024-06-01 07:12:33] [INFO ] Invariant cache hit.
[2024-06-01 07:12:33] [INFO ] Implicit Places using invariants in 498 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 504 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/60 places, 1280/1280 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 58 transition count 1279
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 1279
Applied a total of 2 rules in 136 ms. Remains 58 /59 variables (removed 1) and now considering 1279/1280 (removed 1) transitions.
// Phase 1: matrix 1279 rows 58 cols
[2024-06-01 07:12:33] [INFO ] Computed 13 invariants in 11 ms
[2024-06-01 07:12:34] [INFO ] Implicit Places using invariants in 494 ms returned []
[2024-06-01 07:12:34] [INFO ] Invariant cache hit.
[2024-06-01 07:12:34] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-06-01 07:12:35] [INFO ] Implicit Places using invariants and state equation in 1217 ms returned []
Implicit Place search using SMT with State Equation took 1714 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 58/60 places, 1279/1280 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2474 ms. Remains : 58/60 places, 1279/1280 transitions.
RANDOM walk for 40000 steps (23 resets) in 2909 ms. (13 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (49 resets) in 210 ms. (189 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (43 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 339917 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 2
Probabilistic random walk after 339917 steps, saw 50766 distinct states, run finished after 3004 ms. (steps per millisecond=113 ) properties seen :0
[2024-06-01 07:12:39] [INFO ] Invariant cache hit.
[2024-06-01 07:12:39] [INFO ] State equation strengthened by 221 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/58 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1279/1337 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1337 variables, 221/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1337 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/1337 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1337/1337 variables, and 292 constraints, problems are : Problem set: 0 solved, 2 unsolved in 760 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/58 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1279/1337 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1337 variables, 221/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1337 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/1337 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1337/1337 variables, and 292 constraints, problems are : Problem set: 0 solved, 2 unsolved in 962 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1777ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 889 steps, including 197 resets, run visited all 2 properties in 134 ms. (steps per millisecond=6 )
Parikh walk visited 2 properties in 148 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (AND p0 (NOT p3) (NOT p2) (NOT p1))), (X (NOT (OR (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (G (AND (OR p0 (NOT p2) p3) (OR (NOT p1) (NOT p2) p3))), (G (OR (NOT p1) (NOT p2) p3))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F p1), (F p2), (F (NOT (OR (NOT p1) p2 p3))), (F p3), (F (NOT p0)), (F (NOT (AND (OR p0 p2 p3) (OR (NOT p1) p2 p3))))]
Knowledge based reduction with 21 factoid took 735 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Support contains 19 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-06-01 07:12:42] [INFO ] Computed 12 invariants in 8 ms
[2024-06-01 07:12:43] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-06-01 07:12:43] [INFO ] Invariant cache hit.
[2024-06-01 07:12:43] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-06-01 07:12:43] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1281 ms to find 0 implicit places.
Running 1386 sub problems to find dead transitions.
[2024-06-01 07:12:43] [INFO ] Invariant cache hit.
[2024-06-01 07:12:43] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 3 (OVERLAPS) 1386/1470 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
SMT process timed out in 54966ms, After SMT, problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 54985ms
Finished structural reductions in LTL mode , in 1 iterations and 56287 ms. Remains : 84/84 places, 1387/1387 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 p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (AND p0 (NOT p2) (NOT p3) (NOT p1))), (X (NOT (OR (NOT p0) p1))), (X (NOT (AND p0 p2 (NOT p3) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (X (AND (NOT p2) (NOT p3) (NOT p1)))), (X (X (NOT (OR (NOT p0) p1)))), (X (X (NOT (AND p0 p2 (NOT p3) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 134 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
RANDOM walk for 40000 steps (1831 resets) in 3399 ms. (11 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (100 resets) in 166 ms. (239 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (52 resets) in 197 ms. (202 steps per ms) remains 6/12 properties
BEST_FIRST walk for 40004 steps (101 resets) in 191 ms. (208 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (100 resets) in 254 ms. (156 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (99 resets) in 256 ms. (155 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (100 resets) in 173 ms. (229 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (99 resets) in 252 ms. (158 steps per ms) remains 6/6 properties
[2024-06-01 07:13:40] [INFO ] Invariant cache hit.
[2024-06-01 07:13:40] [INFO ] State equation strengthened by 303 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 57/76 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1380/1456 variables, 76/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1456 variables, 302/390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1456 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 13/1469 variables, 7/397 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1469 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/1470 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1470 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/1471 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 399 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1530 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 57/76 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1380/1456 variables, 76/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1456 variables, 302/390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1456 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 13/1469 variables, 7/397 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1469 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/1470 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1470 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/1471 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 399 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1844 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3519ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3245 ms.
Support contains 19 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Graph (complete) has 1126 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 83 transition count 1376
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 19 place count 76 transition count 1375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 75 transition count 1375
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 20 place count 75 transition count 1372
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 26 place count 72 transition count 1372
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 71 transition count 1371
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 71 transition count 1371
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 30 place count 70 transition count 1370
Free-agglomeration rule applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 39 place count 70 transition count 1361
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 3 with 79 rules applied. Total rules applied 118 place count 61 transition count 1291
Applied a total of 118 rules in 229 ms. Remains 61 /84 variables (removed 23) and now considering 1291/1387 (removed 96) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230 ms. Remains : 61/84 places, 1291/1387 transitions.
RANDOM walk for 40000 steps (102 resets) in 2724 ms. (14 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (95 resets) in 169 ms. (235 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (65 resets) in 237 ms. (168 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (103 resets) in 241 ms. (165 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (106 resets) in 260 ms. (153 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (66 resets) in 268 ms. (148 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (104 resets) in 346 ms. (115 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 233867 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 6
Probabilistic random walk after 233867 steps, saw 36720 distinct states, run finished after 3004 ms. (steps per millisecond=77 ) properties seen :0
// Phase 1: matrix 1291 rows 61 cols
[2024-06-01 07:13:52] [INFO ] Computed 14 invariants in 13 ms
[2024-06-01 07:13:52] [INFO ] State equation strengthened by 231 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 41/60 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1291/1352 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1352 variables, 231/306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1352 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/1352 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1352/1352 variables, and 306 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1012 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 61/61 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 41/60 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1291/1352 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1352 variables, 231/306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1352 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/1352 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1352/1352 variables, and 306 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1529 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 61/61 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2724ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1972 ms.
Support contains 19 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1291/1291 transitions.
Applied a total of 0 rules in 70 ms. Remains 61 /61 variables (removed 0) and now considering 1291/1291 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 61/61 places, 1291/1291 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1291/1291 transitions.
Applied a total of 0 rules in 70 ms. Remains 61 /61 variables (removed 0) and now considering 1291/1291 (removed 0) transitions.
[2024-06-01 07:13:57] [INFO ] Invariant cache hit.
[2024-06-01 07:13:57] [INFO ] Implicit Places using invariants in 325 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 328 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/61 places, 1291/1291 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 1290
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 1290
Applied a total of 2 rules in 85 ms. Remains 59 /60 variables (removed 1) and now considering 1290/1291 (removed 1) transitions.
// Phase 1: matrix 1290 rows 59 cols
[2024-06-01 07:13:57] [INFO ] Computed 13 invariants in 12 ms
[2024-06-01 07:13:58] [INFO ] Implicit Places using invariants in 497 ms returned []
[2024-06-01 07:13:58] [INFO ] Invariant cache hit.
[2024-06-01 07:13:58] [INFO ] State equation strengthened by 231 read => feed constraints.
[2024-06-01 07:13:59] [INFO ] Implicit Places using invariants and state equation in 1221 ms returned []
Implicit Place search using SMT with State Equation took 1722 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 59/61 places, 1290/1291 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2207 ms. Remains : 59/61 places, 1290/1291 transitions.
RANDOM walk for 40000 steps (78 resets) in 3209 ms. (12 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (92 resets) in 161 ms. (246 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (77 resets) in 226 ms. (176 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40003 steps (71 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
[2024-06-01 07:14:00] [INFO ] Invariant cache hit.
[2024-06-01 07:14:00] [INFO ] State equation strengthened by 231 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/59 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1290/1349 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1349 variables, 231/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1349 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/1349 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1349/1349 variables, and 303 constraints, problems are : Problem set: 0 solved, 2 unsolved in 736 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 59/59 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/59 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1290/1349 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1349 variables, 231/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1349 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/1349 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1349/1349 variables, and 303 constraints, problems are : Problem set: 0 solved, 2 unsolved in 991 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 59/59 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1781ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1019 ms.
Support contains 17 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 1290/1290 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 59 transition count 1289
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 58 transition count 1279
Applied a total of 12 rules in 267 ms. Remains 58 /59 variables (removed 1) and now considering 1279/1290 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 268 ms. Remains : 58/59 places, 1279/1290 transitions.
RANDOM walk for 40000 steps (18 resets) in 2714 ms. (14 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (50 resets) in 178 ms. (223 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (48 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 350988 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 2
Probabilistic random walk after 350988 steps, saw 53321 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
// Phase 1: matrix 1279 rows 58 cols
[2024-06-01 07:14:07] [INFO ] Computed 13 invariants in 7 ms
[2024-06-01 07:14:07] [INFO ] State equation strengthened by 221 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/58 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1279/1337 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1337 variables, 221/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1337 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/1337 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1337/1337 variables, and 292 constraints, problems are : Problem set: 0 solved, 2 unsolved in 789 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/58 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1279/1337 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1337 variables, 221/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1337 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/1337 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1337/1337 variables, and 292 constraints, problems are : Problem set: 0 solved, 2 unsolved in 984 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1846ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 970 ms.
Support contains 17 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 69 ms. Remains 58 /58 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 58/58 places, 1279/1279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 72 ms. Remains 58 /58 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
[2024-06-01 07:14:10] [INFO ] Invariant cache hit.
[2024-06-01 07:14:10] [INFO ] Implicit Places using invariants in 412 ms returned []
[2024-06-01 07:14:10] [INFO ] Invariant cache hit.
[2024-06-01 07:14:11] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-06-01 07:14:12] [INFO ] Implicit Places using invariants and state equation in 1227 ms returned []
Implicit Place search using SMT with State Equation took 1643 ms to find 0 implicit places.
[2024-06-01 07:14:12] [INFO ] Redundant transitions in 72 ms returned []
Running 1278 sub problems to find dead transitions.
[2024-06-01 07:14:12] [INFO ] Invariant cache hit.
[2024-06-01 07:14:12] [INFO ] State equation strengthened by 221 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 23 places in 1522 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 58/1337 variables, and 14 constraints, problems are : Problem set: 0 solved, 1278 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/58 constraints, ReadFeed: 0/221 constraints, PredecessorRefiner: 1278/33 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 4 (OVERLAPS) 1279/1337 variables, 58/72 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1337 variables, 221/293 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1337 variables, 33/326 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1337/1337 variables, and 326 constraints, problems are : Problem set: 0 solved, 1278 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 1278/33 constraints, Known Traps: 1/1 constraints]
After SMT, in 84574ms problems are : Problem set: 0 solved, 1278 unsolved
Search for dead transitions found 0 dead transitions in 84601ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86408 ms. Remains : 58/58 places, 1279/1279 transitions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (AND p0 (NOT p2) (NOT p3) (NOT p1))), (X (NOT (OR (NOT p0) p1))), (X (NOT (AND p0 p2 (NOT p3) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (X (AND (NOT p2) (NOT p3) (NOT p1)))), (X (X (NOT (OR (NOT p0) p1)))), (X (X (NOT (AND p0 p2 (NOT p3) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p3))), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F p3), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT (AND (OR p0 p3) (OR (NOT p1) p3)))), (F (NOT p0))]
Knowledge based reduction with 19 factoid took 486 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 337 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Product exploration explored 100000 steps with 1352 reset in 758 ms.
Product exploration explored 100000 steps with 148 reset in 197 ms.
Support contains 19 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-06-01 07:15:39] [INFO ] Computed 12 invariants in 8 ms
[2024-06-01 07:15:39] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-06-01 07:15:39] [INFO ] Invariant cache hit.
[2024-06-01 07:15:40] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-06-01 07:15:40] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1282 ms to find 0 implicit places.
Running 1386 sub problems to find dead transitions.
[2024-06-01 07:15:40] [INFO ] Invariant cache hit.
[2024-06-01 07:15:40] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 84/1471 variables, and 12 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/84 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 1386/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 3 (OVERLAPS) 1386/1470 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1470 variables, 302/398 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1470/1471 variables, and 458 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30169 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 302/303 constraints, PredecessorRefiner: 1386/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 85434ms problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 85452ms
Finished structural reductions in LTL mode , in 1 iterations and 86742 ms. Remains : 84/84 places, 1387/1387 transitions.
Treatment of property AutonomousCar-PT-10a-LTLFireability-09 finished in 377288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 15 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 1387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 1387
Applied a total of 10 rules in 12 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
[2024-06-01 07:17:06] [INFO ] Invariant cache hit.
[2024-06-01 07:17:07] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-06-01 07:17:07] [INFO ] Invariant cache hit.
[2024-06-01 07:17:07] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-06-01 07:17:08] [INFO ] Implicit Places using invariants and state equation in 1088 ms returned []
Implicit Place search using SMT with State Equation took 1494 ms to find 0 implicit places.
Running 1386 sub problems to find dead transitions.
[2024-06-01 07:17:08] [INFO ] Invariant cache hit.
[2024-06-01 07:17:08] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 84/1471 variables, and 12 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/84 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 1386/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 3 (OVERLAPS) 1386/1470 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1470 variables, 302/398 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1470/1471 variables, and 458 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30264 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 302/303 constraints, PredecessorRefiner: 1386/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 84078ms problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 84096ms
Starting structural reductions in LTL mode, iteration 1 : 84/89 places, 1387/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85610 ms. Remains : 84/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-10 finished in 85819 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(p1)) U p2))'
Support contains 17 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 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 89 transition count 1433
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 19 place count 80 transition count 1432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 79 transition count 1432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 20 place count 79 transition count 1430
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 24 place count 77 transition count 1430
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 28 place count 73 transition count 1386
Iterating global reduction 3 with 4 rules applied. Total rules applied 32 place count 73 transition count 1386
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 72 transition count 1385
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 71 transition count 1385
Applied a total of 36 rules in 307 ms. Remains 71 /89 variables (removed 18) and now considering 1385/1442 (removed 57) transitions.
// Phase 1: matrix 1385 rows 71 cols
[2024-06-01 07:18:32] [INFO ] Computed 12 invariants in 8 ms
[2024-06-01 07:18:33] [INFO ] Implicit Places using invariants in 535 ms returned []
[2024-06-01 07:18:33] [INFO ] Invariant cache hit.
[2024-06-01 07:18:34] [INFO ] State equation strengthened by 315 read => feed constraints.
[2024-06-01 07:18:34] [INFO ] Implicit Places using invariants and state equation in 1276 ms returned []
Implicit Place search using SMT with State Equation took 1820 ms to find 0 implicit places.
[2024-06-01 07:18:34] [INFO ] Redundant transitions in 83 ms returned []
Running 1384 sub problems to find dead transitions.
[2024-06-01 07:18:34] [INFO ] Invariant cache hit.
[2024-06-01 07:18:34] [INFO ] State equation strengthened by 315 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1384 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1384 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1384 unsolved
SMT process timed out in 54392ms, After SMT, problems are : Problem set: 0 solved, 1384 unsolved
Search for dead transitions found 0 dead transitions in 54418ms
Starting structural reductions in SI_LTL mode, iteration 1 : 71/89 places, 1385/1442 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56649 ms. Remains : 71/89 places, 1385/1442 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p2), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-12
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-12 finished in 56796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Support contains 16 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 89 transition count 1432
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 79 transition count 1432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 79 transition count 1430
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 24 place count 77 transition count 1430
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 72 transition count 1375
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 72 transition count 1375
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 36 place count 71 transition count 1374
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 70 transition count 1374
Applied a total of 38 rules in 285 ms. Remains 70 /89 variables (removed 19) and now considering 1374/1442 (removed 68) transitions.
// Phase 1: matrix 1374 rows 70 cols
[2024-06-01 07:19:29] [INFO ] Computed 12 invariants in 11 ms
[2024-06-01 07:19:30] [INFO ] Implicit Places using invariants in 708 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 712 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/89 places, 1374/1442 transitions.
Applied a total of 0 rules in 158 ms. Remains 69 /69 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1157 ms. Remains : 69/89 places, 1374/1442 transitions.
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-13
Product exploration explored 100000 steps with 315 reset in 357 ms.
Product exploration explored 100000 steps with 52 reset in 176 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 : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 137 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (2280 resets) in 2792 ms. (14 steps per ms) remains 1/1 properties
BEST_FIRST walk for 10031 steps (31 resets) in 44 ms. (222 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
Support contains 11 out of 69 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 1374/1374 transitions.
Applied a total of 0 rules in 94 ms. Remains 69 /69 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
// Phase 1: matrix 1374 rows 69 cols
[2024-06-01 07:19:33] [INFO ] Computed 11 invariants in 9 ms
[2024-06-01 07:19:33] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-06-01 07:19:33] [INFO ] Invariant cache hit.
[2024-06-01 07:19:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 07:19:34] [INFO ] Implicit Places using invariants and state equation in 1082 ms returned []
Implicit Place search using SMT with State Equation took 1438 ms to find 0 implicit places.
[2024-06-01 07:19:34] [INFO ] Redundant transitions in 211 ms returned []
Running 1373 sub problems to find dead transitions.
[2024-06-01 07:19:34] [INFO ] Invariant cache hit.
[2024-06-01 07:19:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1373/1442 variables, 69/80 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1442/1443 variables, and 80 constraints, problems are : Problem set: 0 solved, 1373 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 69/69 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1373/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 3 (OVERLAPS) 1373/1442 variables, 69/80 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1442 variables, 45/125 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1442/1443 variables, and 125 constraints, problems are : Problem set: 0 solved, 1373 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 69/69 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1373/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 85883ms problems are : Problem set: 0 solved, 1373 unsolved
Search for dead transitions found 0 dead transitions in 85911ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 87675 ms. Remains : 69/69 places, 1374/1374 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (2251 resets) in 1881 ms. (21 steps per ms) remains 1/1 properties
BEST_FIRST walk for 16914 steps (54 resets) in 87 ms. (192 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 709 reset in 640 ms.
Product exploration explored 100000 steps with 893 reset in 512 ms.
Support contains 11 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 1374/1374 transitions.
Applied a total of 0 rules in 102 ms. Remains 69 /69 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
[2024-06-01 07:21:03] [INFO ] Invariant cache hit.
[2024-06-01 07:21:03] [INFO ] Implicit Places using invariants in 482 ms returned []
[2024-06-01 07:21:03] [INFO ] Invariant cache hit.
[2024-06-01 07:21:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 07:21:04] [INFO ] Implicit Places using invariants and state equation in 1268 ms returned []
Implicit Place search using SMT with State Equation took 1760 ms to find 0 implicit places.
[2024-06-01 07:21:05] [INFO ] Redundant transitions in 109 ms returned []
Running 1373 sub problems to find dead transitions.
[2024-06-01 07:21:05] [INFO ] Invariant cache hit.
[2024-06-01 07:21:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 3 (OVERLAPS) 1373/1442 variables, 69/80 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1442/1443 variables, and 80 constraints, problems are : Problem set: 0 solved, 1373 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 69/69 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1373/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 3 (OVERLAPS) 1373/1442 variables, 69/80 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1442 variables, 45/125 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1442/1443 variables, and 125 constraints, problems are : Problem set: 0 solved, 1373 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 69/69 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1373/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 85515ms problems are : Problem set: 0 solved, 1373 unsolved
Search for dead transitions found 0 dead transitions in 85543ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 87530 ms. Remains : 69/69 places, 1374/1374 transitions.
Treatment of property AutonomousCar-PT-10a-LTLFireability-13 finished in 181381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X((p1&&F((G(F(!p2))||(!p3&&F(!p2)))))))))))'
Support contains 17 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 1387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 1387
Applied a total of 10 rules in 18 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-06-01 07:22:30] [INFO ] Computed 12 invariants in 13 ms
[2024-06-01 07:22:31] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-06-01 07:22:31] [INFO ] Invariant cache hit.
[2024-06-01 07:22:32] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-06-01 07:22:32] [INFO ] Implicit Places using invariants and state equation in 1349 ms returned []
Implicit Place search using SMT with State Equation took 1864 ms to find 0 implicit places.
Running 1386 sub problems to find dead transitions.
[2024-06-01 07:22:32] [INFO ] Invariant cache hit.
[2024-06-01 07:22:32] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 3 (OVERLAPS) 1386/1470 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
SMT process timed out in 55354ms, After SMT, problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 55383ms
Starting structural reductions in LTL mode, iteration 1 : 84/89 places, 1387/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57271 ms. Remains : 84/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p1) p2), p2, p2]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-14
Product exploration explored 100000 steps with 25000 reset in 7153 ms.
Product exploration explored 100000 steps with 25000 reset in 7365 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 (NOT p3) (NOT p2)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 369 ms :[(OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p1) p2), p2, p2]
RANDOM walk for 40000 steps (1828 resets) in 1842 ms. (21 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40003 steps (99 resets) in 340 ms. (117 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (143 resets) in 436 ms. (91 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (106 resets) in 324 ms. (123 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (99 resets) in 306 ms. (130 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (97 resets) in 294 ms. (135 steps per ms) remains 5/5 properties
[2024-06-01 07:23:44] [INFO ] Invariant cache hit.
[2024-06-01 07:23:44] [INFO ] State equation strengthened by 303 read => feed constraints.
Problem apf6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 59/76 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1380/1456 variables, 76/88 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1456 variables, 302/390 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1456 variables, 0/390 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 13/1469 variables, 7/397 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1469 variables, 0/397 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/1470 variables, 1/398 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1470 variables, 0/398 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/1471 variables, 1/399 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 399 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1441 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 59/76 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1380/1456 variables, 76/88 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1456 variables, 302/390 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1456 variables, 0/390 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 13/1469 variables, 7/397 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1469 variables, 0/397 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/1470 variables, 1/398 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1470 variables, 0/398 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/1471 variables, 1/399 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 399 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1595 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3211ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2334 ms.
Support contains 17 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Graph (complete) has 1126 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 83 transition count 1375
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 22 place count 75 transition count 1373
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 73 transition count 1373
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 24 place count 73 transition count 1370
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 70 transition count 1370
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 69 transition count 1369
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 69 transition count 1369
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 68 transition count 1368
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 42 place count 68 transition count 1360
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 3 with 88 rules applied. Total rules applied 130 place count 60 transition count 1280
Applied a total of 130 rules in 321 ms. Remains 60 /84 variables (removed 24) and now considering 1280/1387 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 321 ms. Remains : 60/84 places, 1280/1387 transitions.
RANDOM walk for 40000 steps (12 resets) in 3661 ms. (10 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (88 resets) in 197 ms. (202 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 246 ms. (161 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (92 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
// Phase 1: matrix 1280 rows 60 cols
[2024-06-01 07:23:51] [INFO ] Computed 14 invariants in 10 ms
[2024-06-01 07:23:51] [INFO ] State equation strengthened by 221 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) 21/27 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/60 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1280/1340 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1340 variables, 221/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1340 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1340 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1340/1340 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 618 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 60/60 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 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) 21/27 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/60 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1280/1340 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1340 variables, 221/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1340 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1340 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1340/1340 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1045 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 60/60 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1721ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1172 ms.
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1280/1280 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 58 transition count 1278
Applied a total of 4 rules in 173 ms. Remains 58 /60 variables (removed 2) and now considering 1278/1280 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 58/60 places, 1278/1280 transitions.
RANDOM walk for 40000 steps (12 resets) in 2933 ms. (13 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (104 resets) in 230 ms. (173 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (96 resets) in 214 ms. (186 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 284851 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 2
Probabilistic random walk after 284851 steps, saw 45184 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
// Phase 1: matrix 1278 rows 58 cols
[2024-06-01 07:23:58] [INFO ] Computed 14 invariants in 11 ms
[2024-06-01 07:23:58] [INFO ] State equation strengthened by 221 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) 33/58 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1278/1336 variables, 58/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1336 variables, 221/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1336 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1336 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 293 constraints, problems are : Problem set: 0 solved, 2 unsolved in 740 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 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) 33/58 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1278/1336 variables, 58/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1336 variables, 221/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1336 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1336 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 293 constraints, problems are : Problem set: 0 solved, 2 unsolved in 834 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1641ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 991 ms.
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1278/1278 transitions.
Applied a total of 0 rules in 82 ms. Remains 58 /58 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 58/58 places, 1278/1278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1278/1278 transitions.
Applied a total of 0 rules in 82 ms. Remains 58 /58 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
[2024-06-01 07:24:01] [INFO ] Invariant cache hit.
[2024-06-01 07:24:02] [INFO ] Implicit Places using invariants in 875 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 887 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 57/58 places, 1278/1278 transitions.
Applied a total of 0 rules in 153 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1123 ms. Remains : 57/58 places, 1278/1278 transitions.
RANDOM walk for 40000 steps (45 resets) in 2683 ms. (14 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (89 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (95 resets) in 190 ms. (209 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 310554 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 2
Probabilistic random walk after 310554 steps, saw 48720 distinct states, run finished after 3002 ms. (steps per millisecond=103 ) properties seen :0
// Phase 1: matrix 1278 rows 57 cols
[2024-06-01 07:24:06] [INFO ] Computed 13 invariants in 10 ms
[2024-06-01 07:24:06] [INFO ] State equation strengthened by 221 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) 32/57 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1278/1335 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 221/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1335 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1335 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1335/1335 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 786 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 57/57 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 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) 32/57 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1278/1335 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 221/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1335 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1335 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1335/1335 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 989 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 57/57 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1831ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1006 ms.
Support contains 6 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1278/1278 transitions.
Applied a total of 0 rules in 84 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 57/57 places, 1278/1278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1278/1278 transitions.
Applied a total of 0 rules in 81 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
[2024-06-01 07:24:09] [INFO ] Invariant cache hit.
[2024-06-01 07:24:10] [INFO ] Implicit Places using invariants in 917 ms returned []
[2024-06-01 07:24:10] [INFO ] Invariant cache hit.
[2024-06-01 07:24:10] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-06-01 07:24:12] [INFO ] Implicit Places using invariants and state equation in 1825 ms returned []
Implicit Place search using SMT with State Equation took 2745 ms to find 0 implicit places.
[2024-06-01 07:24:12] [INFO ] Redundant transitions in 73 ms returned []
Running 1277 sub problems to find dead transitions.
[2024-06-01 07:24:12] [INFO ] Invariant cache hit.
[2024-06-01 07:24:12] [INFO ] State equation strengthened by 221 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
[2024-06-01 07:24:58] [INFO ] Deduced a trap composed of 23 places in 1555 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 57/1335 variables, and 14 constraints, problems are : Problem set: 0 solved, 1277 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/57 constraints, ReadFeed: 0/221 constraints, PredecessorRefiner: 1277/32 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1277 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 4 (OVERLAPS) 1278/1335 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1335 variables, 221/292 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 32/324 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1335/1335 variables, and 324 constraints, problems are : Problem set: 0 solved, 1277 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 57/57 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 1277/32 constraints, Known Traps: 1/1 constraints]
After SMT, in 84779ms problems are : Problem set: 0 solved, 1277 unsolved
Search for dead transitions found 0 dead transitions in 84806ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87719 ms. Remains : 57/57 places, 1278/1278 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (X p0)), (G (OR p1 p0)), (G (OR (NOT p1) (NOT p3)))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p0)))), (F (NOT p0)), (F p3), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 208 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 222 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Support contains 6 out of 84 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Applied a total of 0 rules in 8 ms. Remains 84 /84 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-06-01 07:25:37] [INFO ] Computed 12 invariants in 8 ms
[2024-06-01 07:25:38] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-06-01 07:25:38] [INFO ] Invariant cache hit.
[2024-06-01 07:25:38] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-06-01 07:25:38] [INFO ] Implicit Places using invariants and state equation in 955 ms returned []
Implicit Place search using SMT with State Equation took 1297 ms to find 0 implicit places.
Running 1386 sub problems to find dead transitions.
[2024-06-01 07:25:39] [INFO ] Invariant cache hit.
[2024-06-01 07:25:39] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 84/1471 variables, and 12 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/84 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 1386/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 3 (OVERLAPS) 1386/1470 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1470 variables, 302/398 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1470 variables, 60/458 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1470/1471 variables, and 458 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 302/303 constraints, PredecessorRefiner: 1386/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 85754ms problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 85781ms
Finished structural reductions in LTL mode , in 1 iterations and 87094 ms. Remains : 84/84 places, 1387/1387 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 (NOT p2) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
RANDOM walk for 40000 steps (1838 resets) in 3264 ms. (12 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (100 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (93 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
[2024-06-01 07:27:06] [INFO ] Invariant cache hit.
[2024-06-01 07:27:06] [INFO ] State equation strengthened by 303 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) 21/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/75 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1378/1453 variables, 75/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1453 variables, 302/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1453 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 13/1466 variables, 5/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1466 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/1470 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1470 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/1471 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 399 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1347 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 2/0 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) 21/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/75 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1378/1453 variables, 75/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1453 variables, 302/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1453 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 13/1466 variables, 5/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1466 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/1470 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1470 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/1471 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 399 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1383 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2798ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1034 ms.
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Graph (complete) has 1126 edges and 84 vertex of which 83 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 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 83 transition count 1373
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 26 place count 73 transition count 1371
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 71 transition count 1371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 28 place count 71 transition count 1370
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 30 place count 70 transition count 1370
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 69 transition count 1369
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 69 transition count 1369
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 3 with 6 rules applied. Total rules applied 38 place count 66 transition count 1366
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 46 place count 66 transition count 1358
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 3 with 88 rules applied. Total rules applied 134 place count 58 transition count 1278
Applied a total of 134 rules in 256 ms. Remains 58 /84 variables (removed 26) and now considering 1278/1387 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 58/84 places, 1278/1387 transitions.
RANDOM walk for 40000 steps (26 resets) in 2703 ms. (14 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (99 resets) in 203 ms. (196 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (97 resets) in 224 ms. (177 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 316111 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 2
Probabilistic random walk after 316111 steps, saw 49565 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
// Phase 1: matrix 1278 rows 58 cols
[2024-06-01 07:27:14] [INFO ] Computed 14 invariants in 11 ms
[2024-06-01 07:27:14] [INFO ] State equation strengthened by 221 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) 33/58 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1278/1336 variables, 58/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1336 variables, 221/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1336 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1336 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 293 constraints, problems are : Problem set: 0 solved, 2 unsolved in 766 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 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) 33/58 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1278/1336 variables, 58/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1336 variables, 221/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1336 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1336 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 293 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1000 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1826ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 918 ms.
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1278/1278 transitions.
Applied a total of 0 rules in 90 ms. Remains 58 /58 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 58/58 places, 1278/1278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1278/1278 transitions.
Applied a total of 0 rules in 90 ms. Remains 58 /58 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
[2024-06-01 07:27:17] [INFO ] Invariant cache hit.
[2024-06-01 07:27:17] [INFO ] Implicit Places using invariants in 697 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 701 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 57/58 places, 1278/1278 transitions.
Applied a total of 0 rules in 133 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 925 ms. Remains : 57/58 places, 1278/1278 transitions.
RANDOM walk for 40000 steps (26 resets) in 3092 ms. (12 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (93 resets) in 170 ms. (233 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (99 resets) in 195 ms. (204 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 366394 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 2
Probabilistic random walk after 366394 steps, saw 56734 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
// Phase 1: matrix 1278 rows 57 cols
[2024-06-01 07:27:21] [INFO ] Computed 13 invariants in 6 ms
[2024-06-01 07:27:21] [INFO ] State equation strengthened by 221 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) 32/57 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1278/1335 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 221/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1335 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1335 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1335/1335 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 806 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 57/57 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 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) 32/57 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1278/1335 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 221/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1335 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1335 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1335/1335 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 924 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 57/57 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1809ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1030 ms.
Support contains 6 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1278/1278 transitions.
Applied a total of 0 rules in 83 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 57/57 places, 1278/1278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1278/1278 transitions.
Applied a total of 0 rules in 80 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
[2024-06-01 07:27:24] [INFO ] Invariant cache hit.
[2024-06-01 07:27:25] [INFO ] Implicit Places using invariants in 965 ms returned []
[2024-06-01 07:27:25] [INFO ] Invariant cache hit.
[2024-06-01 07:27:26] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-06-01 07:27:27] [INFO ] Implicit Places using invariants and state equation in 1745 ms returned []
Implicit Place search using SMT with State Equation took 2713 ms to find 0 implicit places.
[2024-06-01 07:27:27] [INFO ] Redundant transitions in 71 ms returned []
Running 1277 sub problems to find dead transitions.
[2024-06-01 07:27:27] [INFO ] Invariant cache hit.
[2024-06-01 07:27:27] [INFO ] State equation strengthened by 221 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
[2024-06-01 07:28:09] [INFO ] Deduced a trap composed of 23 places in 1612 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 57/1335 variables, and 14 constraints, problems are : Problem set: 0 solved, 1277 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/57 constraints, ReadFeed: 0/221 constraints, PredecessorRefiner: 1277/32 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1277 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 4 (OVERLAPS) 1278/1335 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1335 variables, 221/292 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 32/324 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1335/1335 variables, and 324 constraints, problems are : Problem set: 0 solved, 1277 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 57/57 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 1277/32 constraints, Known Traps: 1/1 constraints]
After SMT, in 83498ms problems are : Problem set: 0 solved, 1277 unsolved
Search for dead transitions found 0 dead transitions in 83523ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86402 ms. Remains : 57/57 places, 1278/1278 transitions.
Knowledge obtained : [(AND (NOT p2) p1)]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 176 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 175 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Product exploration explored 100000 steps with 25000 reset in 7584 ms.
Product exploration explored 100000 steps with 25000 reset in 7559 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 178 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 84 transition count 1387
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 12 place count 84 transition count 1389
Deduced a syphon composed of 13 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 84 transition count 1389
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 84 transition count 1389
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 83 transition count 1388
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 83 transition count 1388
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 83 transition count 1391
Deduced a syphon composed of 15 places in 0 ms
Applied a total of 18 rules in 241 ms. Remains 83 /84 variables (removed 1) and now considering 1391/1387 (removed -4) transitions.
[2024-06-01 07:29:07] [INFO ] Redundant transitions in 69 ms returned []
Running 1390 sub problems to find dead transitions.
// Phase 1: matrix 1391 rows 83 cols
[2024-06-01 07:29:07] [INFO ] Computed 12 invariants in 7 ms
[2024-06-01 07:29:07] [INFO ] State equation strengthened by 307 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 07:29:42] [INFO ] Deduced a trap composed of 6 places in 920 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 07:29:43] [INFO ] Deduced a trap composed of 6 places in 923 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-06-01 07:29:44] [INFO ] Deduced a trap composed of 6 places in 900 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-06-01 07:29:45] [INFO ] Deduced a trap composed of 6 places in 890 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-06-01 07:29:46] [INFO ] Deduced a trap composed of 6 places in 891 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-06-01 07:29:47] [INFO ] Deduced a trap composed of 6 places in 886 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-06-01 07:29:48] [INFO ] Deduced a trap composed of 6 places in 862 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-06-01 07:29:49] [INFO ] Deduced a trap composed of 6 places in 879 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 6 places in 865 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 6 places in 845 ms of which 2 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 11/23 constraints. Problems are: Problem set: 11 solved, 1379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 83/1474 variables, and 23 constraints, problems are : Problem set: 11 solved, 1379 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/83 constraints, ReadFeed: 0/307 constraints, PredecessorRefiner: 1390/60 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 11 solved, 1379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 1379 unsolved
At refinement iteration 1 (OVERLAPS) 12/83 variables, 12/12 constraints. Problems are: Problem set: 11 solved, 1379 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 11/23 constraints. Problems are: Problem set: 11 solved, 1379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/23 constraints. Problems are: Problem set: 11 solved, 1379 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
At refinement iteration 4 (OVERLAPS) 1390/1473 variables, 83/106 constraints. Problems are: Problem set: 19 solved, 1371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1473 variables, 306/412 constraints. Problems are: Problem set: 19 solved, 1371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1473 variables, 43/455 constraints. Problems are: Problem set: 19 solved, 1371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1473/1474 variables, and 455 constraints, problems are : Problem set: 19 solved, 1371 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 83/83 constraints, ReadFeed: 306/307 constraints, PredecessorRefiner: 1373/60 constraints, Known Traps: 11/11 constraints]
After SMT, in 85293ms problems are : Problem set: 19 solved, 1371 unsolved
Search for dead transitions found 19 dead transitions in 85312ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 83/84 places, 1372/1387 transitions.
Graph (complete) has 1161 edges and 83 vertex of which 68 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.5 ms
Discarding 15 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 154 ms. Remains 68 /83 variables (removed 15) and now considering 1372/1372 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/84 places, 1372/1387 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 85790 ms. Remains : 68/84 places, 1372/1387 transitions.
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Applied a total of 0 rules in 8 ms. Remains 84 /84 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-06-01 07:30:33] [INFO ] Computed 12 invariants in 8 ms
[2024-06-01 07:30:33] [INFO ] Implicit Places using invariants in 694 ms returned []
[2024-06-01 07:30:33] [INFO ] Invariant cache hit.
[2024-06-01 07:30:34] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-06-01 07:30:35] [INFO ] Implicit Places using invariants and state equation in 1277 ms returned []
Implicit Place search using SMT with State Equation took 1973 ms to find 0 implicit places.
Running 1386 sub problems to find dead transitions.
[2024-06-01 07:30:35] [INFO ] Invariant cache hit.
[2024-06-01 07:30:35] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 3 (OVERLAPS) 1386/1470 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
SMT process timed out in 55016ms, After SMT, problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 55034ms
Finished structural reductions in LTL mode , in 1 iterations and 57019 ms. Remains : 84/84 places, 1387/1387 transitions.
Treatment of property AutonomousCar-PT-10a-LTLFireability-14 finished in 539554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X((X(X(p1))||G(p2)))))))'
Support contains 17 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 85 transition count 1398
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 85 transition count 1398
Applied a total of 8 rules in 11 ms. Remains 85 /89 variables (removed 4) and now considering 1398/1442 (removed 44) transitions.
// Phase 1: matrix 1398 rows 85 cols
[2024-06-01 07:31:30] [INFO ] Computed 12 invariants in 8 ms
[2024-06-01 07:31:30] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-06-01 07:31:30] [INFO ] Invariant cache hit.
[2024-06-01 07:31:31] [INFO ] State equation strengthened by 313 read => feed constraints.
[2024-06-01 07:31:31] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1224 ms to find 0 implicit places.
Running 1397 sub problems to find dead transitions.
[2024-06-01 07:31:31] [INFO ] Invariant cache hit.
[2024-06-01 07:31:31] [INFO ] State equation strengthened by 313 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1397/1482 variables, 85/97 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
SMT process timed out in 55153ms, After SMT, problems are : Problem set: 0 solved, 1397 unsolved
Search for dead transitions found 0 dead transitions in 55170ms
Starting structural reductions in LTL mode, iteration 1 : 85/89 places, 1398/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56409 ms. Remains : 85/89 places, 1398/1442 transitions.
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-15
Product exploration explored 100000 steps with 16708 reset in 5395 ms.
Product exploration explored 100000 steps with 16685 reset in 5400 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 (NOT p0) (NOT p2) p1), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (1844 resets) in 3144 ms. (12 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (102 resets) in 216 ms. (184 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (96 resets) in 296 ms. (134 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (99 resets) in 209 ms. (190 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (101 resets) in 182 ms. (218 steps per ms) remains 3/3 properties
[2024-06-01 07:32:39] [INFO ] Invariant cache hit.
[2024-06-01 07:32:39] [INFO ] State equation strengthened by 313 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
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 16/22 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 54/76 variables, 9/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1389/1465 variables, 76/88 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1465 variables, 312/400 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1465 variables, 0/400 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 13/1478 variables, 5/405 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1478 variables, 0/405 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/1482 variables, 4/409 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1482 variables, 0/409 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/1483 variables, 1/410 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1483 variables, 0/410 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1483 variables, 0/410 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1483/1483 variables, and 410 constraints, problems are : Problem set: 1 solved, 2 unsolved in 726 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 85/85 constraints, ReadFeed: 313/313 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/22 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 54/76 variables, 9/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1389/1465 variables, 76/88 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1465 variables, 312/400 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1465 variables, 0/400 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 13/1478 variables, 5/405 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1478 variables, 0/405 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/1482 variables, 4/409 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1482 variables, 0/409 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/1483 variables, 1/410 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1483 variables, 0/410 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1483 variables, 0/410 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1483/1483 variables, and 410 constraints, problems are : Problem set: 1 solved, 2 unsolved in 877 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 85/85 constraints, ReadFeed: 313/313 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1669ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 704 ms.
Support contains 6 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Graph (complete) has 1138 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 84 transition count 1383
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 26 place count 73 transition count 1383
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 73 transition count 1382
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 72 transition count 1382
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 71 transition count 1381
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 71 transition count 1381
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 68 transition count 1378
Free-agglomeration rule applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 47 place count 68 transition count 1367
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 101 rules applied. Total rules applied 148 place count 57 transition count 1277
Applied a total of 148 rules in 245 ms. Remains 57 /85 variables (removed 28) and now considering 1277/1398 (removed 121) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 57/85 places, 1277/1398 transitions.
RANDOM walk for 40000 steps (18 resets) in 2228 ms. (17 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (28 resets) in 208 ms. (191 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (28 resets) in 197 ms. (202 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 409144 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 2
Probabilistic random walk after 409144 steps, saw 49097 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
// Phase 1: matrix 1277 rows 57 cols
[2024-06-01 07:32:45] [INFO ] Computed 14 invariants in 6 ms
[2024-06-01 07:32:45] [INFO ] State equation strengthened by 221 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) 14/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 37/57 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1277/1334 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1334 variables, 221/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1334 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1334 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1334/1334 variables, and 292 constraints, problems are : Problem set: 0 solved, 2 unsolved in 542 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 57/57 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 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) 14/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 37/57 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1277/1334 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1334 variables, 221/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1334 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1334 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1334/1334 variables, and 292 constraints, problems are : Problem set: 0 solved, 2 unsolved in 627 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 57/57 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1249ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 7752 steps, including 995 resets, run visited all 2 properties in 569 ms. (steps per millisecond=13 )
Parikh walk visited 2 properties in 569 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p2))), (G (OR p1 (NOT p2)))]
False Knowledge obtained : [(F p2), (F (NOT p1)), (F (NOT (OR p1 p2))), (F p0)]
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 15 out of 85 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
// Phase 1: matrix 1398 rows 85 cols
[2024-06-01 07:32:48] [INFO ] Computed 12 invariants in 8 ms
[2024-06-01 07:32:48] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-06-01 07:32:48] [INFO ] Invariant cache hit.
[2024-06-01 07:32:49] [INFO ] State equation strengthened by 313 read => feed constraints.
[2024-06-01 07:32:49] [INFO ] Implicit Places using invariants and state equation in 873 ms returned []
Implicit Place search using SMT with State Equation took 1240 ms to find 0 implicit places.
Running 1397 sub problems to find dead transitions.
[2024-06-01 07:32:49] [INFO ] Invariant cache hit.
[2024-06-01 07:32:49] [INFO ] State equation strengthened by 313 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
At refinement iteration 3 (OVERLAPS) 1397/1482 variables, 85/97 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
SMT process timed out in 54801ms, After SMT, problems are : Problem set: 0 solved, 1397 unsolved
Search for dead transitions found 0 dead transitions in 54819ms
Finished structural reductions in LTL mode , in 1 iterations and 56067 ms. Remains : 85/85 places, 1398/1398 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 (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 40000 steps (1833 resets) in 2120 ms. (18 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (129 resets) in 186 ms. (213 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (100 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
[2024-06-01 07:33:45] [INFO ] Invariant cache hit.
[2024-06-01 07:33:45] [INFO ] State equation strengthened by 313 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) 18/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/76 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1389/1465 variables, 76/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1465 variables, 312/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1465 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 13/1478 variables, 5/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1478 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/1482 variables, 4/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1482 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1483 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1483 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1483 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1483/1483 variables, and 410 constraints, problems are : Problem set: 0 solved, 1 unsolved in 623 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 85/85 constraints, ReadFeed: 313/313 constraints, PredecessorRefiner: 1/0 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) 18/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/76 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1389/1465 variables, 76/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1465 variables, 312/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1465 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 13/1478 variables, 5/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1478 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/1482 variables, 4/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1482 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1483 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1483 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1483 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1483/1483 variables, and 410 constraints, problems are : Problem set: 0 solved, 1 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 85/85 constraints, ReadFeed: 313/313 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1342ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 512 ms.
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Graph (complete) has 1138 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 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 84 transition count 1383
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 26 place count 73 transition count 1383
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 73 transition count 1382
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 28 place count 72 transition count 1382
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 70 transition count 1370
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 70 transition count 1370
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 2 with 6 rules applied. Total rules applied 38 place count 67 transition count 1367
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 48 place count 67 transition count 1357
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 148 place count 57 transition count 1267
Applied a total of 148 rules in 270 ms. Remains 57 /85 variables (removed 28) and now considering 1267/1398 (removed 131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 57/85 places, 1267/1398 transitions.
RANDOM walk for 40000 steps (22 resets) in 1309 ms. (30 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (28 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 483336 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 1
Probabilistic random walk after 483336 steps, saw 69670 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
// Phase 1: matrix 1267 rows 57 cols
[2024-06-01 07:33:50] [INFO ] Computed 14 invariants in 6 ms
[2024-06-01 07:33:50] [INFO ] State equation strengthened by 211 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) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/57 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1267/1324 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1324 variables, 211/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1324 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1324 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 490 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 57/57 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 1/0 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) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/57 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1267/1324 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1324 variables, 211/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1324 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1324 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 532 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 57/57 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1055ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 468 ms.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1267/1267 transitions.
Applied a total of 0 rules in 82 ms. Remains 57 /57 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 57/57 places, 1267/1267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1267/1267 transitions.
Applied a total of 0 rules in 87 ms. Remains 57 /57 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
[2024-06-01 07:33:52] [INFO ] Invariant cache hit.
[2024-06-01 07:33:53] [INFO ] Implicit Places using invariants in 634 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 636 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 56/57 places, 1267/1267 transitions.
Applied a total of 0 rules in 82 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 805 ms. Remains : 56/57 places, 1267/1267 transitions.
RANDOM walk for 40000 steps (13 resets) in 1033 ms. (38 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (28 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 504225 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 1
Probabilistic random walk after 504225 steps, saw 72444 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
// Phase 1: matrix 1267 rows 56 cols
[2024-06-01 07:33:56] [INFO ] Computed 13 invariants in 8 ms
[2024-06-01 07:33:56] [INFO ] State equation strengthened by 211 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) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/56 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1267/1323 variables, 56/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1323 variables, 211/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1323 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1323 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1323/1323 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 472 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 56/56 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 1/0 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) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/56 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1267/1323 variables, 56/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1323 variables, 211/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1323 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1323 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1323/1323 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 516 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 56/56 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1028ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 459 ms.
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1267/1267 transitions.
Applied a total of 0 rules in 80 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 56/56 places, 1267/1267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1267/1267 transitions.
Applied a total of 0 rules in 82 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
[2024-06-01 07:33:58] [INFO ] Invariant cache hit.
[2024-06-01 07:33:58] [INFO ] Implicit Places using invariants in 617 ms returned []
[2024-06-01 07:33:58] [INFO ] Invariant cache hit.
[2024-06-01 07:33:59] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-06-01 07:34:00] [INFO ] Implicit Places using invariants and state equation in 1203 ms returned []
Implicit Place search using SMT with State Equation took 1825 ms to find 0 implicit places.
[2024-06-01 07:34:00] [INFO ] Redundant transitions in 43 ms returned []
Running 1266 sub problems to find dead transitions.
[2024-06-01 07:34:00] [INFO ] Invariant cache hit.
[2024-06-01 07:34:00] [INFO ] State equation strengthened by 211 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
[2024-06-01 07:34:38] [INFO ] Deduced a trap composed of 23 places in 982 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
At refinement iteration 4 (OVERLAPS) 1267/1323 variables, 56/70 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
SMT process timed out in 53515ms, After SMT, problems are : Problem set: 0 solved, 1266 unsolved
Search for dead transitions found 0 dead transitions in 53530ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55489 ms. Remains : 56/56 places, 1267/1267 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 77 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 07:34:53] [INFO ] Invariant cache hit.
[2024-06-01 07:34:53] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:34:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-06-01 07:34:54] [INFO ] After 436ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :1
[2024-06-01 07:34:54] [INFO ] After 477ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 633 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 16680 reset in 5442 ms.
Product exploration explored 100000 steps with 16685 reset in 5436 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 15 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 85 transition count 1398
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 9 place count 85 transition count 1400
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 85 transition count 1400
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 84 transition count 1389
Deduced a syphon composed of 11 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 84 transition count 1389
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 12 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 84 transition count 1389
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 13 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 84 transition count 1392
Deduced a syphon composed of 13 places in 0 ms
Applied a total of 15 rules in 175 ms. Remains 84 /85 variables (removed 1) and now considering 1392/1398 (removed 6) transitions.
[2024-06-01 07:35:06] [INFO ] Redundant transitions in 68 ms returned []
Running 1391 sub problems to find dead transitions.
// Phase 1: matrix 1392 rows 84 cols
[2024-06-01 07:35:06] [INFO ] Computed 12 invariants in 8 ms
[2024-06-01 07:35:06] [INFO ] State equation strengthened by 307 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
[2024-06-01 07:35:40] [INFO ] Deduced a trap composed of 6 places in 1061 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 07:35:41] [INFO ] Deduced a trap composed of 6 places in 947 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 07:35:42] [INFO ] Deduced a trap composed of 6 places in 914 ms of which 3 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 07:35:43] [INFO ] Deduced a trap composed of 6 places in 888 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 07:35:44] [INFO ] Deduced a trap composed of 6 places in 893 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 07:35:45] [INFO ] Deduced a trap composed of 6 places in 910 ms of which 4 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-01 07:35:46] [INFO ] Deduced a trap composed of 6 places in 859 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-06-01 07:35:47] [INFO ] Deduced a trap composed of 6 places in 841 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-06-01 07:35:48] [INFO ] Deduced a trap composed of 6 places in 813 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-06-01 07:35:50] [INFO ] Deduced a trap composed of 12 places in 298 ms of which 1 ms to minimize.
Problem TDEAD335 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 10/22 constraints. Problems are: Problem set: 10 solved, 1381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 84/1476 variables, and 22 constraints, problems are : Problem set: 10 solved, 1381 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/84 constraints, ReadFeed: 0/307 constraints, PredecessorRefiner: 1391/61 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 10 solved, 1381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 1381 unsolved
At refinement iteration 1 (OVERLAPS) 11/84 variables, 12/12 constraints. Problems are: Problem set: 10 solved, 1381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 10/22 constraints. Problems are: Problem set: 10 solved, 1381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/22 constraints. Problems are: Problem set: 10 solved, 1381 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
At refinement iteration 4 (OVERLAPS) 1391/1475 variables, 84/106 constraints. Problems are: Problem set: 17 solved, 1374 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 306/412 constraints. Problems are: Problem set: 17 solved, 1374 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1475 variables, 46/458 constraints. Problems are: Problem set: 17 solved, 1374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1475/1476 variables, and 458 constraints, problems are : Problem set: 17 solved, 1374 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 306/307 constraints, PredecessorRefiner: 1376/61 constraints, Known Traps: 10/10 constraints]
After SMT, in 84671ms problems are : Problem set: 17 solved, 1374 unsolved
Search for dead transitions found 17 dead transitions in 84689ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 84/85 places, 1375/1398 transitions.
Graph (complete) has 1162 edges and 84 vertex of which 71 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.5 ms
Discarding 13 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 117 ms. Remains 71 /84 variables (removed 13) and now considering 1375/1375 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/85 places, 1375/1398 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 85061 ms. Remains : 71/85 places, 1375/1398 transitions.
Support contains 15 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 84 transition count 1387
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 1387
Applied a total of 2 rules in 11 ms. Remains 84 /85 variables (removed 1) and now considering 1387/1398 (removed 11) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-06-01 07:36:31] [INFO ] Computed 12 invariants in 8 ms
[2024-06-01 07:36:31] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-06-01 07:36:31] [INFO ] Invariant cache hit.
[2024-06-01 07:36:32] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-06-01 07:36:32] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1220 ms to find 0 implicit places.
Running 1386 sub problems to find dead transitions.
[2024-06-01 07:36:32] [INFO ] Invariant cache hit.
[2024-06-01 07:36:32] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 3 (OVERLAPS) 1386/1470 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
SMT process timed out in 54678ms, After SMT, problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 54696ms
Starting structural reductions in LTL mode, iteration 1 : 84/85 places, 1387/1398 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55930 ms. Remains : 84/85 places, 1387/1398 transitions.
Treatment of property AutonomousCar-PT-10a-LTLFireability-15 finished in 357027 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&&(!p1 U (G(!p1)||(!p1&&(!p2 U (p3||G(!p2))))))))))'
Found a Shortening insensitive property : AutonomousCar-PT-10a-LTLFireability-09
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (OR (AND (NOT p0) p2 (NOT p3)) (AND p1 p2 (NOT p3)))]
Support contains 19 out of 89 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 89/89 places, 1442/1442 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 89 transition count 1435
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 82 transition count 1434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 81 transition count 1434
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 16 place count 81 transition count 1432
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 20 place count 79 transition count 1432
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 25 place count 74 transition count 1377
Iterating global reduction 3 with 5 rules applied. Total rules applied 30 place count 74 transition count 1377
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 3 with 2 rules applied. Total rules applied 32 place count 73 transition count 1376
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 34 place count 72 transition count 1376
Applied a total of 34 rules in 112 ms. Remains 72 /89 variables (removed 17) and now considering 1376/1442 (removed 66) transitions.
// Phase 1: matrix 1376 rows 72 cols
[2024-06-01 07:37:27] [INFO ] Computed 12 invariants in 7 ms
[2024-06-01 07:37:28] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-06-01 07:37:28] [INFO ] Invariant cache hit.
[2024-06-01 07:37:28] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-06-01 07:37:29] [INFO ] Implicit Places using invariants and state equation in 855 ms returned []
Implicit Place search using SMT with State Equation took 1208 ms to find 0 implicit places.
Running 1375 sub problems to find dead transitions.
[2024-06-01 07:37:29] [INFO ] Invariant cache hit.
[2024-06-01 07:37:29] [INFO ] State equation strengthened by 305 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 3 (OVERLAPS) 1375/1447 variables, 72/84 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
SMT process timed out in 54642ms, After SMT, problems are : Problem set: 0 solved, 1375 unsolved
Search for dead transitions found 0 dead transitions in 54659ms
Starting structural reductions in LI_LTL mode, iteration 1 : 72/89 places, 1376/1442 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 55983 ms. Remains : 72/89 places, 1376/1442 transitions.
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-09
Product exploration explored 100000 steps with 3664 reset in 1934 ms.
Product exploration explored 100000 steps with 1019 reset in 660 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 p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (AND p0 (NOT p3) (NOT p2) (NOT p1))), (X (NOT (OR (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 112 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 369 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (OR (AND (NOT p0) p2 (NOT p3)) (AND p1 p2 (NOT p3)))]
RANDOM walk for 40000 steps (2164 resets) in 4933 ms. (8 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (112 resets) in 339 ms. (117 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (57 resets) in 335 ms. (119 steps per ms) remains 7/13 properties
BEST_FIRST walk for 40004 steps (112 resets) in 301 ms. (132 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (114 resets) in 303 ms. (131 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (110 resets) in 335 ms. (119 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (109 resets) in 281 ms. (141 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (112 resets) in 362 ms. (110 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (112 resets) in 273 ms. (145 steps per ms) remains 7/7 properties
[2024-06-01 07:38:29] [INFO ] Invariant cache hit.
[2024-06-01 07:38:29] [INFO ] State equation strengthened by 305 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf3 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 48/67 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1373/1440 variables, 67/79 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1440 variables, 304/383 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1440 variables, 0/383 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 7/1447 variables, 5/388 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1447 variables, 0/388 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/1448 variables, 1/389 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1448 variables, 0/389 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1448 variables, 0/389 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1448/1448 variables, and 389 constraints, problems are : Problem set: 2 solved, 5 unsolved in 1007 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 72/72 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 48/67 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1373/1440 variables, 67/79 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1440 variables, 304/383 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1440 variables, 0/383 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 7/1447 variables, 5/388 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1447 variables, 0/388 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/1448 variables, 1/389 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1448 variables, 0/389 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1448 variables, 0/389 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1448/1448 variables, and 389 constraints, problems are : Problem set: 2 solved, 5 unsolved in 1247 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 72/72 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2439ms problems are : Problem set: 2 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2811 ms.
Support contains 19 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 1376/1376 transitions.
Graph (complete) has 1117 edges and 72 vertex of which 71 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 71 transition count 1373
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 70 transition count 1371
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 70 transition count 1371
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 14 place count 70 transition count 1362
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 93 place count 61 transition count 1292
Applied a total of 93 rules in 208 ms. Remains 61 /72 variables (removed 11) and now considering 1292/1376 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 61/72 places, 1292/1376 transitions.
RANDOM walk for 40000 steps (826 resets) in 3650 ms. (10 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (109 resets) in 306 ms. (130 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (65 resets) in 226 ms. (176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (74 resets) in 195 ms. (204 steps per ms) remains 2/2 properties
// Phase 1: matrix 1292 rows 61 cols
[2024-06-01 07:38:35] [INFO ] Computed 13 invariants in 8 ms
[2024-06-01 07:38:35] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/58 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/60 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1292/1352 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1352 variables, 232/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1352 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1353 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1353 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1353 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1353/1353 variables, and 306 constraints, problems are : Problem set: 0 solved, 2 unsolved in 625 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/58 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/60 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1292/1352 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1352 variables, 232/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1352 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1353 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1353 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1353 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1353/1353 variables, and 306 constraints, problems are : Problem set: 0 solved, 2 unsolved in 701 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1396ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 611 ms.
Support contains 17 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1292/1292 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 1291
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 60 transition count 1281
Applied a total of 12 rules in 163 ms. Remains 60 /61 variables (removed 1) and now considering 1281/1292 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 60/61 places, 1281/1292 transitions.
RANDOM walk for 40000 steps (502 resets) in 2456 ms. (16 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (50 resets) in 238 ms. (167 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (40 resets) in 242 ms. (164 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 358436 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 2
Probabilistic random walk after 358436 steps, saw 54483 distinct states, run finished after 3006 ms. (steps per millisecond=119 ) properties seen :0
// Phase 1: matrix 1281 rows 60 cols
[2024-06-01 07:38:42] [INFO ] Computed 13 invariants in 7 ms
[2024-06-01 07:38:42] [INFO ] State equation strengthened by 222 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/59 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1281/1340 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1340 variables, 222/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1340 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1341 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1341 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1341 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1341/1341 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 590 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/59 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1281/1340 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1340 variables, 222/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1340 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1341 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1341 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1341 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1341/1341 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 707 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1362ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 597 ms.
Support contains 17 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1281/1281 transitions.
Applied a total of 0 rules in 70 ms. Remains 60 /60 variables (removed 0) and now considering 1281/1281 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 60/60 places, 1281/1281 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1281/1281 transitions.
Applied a total of 0 rules in 76 ms. Remains 60 /60 variables (removed 0) and now considering 1281/1281 (removed 0) transitions.
[2024-06-01 07:38:44] [INFO ] Invariant cache hit.
[2024-06-01 07:38:44] [INFO ] Implicit Places using invariants in 315 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 318 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/60 places, 1281/1281 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 58 transition count 1280
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 1280
Applied a total of 2 rules in 85 ms. Remains 58 /59 variables (removed 1) and now considering 1280/1281 (removed 1) transitions.
// Phase 1: matrix 1280 rows 58 cols
[2024-06-01 07:38:44] [INFO ] Computed 12 invariants in 9 ms
[2024-06-01 07:38:44] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-06-01 07:38:44] [INFO ] Invariant cache hit.
[2024-06-01 07:38:45] [INFO ] State equation strengthened by 222 read => feed constraints.
[2024-06-01 07:38:45] [INFO ] Implicit Places using invariants and state equation in 816 ms returned []
Implicit Place search using SMT with State Equation took 1131 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 58/60 places, 1280/1281 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1613 ms. Remains : 58/60 places, 1280/1281 transitions.
RANDOM walk for 40000 steps (474 resets) in 2040 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (44 resets) in 228 ms. (174 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (43 resets) in 214 ms. (186 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 332467 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 2
Probabilistic random walk after 332467 steps, saw 50645 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
[2024-06-01 07:38:49] [INFO ] Invariant cache hit.
[2024-06-01 07:38:49] [INFO ] State equation strengthened by 222 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1280/1337 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1337 variables, 222/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1337 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/1338 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1338 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1338 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1338/1338 variables, and 292 constraints, problems are : Problem set: 0 solved, 2 unsolved in 583 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 58/58 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1280/1337 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1337 variables, 222/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1337 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/1338 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1338 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1338 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1338/1338 variables, and 292 constraints, problems are : Problem set: 0 solved, 2 unsolved in 679 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 58/58 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1337ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 646 ms.
Support contains 17 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1280/1280 transitions.
Applied a total of 0 rules in 75 ms. Remains 58 /58 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 58/58 places, 1280/1280 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1280/1280 transitions.
Applied a total of 0 rules in 76 ms. Remains 58 /58 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
[2024-06-01 07:38:51] [INFO ] Invariant cache hit.
[2024-06-01 07:38:51] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-06-01 07:38:51] [INFO ] Invariant cache hit.
[2024-06-01 07:38:52] [INFO ] State equation strengthened by 222 read => feed constraints.
[2024-06-01 07:38:52] [INFO ] Implicit Places using invariants and state equation in 815 ms returned []
Implicit Place search using SMT with State Equation took 1141 ms to find 0 implicit places.
[2024-06-01 07:38:52] [INFO ] Redundant transitions in 44 ms returned []
Running 1279 sub problems to find dead transitions.
[2024-06-01 07:38:52] [INFO ] Invariant cache hit.
[2024-06-01 07:38:52] [INFO ] State equation strengthened by 222 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1280/1338 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
SMT process timed out in 53396ms, After SMT, problems are : Problem set: 0 solved, 1279 unsolved
Search for dead transitions found 0 dead transitions in 53416ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54692 ms. Remains : 58/58 places, 1280/1280 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 68 ms. Remains 58 /58 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-06-01 07:39:46] [INFO ] Invariant cache hit.
[2024-06-01 07:39:46] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-01 07:39:46] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 07:39:46] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-06-01 07:39:46] [INFO ] After 447ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :2
[2024-06-01 07:39:46] [INFO ] After 496ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 687 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (AND p0 (NOT p3) (NOT p2) (NOT p1))), (X (NOT (OR (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p2) p3)), (G (AND (OR p0 (NOT p2) p3) (OR (NOT p1) (NOT p2) p3)))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2) p3))), (F (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F p2), (F p3), (F (NOT p0)), (F (NOT (AND (OR p0 p2 p3) (OR (NOT p1) p2 p3)))), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 21 factoid took 394 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Support contains 19 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 1376/1376 transitions.
Applied a total of 0 rules in 5 ms. Remains 72 /72 variables (removed 0) and now considering 1376/1376 (removed 0) transitions.
// Phase 1: matrix 1376 rows 72 cols
[2024-06-01 07:39:47] [INFO ] Computed 12 invariants in 7 ms
[2024-06-01 07:39:48] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-06-01 07:39:48] [INFO ] Invariant cache hit.
[2024-06-01 07:39:48] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-06-01 07:39:48] [INFO ] Implicit Places using invariants and state equation in 849 ms returned []
Implicit Place search using SMT with State Equation took 1180 ms to find 0 implicit places.
Running 1375 sub problems to find dead transitions.
[2024-06-01 07:39:48] [INFO ] Invariant cache hit.
[2024-06-01 07:39:49] [INFO ] State equation strengthened by 305 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1375/1447 variables, 72/84 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
SMT process timed out in 55157ms, After SMT, problems are : Problem set: 0 solved, 1375 unsolved
Search for dead transitions found 0 dead transitions in 55175ms
Finished structural reductions in LTL mode , in 1 iterations and 56363 ms. Remains : 72/72 places, 1376/1376 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 (NOT p1) p0 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) p2 (NOT p3) p0))), (X (AND (NOT p1) (NOT p2) (NOT p3) p0)), (X (NOT (OR p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3) p0))), (X (X (NOT (OR p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 140 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
RANDOM walk for 40000 steps (2156 resets) in 3916 ms. (10 steps per ms) remains 9/12 properties
BEST_FIRST walk for 40004 steps (116 resets) in 321 ms. (124 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (109 resets) in 367 ms. (108 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (110 resets) in 350 ms. (113 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (111 resets) in 356 ms. (112 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (105 resets) in 409 ms. (97 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (116 resets) in 320 ms. (124 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (110 resets) in 274 ms. (145 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (112 resets) in 312 ms. (127 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (110 resets) in 332 ms. (120 steps per ms) remains 9/9 properties
[2024-06-01 07:40:46] [INFO ] Invariant cache hit.
[2024-06-01 07:40:46] [INFO ] State equation strengthened by 305 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 48/67 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1373/1440 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1440 variables, 304/383 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1440 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 7/1447 variables, 5/388 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1447 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/1448 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1448 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/1448 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1448/1448 variables, and 389 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1338 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 72/72 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 48/67 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1373/1440 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1440 variables, 304/383 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1440 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 7/1447 variables, 5/388 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1447 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/1448 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1448 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/1448 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1448/1448 variables, and 389 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1829 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 72/72 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3377ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4897 ms.
Support contains 19 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 1376/1376 transitions.
Graph (complete) has 1117 edges and 72 vertex of which 71 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 71 transition count 1373
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 70 transition count 1371
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 70 transition count 1371
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 14 place count 70 transition count 1362
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 93 place count 61 transition count 1292
Applied a total of 93 rules in 182 ms. Remains 61 /72 variables (removed 11) and now considering 1292/1376 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 61/72 places, 1292/1376 transitions.
RANDOM walk for 40000 steps (690 resets) in 3681 ms. (10 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40003 steps (99 resets) in 323 ms. (123 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (67 resets) in 371 ms. (107 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (105 resets) in 385 ms. (103 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (94 resets) in 388 ms. (102 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (79 resets) in 308 ms. (129 steps per ms) remains 2/6 properties
// Phase 1: matrix 1292 rows 61 cols
[2024-06-01 07:40:56] [INFO ] Computed 13 invariants in 8 ms
[2024-06-01 07:40:56] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/58 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/60 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1292/1352 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1352 variables, 232/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1352 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1353 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1353 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1353 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1353/1353 variables, and 306 constraints, problems are : Problem set: 0 solved, 2 unsolved in 592 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/58 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/60 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1292/1352 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1352 variables, 232/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1352 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1353 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1353 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1353 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1353/1353 variables, and 306 constraints, problems are : Problem set: 0 solved, 2 unsolved in 701 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1360ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 635 ms.
Support contains 17 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1292/1292 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 1291
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 60 transition count 1281
Applied a total of 12 rules in 145 ms. Remains 60 /61 variables (removed 1) and now considering 1281/1292 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 60/61 places, 1281/1292 transitions.
RANDOM walk for 40000 steps (413 resets) in 2519 ms. (15 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (47 resets) in 229 ms. (173 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (52 resets) in 234 ms. (170 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 350562 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 2
Probabilistic random walk after 350562 steps, saw 53276 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
// Phase 1: matrix 1281 rows 60 cols
[2024-06-01 07:41:02] [INFO ] Computed 13 invariants in 7 ms
[2024-06-01 07:41:02] [INFO ] State equation strengthened by 222 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/59 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1281/1340 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1340 variables, 222/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1340 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1341 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1341 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1341 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1341/1341 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 587 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/59 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1281/1340 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1340 variables, 222/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1340 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1341 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1341 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1341 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1341/1341 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 693 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1346ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 598 ms.
Support contains 17 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1281/1281 transitions.
Applied a total of 0 rules in 70 ms. Remains 60 /60 variables (removed 0) and now considering 1281/1281 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 60/60 places, 1281/1281 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1281/1281 transitions.
Applied a total of 0 rules in 70 ms. Remains 60 /60 variables (removed 0) and now considering 1281/1281 (removed 0) transitions.
[2024-06-01 07:41:04] [INFO ] Invariant cache hit.
[2024-06-01 07:41:05] [INFO ] Implicit Places using invariants in 307 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 322 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/60 places, 1281/1281 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 58 transition count 1280
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 1280
Applied a total of 2 rules in 80 ms. Remains 58 /59 variables (removed 1) and now considering 1280/1281 (removed 1) transitions.
// Phase 1: matrix 1280 rows 58 cols
[2024-06-01 07:41:05] [INFO ] Computed 12 invariants in 7 ms
[2024-06-01 07:41:05] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-06-01 07:41:05] [INFO ] Invariant cache hit.
[2024-06-01 07:41:06] [INFO ] State equation strengthened by 222 read => feed constraints.
[2024-06-01 07:41:06] [INFO ] Implicit Places using invariants and state equation in 794 ms returned []
Implicit Place search using SMT with State Equation took 1110 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 58/60 places, 1280/1281 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1582 ms. Remains : 58/60 places, 1280/1281 transitions.
RANDOM walk for 40000 steps (375 resets) in 2006 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (53 resets) in 233 ms. (170 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (50 resets) in 204 ms. (195 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 332966 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 2
Probabilistic random walk after 332966 steps, saw 50723 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
[2024-06-01 07:41:10] [INFO ] Invariant cache hit.
[2024-06-01 07:41:10] [INFO ] State equation strengthened by 222 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1280/1337 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1337 variables, 222/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1337 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/1338 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1338 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1338 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1338/1338 variables, and 292 constraints, problems are : Problem set: 0 solved, 2 unsolved in 585 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 58/58 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1280/1337 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1337 variables, 222/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1337 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/1338 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1338 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1338 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1338/1338 variables, and 292 constraints, problems are : Problem set: 0 solved, 2 unsolved in 644 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 58/58 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1282ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 631 ms.
Support contains 17 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1280/1280 transitions.
Applied a total of 0 rules in 71 ms. Remains 58 /58 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 58/58 places, 1280/1280 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1280/1280 transitions.
Applied a total of 0 rules in 69 ms. Remains 58 /58 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
[2024-06-01 07:41:12] [INFO ] Invariant cache hit.
[2024-06-01 07:41:12] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-06-01 07:41:12] [INFO ] Invariant cache hit.
[2024-06-01 07:41:13] [INFO ] State equation strengthened by 222 read => feed constraints.
[2024-06-01 07:41:13] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1117 ms to find 0 implicit places.
[2024-06-01 07:41:13] [INFO ] Redundant transitions in 43 ms returned []
Running 1279 sub problems to find dead transitions.
[2024-06-01 07:41:13] [INFO ] Invariant cache hit.
[2024-06-01 07:41:13] [INFO ] State equation strengthened by 222 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
At refinement iteration 3 (OVERLAPS) 1280/1338 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
SMT process timed out in 53429ms, After SMT, problems are : Problem set: 0 solved, 1279 unsolved
Search for dead transitions found 0 dead transitions in 53448ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54686 ms. Remains : 58/58 places, 1280/1280 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 69 ms. Remains 58 /58 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-06-01 07:42:07] [INFO ] Invariant cache hit.
[2024-06-01 07:42:07] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-06-01 07:42:07] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 07:42:07] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-06-01 07:42:07] [INFO ] After 453ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :2
[2024-06-01 07:42:07] [INFO ] After 497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 703 ms.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) p2 (NOT p3) p0))), (X (AND (NOT p1) (NOT p2) (NOT p3) p0)), (X (NOT (OR p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3) p0))), (X (X (NOT (OR p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2 (NOT p3)))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p3))), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F p3), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT (AND (OR p0 p3) (OR (NOT p1) p3)))), (F (NOT p0))]
Knowledge based reduction with 19 factoid took 532 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Product exploration explored 100000 steps with 46 reset in 144 ms.
Product exploration explored 100000 steps with 2449 reset in 1325 ms.
Support contains 19 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 1376/1376 transitions.
Applied a total of 0 rules in 5 ms. Remains 72 /72 variables (removed 0) and now considering 1376/1376 (removed 0) transitions.
// Phase 1: matrix 1376 rows 72 cols
[2024-06-01 07:42:10] [INFO ] Computed 12 invariants in 7 ms
[2024-06-01 07:42:10] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-06-01 07:42:10] [INFO ] Invariant cache hit.
[2024-06-01 07:42:11] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-06-01 07:42:11] [INFO ] Implicit Places using invariants and state equation in 875 ms returned []
Implicit Place search using SMT with State Equation took 1192 ms to find 0 implicit places.
Running 1375 sub problems to find dead transitions.
[2024-06-01 07:42:11] [INFO ] Invariant cache hit.
[2024-06-01 07:42:11] [INFO ] State equation strengthened by 305 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 3 (OVERLAPS) 1375/1447 variables, 72/84 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
SMT process timed out in 55070ms, After SMT, problems are : Problem set: 0 solved, 1375 unsolved
Search for dead transitions found 0 dead transitions in 55087ms
Finished structural reductions in LTL mode , in 1 iterations and 56287 ms. Remains : 72/72 places, 1376/1376 transitions.
Treatment of property AutonomousCar-PT-10a-LTLFireability-09 finished in 339477 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X((p1&&F((G(F(!p2))||(!p3&&F(!p2)))))))))))'
Found a Shortening insensitive property : AutonomousCar-PT-10a-LTLFireability-14
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p1) p2), p2, p2]
Support contains 17 out of 89 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 89/89 places, 1442/1442 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 89 transition count 1434
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 18 place count 81 transition count 1432
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 79 transition count 1432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 20 place count 79 transition count 1430
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 24 place count 77 transition count 1430
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 29 place count 72 transition count 1375
Iterating global reduction 3 with 5 rules applied. Total rules applied 34 place count 72 transition count 1375
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 36 place count 71 transition count 1374
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 38 place count 70 transition count 1374
Applied a total of 38 rules in 96 ms. Remains 70 /89 variables (removed 19) and now considering 1374/1442 (removed 68) transitions.
// Phase 1: matrix 1374 rows 70 cols
[2024-06-01 07:43:07] [INFO ] Computed 12 invariants in 7 ms
[2024-06-01 07:43:07] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-06-01 07:43:07] [INFO ] Invariant cache hit.
[2024-06-01 07:43:08] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-06-01 07:43:08] [INFO ] Implicit Places using invariants and state equation in 861 ms returned []
Implicit Place search using SMT with State Equation took 1209 ms to find 0 implicit places.
Running 1373 sub problems to find dead transitions.
[2024-06-01 07:43:08] [INFO ] Invariant cache hit.
[2024-06-01 07:43:08] [INFO ] State equation strengthened by 305 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 3 (OVERLAPS) 1373/1443 variables, 70/82 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
SMT process timed out in 54954ms, After SMT, problems are : Problem set: 0 solved, 1373 unsolved
Search for dead transitions found 0 dead transitions in 54971ms
Starting structural reductions in LI_LTL mode, iteration 1 : 70/89 places, 1374/1442 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 56280 ms. Remains : 70/89 places, 1374/1442 transitions.
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-14
Product exploration explored 100000 steps with 25000 reset in 7506 ms.
Product exploration explored 100000 steps with 25000 reset in 7569 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 p0 p1 (NOT p3) (NOT p2)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p1) p2), p2, p2]
RANDOM walk for 40000 steps (2248 resets) in 4619 ms. (8 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (112 resets) in 197 ms. (202 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (152 resets) in 271 ms. (147 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (119 resets) in 292 ms. (136 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (119 resets) in 240 ms. (165 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (112 resets) in 211 ms. (188 steps per ms) remains 4/4 properties
[2024-06-01 07:44:20] [INFO ] Invariant cache hit.
[2024-06-01 07:44:20] [INFO ] State equation strengthened by 305 read => feed constraints.
Problem apf6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/65 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1371/1436 variables, 65/77 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1436 variables, 304/381 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1436 variables, 0/381 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 7/1443 variables, 5/386 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1443 variables, 0/386 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/1444 variables, 1/387 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1444 variables, 0/387 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1444 variables, 0/387 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1444/1444 variables, and 387 constraints, problems are : Problem set: 1 solved, 3 unsolved in 743 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 70/70 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 48/65 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1371/1436 variables, 65/77 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1436 variables, 304/381 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1436 variables, 0/381 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/1443 variables, 5/386 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1443 variables, 0/386 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1444 variables, 1/387 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1444 variables, 0/387 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1444 variables, 0/387 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1444/1444 variables, and 387 constraints, problems are : Problem set: 2 solved, 2 unsolved in 848 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 70/70 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1678ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 773 ms.
Support contains 6 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 1374/1374 transitions.
Graph (complete) has 1115 edges and 70 vertex of which 69 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 69 transition count 1371
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 68 transition count 1369
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 68 transition count 1369
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 1 with 4 rules applied. Total rules applied 9 place count 66 transition count 1367
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 66 transition count 1359
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 105 place count 58 transition count 1279
Applied a total of 105 rules in 248 ms. Remains 58 /70 variables (removed 12) and now considering 1279/1374 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 58/70 places, 1279/1374 transitions.
RANDOM walk for 40000 steps (570 resets) in 2323 ms. (17 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (91 resets) in 170 ms. (233 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (92 resets) in 176 ms. (226 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 345814 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 2
Probabilistic random walk after 345814 steps, saw 53932 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
// Phase 1: matrix 1279 rows 58 cols
[2024-06-01 07:44:27] [INFO ] Computed 13 invariants in 8 ms
[2024-06-01 07:44:27] [INFO ] State equation strengthened by 222 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) 18/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/56 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/58 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1279/1337 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1337 variables, 222/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1337 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1337 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1337/1337 variables, and 293 constraints, problems are : Problem set: 0 solved, 2 unsolved in 619 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 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) 18/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/56 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/58 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1279/1337 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1337 variables, 222/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1337 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1337 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1337/1337 variables, and 293 constraints, problems are : Problem set: 0 solved, 2 unsolved in 645 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1321ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 669 ms.
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 84 ms. Remains 58 /58 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 58/58 places, 1279/1279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 90 ms. Remains 58 /58 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
[2024-06-01 07:44:29] [INFO ] Invariant cache hit.
[2024-06-01 07:44:30] [INFO ] Implicit Places using invariants in 622 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 625 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 57/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 94 ms. Remains 57 /57 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 811 ms. Remains : 57/58 places, 1279/1279 transitions.
RANDOM walk for 40000 steps (480 resets) in 2167 ms. (18 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (106 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (91 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 354680 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 2
Probabilistic random walk after 354680 steps, saw 55206 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
// Phase 1: matrix 1279 rows 57 cols
[2024-06-01 07:44:34] [INFO ] Computed 12 invariants in 6 ms
[2024-06-01 07:44:34] [INFO ] State equation strengthened by 222 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) 18/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/56 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1279/1335 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 222/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1335 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1336 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1336 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1336 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 549 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 57/57 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 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) 18/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/56 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1279/1335 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 222/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1335 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1336 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1336 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1336 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 714 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 57/57 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1323ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 699 ms.
Support contains 6 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1279/1279 transitions.
Applied a total of 0 rules in 81 ms. Remains 57 /57 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 57/57 places, 1279/1279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1279/1279 transitions.
Applied a total of 0 rules in 84 ms. Remains 57 /57 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
[2024-06-01 07:44:36] [INFO ] Invariant cache hit.
[2024-06-01 07:44:36] [INFO ] Implicit Places using invariants in 616 ms returned []
[2024-06-01 07:44:36] [INFO ] Invariant cache hit.
[2024-06-01 07:44:37] [INFO ] State equation strengthened by 222 read => feed constraints.
[2024-06-01 07:44:37] [INFO ] Implicit Places using invariants and state equation in 1142 ms returned []
Implicit Place search using SMT with State Equation took 1760 ms to find 0 implicit places.
[2024-06-01 07:44:38] [INFO ] Redundant transitions in 43 ms returned []
Running 1278 sub problems to find dead transitions.
[2024-06-01 07:44:38] [INFO ] Invariant cache hit.
[2024-06-01 07:44:38] [INFO ] State equation strengthened by 222 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 3 (OVERLAPS) 1279/1336 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
SMT process timed out in 54048ms, After SMT, problems are : Problem set: 0 solved, 1278 unsolved
Search for dead transitions found 0 dead transitions in 54063ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55960 ms. Remains : 57/57 places, 1279/1279 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 85 ms. Remains 57 /57 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-06-01 07:45:32] [INFO ] Invariant cache hit.
[2024-06-01 07:45:32] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-01 07:45:32] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 07:45:32] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-06-01 07:45:32] [INFO ] After 444ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :2
[2024-06-01 07:45:32] [INFO ] After 500ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 698 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (X p0)), (G (OR p1 p0)), (G (OR (NOT p1) (NOT p3)))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p0)))), (F (NOT p0)), (F p3), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 251 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 174 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Support contains 6 out of 70 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 1374/1374 transitions.
Applied a total of 0 rules in 6 ms. Remains 70 /70 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
// Phase 1: matrix 1374 rows 70 cols
[2024-06-01 07:45:33] [INFO ] Computed 12 invariants in 7 ms
[2024-06-01 07:45:33] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-06-01 07:45:33] [INFO ] Invariant cache hit.
[2024-06-01 07:45:34] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-06-01 07:45:34] [INFO ] Implicit Places using invariants and state equation in 836 ms returned []
Implicit Place search using SMT with State Equation took 1178 ms to find 0 implicit places.
Running 1373 sub problems to find dead transitions.
[2024-06-01 07:45:34] [INFO ] Invariant cache hit.
[2024-06-01 07:45:34] [INFO ] State equation strengthened by 305 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 3 (OVERLAPS) 1373/1443 variables, 70/82 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
SMT process timed out in 54799ms, After SMT, problems are : Problem set: 0 solved, 1373 unsolved
Search for dead transitions found 0 dead transitions in 54816ms
Finished structural reductions in LTL mode , in 1 iterations and 56003 ms. Remains : 70/70 places, 1374/1374 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 (NOT p2) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
RANDOM walk for 40000 steps (2282 resets) in 3148 ms. (12 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (118 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (116 resets) in 157 ms. (253 steps per ms) remains 2/2 properties
[2024-06-01 07:46:30] [INFO ] Invariant cache hit.
[2024-06-01 07:46:30] [INFO ] State equation strengthened by 305 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) 18/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 40/64 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1369/1433 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1433 variables, 304/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1433 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 10/1443 variables, 6/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1443 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1444 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1444 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1444 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1444/1444 variables, and 387 constraints, problems are : Problem set: 0 solved, 2 unsolved in 759 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 70/70 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 2/0 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) 18/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 40/64 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1369/1433 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1433 variables, 304/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1433 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 10/1443 variables, 6/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1443 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1444 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1444 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1444 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1444/1444 variables, and 387 constraints, problems are : Problem set: 0 solved, 2 unsolved in 780 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 70/70 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1584ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 767 ms.
Support contains 6 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 1374/1374 transitions.
Graph (complete) has 1115 edges and 70 vertex of which 69 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 69 transition count 1371
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 68 transition count 1369
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 68 transition count 1369
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 1 with 4 rules applied. Total rules applied 9 place count 66 transition count 1367
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 66 transition count 1359
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 105 place count 58 transition count 1279
Applied a total of 105 rules in 227 ms. Remains 58 /70 variables (removed 12) and now considering 1279/1374 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 58/70 places, 1279/1374 transitions.
RANDOM walk for 40000 steps (483 resets) in 2171 ms. (18 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (93 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (90 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 347469 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 2
Probabilistic random walk after 347469 steps, saw 54165 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
// Phase 1: matrix 1279 rows 58 cols
[2024-06-01 07:46:36] [INFO ] Computed 13 invariants in 7 ms
[2024-06-01 07:46:37] [INFO ] State equation strengthened by 222 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) 18/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/56 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/58 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1279/1337 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1337 variables, 222/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1337 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1337 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1337/1337 variables, and 293 constraints, problems are : Problem set: 0 solved, 2 unsolved in 599 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 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) 18/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/56 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/58 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1279/1337 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1337 variables, 222/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1337 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1337 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1337/1337 variables, and 293 constraints, problems are : Problem set: 0 solved, 2 unsolved in 634 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1295ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 693 ms.
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 82 ms. Remains 58 /58 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 58/58 places, 1279/1279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 82 ms. Remains 58 /58 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
[2024-06-01 07:46:39] [INFO ] Invariant cache hit.
[2024-06-01 07:46:39] [INFO ] Implicit Places using invariants in 620 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 626 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 57/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 82 ms. Remains 57 /57 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 790 ms. Remains : 57/58 places, 1279/1279 transitions.
RANDOM walk for 40000 steps (444 resets) in 2208 ms. (18 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (95 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (90 resets) in 197 ms. (202 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 352712 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 2
Probabilistic random walk after 352712 steps, saw 54923 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
// Phase 1: matrix 1279 rows 57 cols
[2024-06-01 07:46:43] [INFO ] Computed 12 invariants in 7 ms
[2024-06-01 07:46:43] [INFO ] State equation strengthened by 222 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) 18/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/56 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1279/1335 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 222/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1335 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1336 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1336 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1336 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 571 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 57/57 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 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) 18/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/56 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1279/1335 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 222/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1335 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1336 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1336 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1336 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 665 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 57/57 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1290ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 703 ms.
Support contains 6 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1279/1279 transitions.
Applied a total of 0 rules in 82 ms. Remains 57 /57 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 57/57 places, 1279/1279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1279/1279 transitions.
Applied a total of 0 rules in 82 ms. Remains 57 /57 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
[2024-06-01 07:46:45] [INFO ] Invariant cache hit.
[2024-06-01 07:46:46] [INFO ] Implicit Places using invariants in 625 ms returned []
[2024-06-01 07:46:46] [INFO ] Invariant cache hit.
[2024-06-01 07:46:46] [INFO ] State equation strengthened by 222 read => feed constraints.
[2024-06-01 07:46:47] [INFO ] Implicit Places using invariants and state equation in 1142 ms returned []
Implicit Place search using SMT with State Equation took 1769 ms to find 0 implicit places.
[2024-06-01 07:46:47] [INFO ] Redundant transitions in 45 ms returned []
Running 1278 sub problems to find dead transitions.
[2024-06-01 07:46:47] [INFO ] Invariant cache hit.
[2024-06-01 07:46:47] [INFO ] State equation strengthened by 222 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1279/1336 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
SMT process timed out in 54057ms, After SMT, problems are : Problem set: 0 solved, 1278 unsolved
Search for dead transitions found 0 dead transitions in 54074ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55980 ms. Remains : 57/57 places, 1279/1279 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 82 ms. Remains 57 /57 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-06-01 07:47:41] [INFO ] Invariant cache hit.
[2024-06-01 07:47:41] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-01 07:47:41] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 07:47:41] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-06-01 07:47:42] [INFO ] After 428ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :2
[2024-06-01 07:47:42] [INFO ] After 466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 633 ms.
Knowledge obtained : [(AND (NOT p2) p1)]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 172 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 180 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Product exploration explored 100000 steps with 25000 reset in 7481 ms.
Product exploration explored 100000 steps with 25000 reset in 7516 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 187 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Support contains 6 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 1374/1374 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 1374
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 166 ms. Remains 70 /70 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
[2024-06-01 07:47:58] [INFO ] Redundant transitions in 63 ms returned []
Running 1373 sub problems to find dead transitions.
// Phase 1: matrix 1374 rows 70 cols
[2024-06-01 07:47:58] [INFO ] Computed 12 invariants in 7 ms
[2024-06-01 07:47:58] [INFO ] State equation strengthened by 305 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
Problem TDEAD1063 is UNSAT
Problem TDEAD1067 is UNSAT
At refinement iteration 3 (OVERLAPS) 1373/1443 variables, 70/82 constraints. Problems are: Problem set: 2 solved, 1371 unsolved
SMT process timed out in 55363ms, After SMT, problems are : Problem set: 2 solved, 1371 unsolved
Search for dead transitions found 2 dead transitions in 55382ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 70/70 places, 1372/1374 transitions.
Graph (complete) has 1161 edges and 70 vertex of which 68 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 149 ms. Remains 68 /70 variables (removed 2) and now considering 1372/1372 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/70 places, 1372/1374 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 55770 ms. Remains : 68/70 places, 1372/1374 transitions.
Support contains 6 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 1374/1374 transitions.
Applied a total of 0 rules in 7 ms. Remains 70 /70 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
// Phase 1: matrix 1374 rows 70 cols
[2024-06-01 07:48:54] [INFO ] Computed 12 invariants in 9 ms
[2024-06-01 07:48:54] [INFO ] Implicit Places using invariants in 660 ms returned []
[2024-06-01 07:48:54] [INFO ] Invariant cache hit.
[2024-06-01 07:48:55] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-06-01 07:48:55] [INFO ] Implicit Places using invariants and state equation in 1184 ms returned []
Implicit Place search using SMT with State Equation took 1846 ms to find 0 implicit places.
Running 1373 sub problems to find dead transitions.
[2024-06-01 07:48:55] [INFO ] Invariant cache hit.
[2024-06-01 07:48:55] [INFO ] State equation strengthened by 305 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 3 (OVERLAPS) 1373/1443 variables, 70/82 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
SMT process timed out in 54884ms, After SMT, problems are : Problem set: 0 solved, 1373 unsolved
Search for dead transitions found 0 dead transitions in 54902ms
Finished structural reductions in LTL mode , in 1 iterations and 56760 ms. Remains : 70/70 places, 1374/1374 transitions.
Treatment of property AutonomousCar-PT-10a-LTLFireability-14 finished in 403899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X((X(X(p1))||G(p2)))))))'
[2024-06-01 07:49:51] [INFO ] Flatten gal took : 209 ms
[2024-06-01 07:49:51] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-01 07:49:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 89 places, 1442 transitions and 25487 arcs took 36 ms.
Total runtime 2855405 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : AutonomousCar-PT-10a-LTLFireability-09
Could not compute solution for formula : AutonomousCar-PT-10a-LTLFireability-13
Could not compute solution for formula : AutonomousCar-PT-10a-LTLFireability-14
Could not compute solution for formula : AutonomousCar-PT-10a-LTLFireability-15

BK_STOP 1717228195802

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name AutonomousCar-PT-10a-LTLFireability-09
ltl formula formula --ltl=/tmp/3127/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 89 places, 1442 transitions and 25487 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.250 real 0.090 user 0.080 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3127/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3127/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3127/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3127/ltl_0_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name AutonomousCar-PT-10a-LTLFireability-13
ltl formula formula --ltl=/tmp/3127/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 89 places, 1442 transitions and 25487 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.220 real 0.100 user 0.060 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3127/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3127/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3127/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3127/ltl_1_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
ltl formula name AutonomousCar-PT-10a-LTLFireability-14
ltl formula formula --ltl=/tmp/3127/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 89 places, 1442 transitions and 25487 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.220 real 0.110 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3127/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3127/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3127/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3127/ltl_2_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name AutonomousCar-PT-10a-LTLFireability-15
ltl formula formula --ltl=/tmp/3127/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 89 places, 1442 transitions and 25487 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.210 real 0.080 user 0.070 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3127/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3127/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3127/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3127/ltl_3_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected

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-10a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is AutonomousCar-PT-10a, 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 r468-smll-171620167500364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-10a.tgz
mv AutonomousCar-PT-10a 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 ;