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.r579-smll-171734921400180.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 MedleyA-PT-23, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921400180
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 150K Jun 2 16:33 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 MedleyA-PT-23-LTLFireability-00
FORMULA_NAME MedleyA-PT-23-LTLFireability-01
FORMULA_NAME MedleyA-PT-23-LTLFireability-02
FORMULA_NAME MedleyA-PT-23-LTLFireability-03
FORMULA_NAME MedleyA-PT-23-LTLFireability-04
FORMULA_NAME MedleyA-PT-23-LTLFireability-05
FORMULA_NAME MedleyA-PT-23-LTLFireability-06
FORMULA_NAME MedleyA-PT-23-LTLFireability-07
FORMULA_NAME MedleyA-PT-23-LTLFireability-08
FORMULA_NAME MedleyA-PT-23-LTLFireability-09
FORMULA_NAME MedleyA-PT-23-LTLFireability-10
FORMULA_NAME MedleyA-PT-23-LTLFireability-11
FORMULA_NAME MedleyA-PT-23-LTLFireability-12
FORMULA_NAME MedleyA-PT-23-LTLFireability-13
FORMULA_NAME MedleyA-PT-23-LTLFireability-14
FORMULA_NAME MedleyA-PT-23-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717366204313

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-23
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 22:10:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 22:10:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:10:06] [INFO ] Load time of PNML (sax parser for PT used): 257 ms
[2024-06-02 22:10:06] [INFO ] Transformed 378 places.
[2024-06-02 22:10:06] [INFO ] Transformed 614 transitions.
[2024-06-02 22:10:06] [INFO ] Found NUPN structural information;
[2024-06-02 22:10:06] [INFO ] Parsed PT model containing 378 places and 614 transitions and 1969 arcs in 557 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA MedleyA-PT-23-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 614/614 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 375 transition count 614
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 96 place count 282 transition count 521
Iterating global reduction 1 with 93 rules applied. Total rules applied 189 place count 282 transition count 521
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 256 place count 215 transition count 454
Iterating global reduction 1 with 67 rules applied. Total rules applied 323 place count 215 transition count 454
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 346 place count 192 transition count 413
Iterating global reduction 1 with 23 rules applied. Total rules applied 369 place count 192 transition count 413
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 377 place count 184 transition count 390
Iterating global reduction 1 with 8 rules applied. Total rules applied 385 place count 184 transition count 390
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 386 place count 184 transition count 389
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 388 place count 182 transition count 384
Iterating global reduction 2 with 2 rules applied. Total rules applied 390 place count 182 transition count 384
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 392 place count 182 transition count 382
Applied a total of 392 rules in 137 ms. Remains 182 /378 variables (removed 196) and now considering 382/614 (removed 232) transitions.
// Phase 1: matrix 382 rows 182 cols
[2024-06-02 22:10:07] [INFO ] Computed 8 invariants in 20 ms
[2024-06-02 22:10:07] [INFO ] Implicit Places using invariants in 557 ms returned []
[2024-06-02 22:10:07] [INFO ] Invariant cache hit.
[2024-06-02 22:10:08] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
Running 381 sub problems to find dead transitions.
[2024-06-02 22:10:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-06-02 22:10:13] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (OVERLAPS) 382/564 variables, 182/191 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-06-02 22:10:18] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-06-02 22:10:22] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 8 (OVERLAPS) 0/564 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 381 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 193 constraints, problems are : Problem set: 0 solved, 381 unsolved in 25463 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (OVERLAPS) 382/564 variables, 182/193 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 381/574 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-06-02 22:10:41] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 2 ms to minimize.
[2024-06-02 22:10:45] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 2/576 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 381 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 Int declared 564/564 variables, and 576 constraints, problems are : Problem set: 0 solved, 381 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 5/5 constraints]
After SMT, in 55991ms problems are : Problem set: 0 solved, 381 unsolved
Search for dead transitions found 0 dead transitions in 56033ms
Starting structural reductions in LTL mode, iteration 1 : 182/378 places, 382/614 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57237 ms. Remains : 182/378 places, 382/614 transitions.
Support contains 39 out of 182 places after structural reductions.
[2024-06-02 22:11:04] [INFO ] Flatten gal took : 92 ms
[2024-06-02 22:11:04] [INFO ] Flatten gal took : 49 ms
[2024-06-02 22:11:04] [INFO ] Input system was already deterministic with 382 transitions.
Support contains 38 out of 182 places (down from 39) after GAL structural reductions.
RANDOM walk for 40000 steps (38 resets) in 2281 ms. (17 steps per ms) remains 8/26 properties
BEST_FIRST walk for 40004 steps (11 resets) in 164 ms. (242 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40003 steps (34 resets) in 112 ms. (354 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (17 resets) in 112 ms. (354 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (38 resets) in 149 ms. (266 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (13 resets) in 108 ms. (366 steps per ms) remains 2/3 properties
[2024-06-02 22:11:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/54 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 298/352 variables, 56/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/386 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 158/544 variables, 103/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/544 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 17/561 variables, 9/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/561 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/564 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/564 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/564 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 190 constraints, problems are : Problem set: 0 solved, 2 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/54 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 298/352 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 34/386 variables, 8/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 158/544 variables, 103/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/544 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 17/561 variables, 9/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/561 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/564 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/564 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/564 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 192 constraints, problems are : Problem set: 0 solved, 2 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 644ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 25 ms.
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 382/382 transitions.
Graph (trivial) has 152 edges and 182 vertex of which 20 / 182 are part of one of the 3 SCC in 3 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 165 transition count 335
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 153 transition count 334
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 26 place count 153 transition count 325
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 44 place count 144 transition count 325
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 66 place count 122 transition count 283
Iterating global reduction 2 with 22 rules applied. Total rules applied 88 place count 122 transition count 283
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 91 place count 122 transition count 280
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 91 place count 122 transition count 278
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 95 place count 120 transition count 278
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 115 transition count 264
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 115 transition count 264
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 3 with 4 rules applied. Total rules applied 109 place count 115 transition count 260
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 111 place count 114 transition count 259
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 112 place count 113 transition count 256
Iterating global reduction 5 with 1 rules applied. Total rules applied 113 place count 113 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 114 place count 113 transition count 255
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 160 place count 90 transition count 232
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 166 place count 90 transition count 226
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 171 place count 85 transition count 211
Iterating global reduction 7 with 5 rules applied. Total rules applied 176 place count 85 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 177 place count 85 transition count 210
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 178 place count 84 transition count 208
Iterating global reduction 8 with 1 rules applied. Total rules applied 179 place count 84 transition count 208
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 180 place count 83 transition count 205
Iterating global reduction 8 with 1 rules applied. Total rules applied 181 place count 83 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 182 place count 83 transition count 204
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 9 with 2 rules applied. Total rules applied 184 place count 82 transition count 203
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 202 place count 73 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 211 place count 73 transition count 209
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 214 place count 70 transition count 200
Iterating global reduction 9 with 3 rules applied. Total rules applied 217 place count 70 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 220 place count 70 transition count 197
Free-agglomeration rule applied 20 times.
Iterating global reduction 10 with 20 rules applied. Total rules applied 240 place count 70 transition count 177
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 26 rules applied. Total rules applied 266 place count 50 transition count 171
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 11 with 6 rules applied. Total rules applied 272 place count 47 transition count 168
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 273 place count 46 transition count 167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 274 place count 45 transition count 167
Applied a total of 274 rules in 123 ms. Remains 45 /182 variables (removed 137) and now considering 167/382 (removed 215) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 45/182 places, 167/382 transitions.
RANDOM walk for 130 steps (0 resets) in 8 ms. (14 steps per ms) remains 0/1 properties
Computed a total of 18 stabilizing places and 23 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Graph (trivial) has 141 edges and 182 vertex of which 13 / 182 are part of one of the 2 SCC in 1 ms
Free SCC test removed 11 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 170 transition count 349
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 157 transition count 348
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 28 place count 157 transition count 339
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 46 place count 148 transition count 339
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 68 place count 126 transition count 299
Iterating global reduction 2 with 22 rules applied. Total rules applied 90 place count 126 transition count 299
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 93 place count 126 transition count 296
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 93 place count 126 transition count 294
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 97 place count 124 transition count 294
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 103 place count 118 transition count 278
Iterating global reduction 3 with 6 rules applied. Total rules applied 109 place count 118 transition count 278
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 112 place count 118 transition count 275
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 114 place count 116 transition count 270
Iterating global reduction 4 with 2 rules applied. Total rules applied 116 place count 116 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 117 place count 116 transition count 269
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 167 place count 91 transition count 244
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 172 place count 91 transition count 239
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 179 place count 84 transition count 218
Iterating global reduction 6 with 7 rules applied. Total rules applied 186 place count 84 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 188 place count 84 transition count 216
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 189 place count 83 transition count 214
Iterating global reduction 7 with 1 rules applied. Total rules applied 190 place count 83 transition count 214
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 191 place count 82 transition count 211
Iterating global reduction 7 with 1 rules applied. Total rules applied 192 place count 82 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 193 place count 82 transition count 210
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 8 with 2 rules applied. Total rules applied 195 place count 81 transition count 209
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 213 place count 72 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 215 place count 72 transition count 223
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 221 place count 72 transition count 217
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 223 place count 70 transition count 211
Iterating global reduction 9 with 2 rules applied. Total rules applied 225 place count 70 transition count 211
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 227 place count 70 transition count 209
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 229 place count 68 transition count 207
Applied a total of 229 rules in 91 ms. Remains 68 /182 variables (removed 114) and now considering 207/382 (removed 175) transitions.
[2024-06-02 22:11:06] [INFO ] Flow matrix only has 198 transitions (discarded 9 similar events)
// Phase 1: matrix 198 rows 68 cols
[2024-06-02 22:11:06] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 22:11:07] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 22:11:07] [INFO ] Flow matrix only has 198 transitions (discarded 9 similar events)
[2024-06-02 22:11:07] [INFO ] Invariant cache hit.
[2024-06-02 22:11:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:11:07] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2024-06-02 22:11:07] [INFO ] Redundant transitions in 10 ms returned []
Running 187 sub problems to find dead transitions.
[2024-06-02 22:11:07] [INFO ] Flow matrix only has 198 transitions (discarded 9 similar events)
[2024-06-02 22:11:07] [INFO ] Invariant cache hit.
[2024-06-02 22:11:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 195/260 variables, 65/73 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 5/265 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (OVERLAPS) 0/265 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/266 variables, and 77 constraints, problems are : Problem set: 0 solved, 187 unsolved in 5381 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 68/68 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 195/260 variables, 65/73 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 5/265 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 187/264 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 0/265 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/266 variables, and 264 constraints, problems are : Problem set: 0 solved, 187 unsolved in 6703 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 68/68 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
After SMT, in 12221ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 12225ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/182 places, 207/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12613 ms. Remains : 68/182 places, 207/382 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-23-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-00 finished in 12900 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(p1)))))'
Support contains 4 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 166 transition count 354
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 166 transition count 354
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 157 transition count 336
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 157 transition count 336
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 157 transition count 333
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 152 transition count 322
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 152 transition count 322
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 152 transition count 320
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 150 transition count 315
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 150 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 150 transition count 313
Applied a total of 71 rules in 18 ms. Remains 150 /182 variables (removed 32) and now considering 313/382 (removed 69) transitions.
// Phase 1: matrix 313 rows 150 cols
[2024-06-02 22:11:19] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:11:19] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-06-02 22:11:19] [INFO ] Invariant cache hit.
[2024-06-02 22:11:20] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 312 sub problems to find dead transitions.
[2024-06-02 22:11:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 22:11:23] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 313/463 variables, 150/159 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 22:11:26] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 160 constraints, problems are : Problem set: 0 solved, 312 unsolved in 14668 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 313/463 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 312/472 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 22:11:39] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 2 ms to minimize.
[2024-06-02 22:11:39] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (OVERLAPS) 0/463 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 474 constraints, problems are : Problem set: 0 solved, 312 unsolved in 23087 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 4/4 constraints]
After SMT, in 37905ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 37910ms
Starting structural reductions in LTL mode, iteration 1 : 150/182 places, 313/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38405 ms. Remains : 150/182 places, 313/382 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-23-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-01 finished in 38583 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 U p2)&&p0))))'
Support contains 7 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Graph (trivial) has 143 edges and 182 vertex of which 20 / 182 are part of one of the 3 SCC in 1 ms
Free SCC test removed 17 places
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 164 transition count 340
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 152 transition count 339
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 26 place count 152 transition count 331
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 42 place count 144 transition count 331
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 63 place count 123 transition count 290
Iterating global reduction 2 with 21 rules applied. Total rules applied 84 place count 123 transition count 290
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 87 place count 123 transition count 287
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 87 place count 123 transition count 286
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 89 place count 122 transition count 286
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 93 place count 118 transition count 275
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 118 transition count 275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 99 place count 118 transition count 273
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 100 place count 117 transition count 270
Iterating global reduction 4 with 1 rules applied. Total rules applied 101 place count 117 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 102 place count 117 transition count 269
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 144 place count 96 transition count 248
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 148 place count 96 transition count 244
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 153 place count 91 transition count 229
Iterating global reduction 6 with 5 rules applied. Total rules applied 158 place count 91 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 159 place count 91 transition count 228
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 160 place count 90 transition count 226
Iterating global reduction 7 with 1 rules applied. Total rules applied 161 place count 90 transition count 226
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 162 place count 89 transition count 223
Iterating global reduction 7 with 1 rules applied. Total rules applied 163 place count 89 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 164 place count 89 transition count 222
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 8 with 2 rules applied. Total rules applied 166 place count 88 transition count 221
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 182 place count 80 transition count 233
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 191 place count 80 transition count 224
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 194 place count 77 transition count 215
Iterating global reduction 8 with 3 rules applied. Total rules applied 197 place count 77 transition count 215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 200 place count 77 transition count 212
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 202 place count 75 transition count 210
Applied a total of 202 rules in 98 ms. Remains 75 /182 variables (removed 107) and now considering 210/382 (removed 172) transitions.
[2024-06-02 22:11:58] [INFO ] Flow matrix only has 201 transitions (discarded 9 similar events)
// Phase 1: matrix 201 rows 75 cols
[2024-06-02 22:11:58] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:11:58] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-02 22:11:58] [INFO ] Flow matrix only has 201 transitions (discarded 9 similar events)
[2024-06-02 22:11:58] [INFO ] Invariant cache hit.
[2024-06-02 22:11:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:11:58] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-06-02 22:11:58] [INFO ] Redundant transitions in 9 ms returned []
Running 179 sub problems to find dead transitions.
[2024-06-02 22:11:58] [INFO ] Flow matrix only has 201 transitions (discarded 9 similar events)
[2024-06-02 22:11:58] [INFO ] Invariant cache hit.
[2024-06-02 22:11:58] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 2/72 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 197/269 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 6/275 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (OVERLAPS) 0/275 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/276 variables, and 85 constraints, problems are : Problem set: 0 solved, 179 unsolved in 8024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 75/75 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 2/72 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 197/269 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 17/99 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 6/275 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 162/264 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (OVERLAPS) 0/275 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/276 variables, and 264 constraints, problems are : Problem set: 0 solved, 179 unsolved in 8943 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 75/75 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
After SMT, in 17069ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 17072ms
Starting structural reductions in SI_LTL mode, iteration 1 : 75/182 places, 210/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17469 ms. Remains : 75/182 places, 210/382 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-23-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-05 finished in 17598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p1))||p0)))'
Support contains 3 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 165 transition count 353
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 165 transition count 353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 165 transition count 352
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 45 place count 155 transition count 332
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 155 transition count 332
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 59 place count 155 transition count 328
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 150 transition count 317
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 150 transition count 317
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 150 transition count 315
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 73 place count 148 transition count 310
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 148 transition count 310
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 77 place count 148 transition count 308
Applied a total of 77 rules in 12 ms. Remains 148 /182 variables (removed 34) and now considering 308/382 (removed 74) transitions.
// Phase 1: matrix 308 rows 148 cols
[2024-06-02 22:12:15] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:12:16] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 22:12:16] [INFO ] Invariant cache hit.
[2024-06-02 22:12:16] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2024-06-02 22:12:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 22:12:20] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/456 variables, 148/157 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 22:12:24] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 0/456 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 158 constraints, problems are : Problem set: 0 solved, 307 unsolved in 21048 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/456 variables, 148/158 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 307/465 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 22:12:52] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 2 ms to minimize.
[2024-06-02 22:12:52] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/456 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 467 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 4/4 constraints]
After SMT, in 51192ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 51196ms
Starting structural reductions in LTL mode, iteration 1 : 148/182 places, 308/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51569 ms. Remains : 148/182 places, 308/382 transitions.
Stuttering acceptance computed with spot in 189 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 421 ms.
Product exploration explored 100000 steps with 50000 reset in 333 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 26 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-23-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-23-LTLFireability-06 finished in 52582 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&&F((F(p2)&&X(p1))))))))'
Support contains 4 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 165 transition count 351
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 165 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 165 transition count 350
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 45 place count 155 transition count 330
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 155 transition count 330
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 59 place count 155 transition count 326
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 150 transition count 315
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 150 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 150 transition count 313
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 73 place count 148 transition count 308
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 148 transition count 308
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 77 place count 148 transition count 306
Applied a total of 77 rules in 13 ms. Remains 148 /182 variables (removed 34) and now considering 306/382 (removed 76) transitions.
// Phase 1: matrix 306 rows 148 cols
[2024-06-02 22:13:08] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 22:13:08] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-06-02 22:13:08] [INFO ] Invariant cache hit.
[2024-06-02 22:13:09] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2024-06-02 22:13:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (OVERLAPS) 306/454 variables, 148/156 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-02 22:13:17] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (OVERLAPS) 0/454 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 157 constraints, problems are : Problem set: 0 solved, 305 unsolved in 18618 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-02 22:13:29] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (OVERLAPS) 306/454 variables, 148/158 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 305/463 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-02 22:13:35] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 2 ms to minimize.
[2024-06-02 22:13:36] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 2/465 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-02 22:13:42] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/454 variables, and 466 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 5/5 constraints]
After SMT, in 48815ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 48821ms
Starting structural reductions in LTL mode, iteration 1 : 148/182 places, 306/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49433 ms. Remains : 148/182 places, 306/382 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 375 ms.
Product exploration explored 100000 steps with 50000 reset in 315 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 23 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-23-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-23-LTLFireability-07 finished in 50413 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))'
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Graph (trivial) has 152 edges and 182 vertex of which 20 / 182 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 164 transition count 339
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 151 transition count 338
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 28 place count 151 transition count 330
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 44 place count 143 transition count 330
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 66 place count 121 transition count 288
Iterating global reduction 2 with 22 rules applied. Total rules applied 88 place count 121 transition count 288
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 91 place count 121 transition count 285
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 91 place count 121 transition count 283
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 95 place count 119 transition count 283
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 114 transition count 269
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 114 transition count 269
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 108 place count 114 transition count 266
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 109 place count 113 transition count 263
Iterating global reduction 4 with 1 rules applied. Total rules applied 110 place count 113 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 111 place count 113 transition count 262
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 155 place count 91 transition count 240
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 159 place count 91 transition count 236
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 164 place count 86 transition count 221
Iterating global reduction 6 with 5 rules applied. Total rules applied 169 place count 86 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 170 place count 86 transition count 220
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 171 place count 85 transition count 218
Iterating global reduction 7 with 1 rules applied. Total rules applied 172 place count 85 transition count 218
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 173 place count 84 transition count 215
Iterating global reduction 7 with 1 rules applied. Total rules applied 174 place count 84 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 175 place count 84 transition count 214
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 8 with 2 rules applied. Total rules applied 177 place count 83 transition count 213
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 195 place count 74 transition count 228
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 204 place count 74 transition count 219
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 207 place count 71 transition count 210
Iterating global reduction 8 with 3 rules applied. Total rules applied 210 place count 71 transition count 210
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 213 place count 71 transition count 207
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 215 place count 69 transition count 205
Applied a total of 215 rules in 72 ms. Remains 69 /182 variables (removed 113) and now considering 205/382 (removed 177) transitions.
[2024-06-02 22:13:58] [INFO ] Flow matrix only has 195 transitions (discarded 10 similar events)
// Phase 1: matrix 195 rows 69 cols
[2024-06-02 22:13:58] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:13:59] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 22:13:59] [INFO ] Flow matrix only has 195 transitions (discarded 10 similar events)
[2024-06-02 22:13:59] [INFO ] Invariant cache hit.
[2024-06-02 22:13:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:13:59] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2024-06-02 22:13:59] [INFO ] Redundant transitions in 4 ms returned []
Running 176 sub problems to find dead transitions.
[2024-06-02 22:13:59] [INFO ] Flow matrix only has 195 transitions (discarded 10 similar events)
[2024-06-02 22:13:59] [INFO ] Invariant cache hit.
[2024-06-02 22:13:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 191/257 variables, 66/74 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 6/263 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/263 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/264 variables, and 78 constraints, problems are : Problem set: 0 solved, 176 unsolved in 7125 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 191/257 variables, 66/74 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 6/263 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 175/254 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (OVERLAPS) 0/263 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/264 variables, and 254 constraints, problems are : Problem set: 0 solved, 176 unsolved in 8612 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
After SMT, in 15857ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 15860ms
Starting structural reductions in SI_LTL mode, iteration 1 : 69/182 places, 205/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16254 ms. Remains : 69/182 places, 205/382 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-23-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-08 finished in 16318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)||G(p1)) U (p2||(X(F(p1))&&F(p3)))))'
Support contains 7 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 165 transition count 351
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 165 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 165 transition count 350
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 43 place count 157 transition count 334
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 157 transition count 334
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 55 place count 157 transition count 330
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 153 transition count 321
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 153 transition count 321
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 153 transition count 319
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 152 transition count 317
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 152 transition count 317
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 152 transition count 316
Applied a total of 68 rules in 17 ms. Remains 152 /182 variables (removed 30) and now considering 316/382 (removed 66) transitions.
// Phase 1: matrix 316 rows 152 cols
[2024-06-02 22:14:15] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:14:15] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-06-02 22:14:15] [INFO ] Invariant cache hit.
[2024-06-02 22:14:15] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
Running 315 sub problems to find dead transitions.
[2024-06-02 22:14:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (OVERLAPS) 316/468 variables, 152/160 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-06-02 22:14:25] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (OVERLAPS) 0/468 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 161 constraints, problems are : Problem set: 0 solved, 315 unsolved in 22548 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 316/468 variables, 152/161 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 315/476 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-06-02 22:14:46] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 3 ms to minimize.
[2024-06-02 22:14:46] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-06-02 22:14:52] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/468 variables, and 479 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 4/4 constraints]
After SMT, in 52770ms problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 52776ms
Starting structural reductions in LTL mode, iteration 1 : 152/182 places, 316/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53374 ms. Remains : 152/182 places, 316/382 transitions.
Stuttering acceptance computed with spot in 499 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p0)), (NOT p1), (NOT p3), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-09
Stuttering criterion allowed to conclude after 55 steps with 1 reset in 1 ms.
FORMULA MedleyA-PT-23-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-09 finished in 53904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(G(p2)))))'
Support contains 6 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Graph (trivial) has 147 edges and 182 vertex of which 20 / 182 are part of one of the 3 SCC in 1 ms
Free SCC test removed 17 places
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 164 transition count 339
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 151 transition count 338
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 28 place count 151 transition count 332
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 40 place count 145 transition count 332
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 61 place count 124 transition count 293
Iterating global reduction 2 with 21 rules applied. Total rules applied 82 place count 124 transition count 293
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 85 place count 124 transition count 290
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 85 place count 124 transition count 289
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 87 place count 123 transition count 289
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 93 place count 117 transition count 272
Iterating global reduction 3 with 6 rules applied. Total rules applied 99 place count 117 transition count 272
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 103 place count 117 transition count 268
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 104 place count 116 transition count 265
Iterating global reduction 4 with 1 rules applied. Total rules applied 105 place count 116 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 106 place count 116 transition count 264
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 152 place count 93 transition count 241
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 156 place count 93 transition count 237
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 161 place count 88 transition count 222
Iterating global reduction 6 with 5 rules applied. Total rules applied 166 place count 88 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 167 place count 88 transition count 221
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 7 with 2 rules applied. Total rules applied 169 place count 87 transition count 220
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 187 place count 78 transition count 235
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 196 place count 78 transition count 226
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 198 place count 76 transition count 220
Iterating global reduction 7 with 2 rules applied. Total rules applied 200 place count 76 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 202 place count 76 transition count 218
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 204 place count 74 transition count 216
Applied a total of 204 rules in 56 ms. Remains 74 /182 variables (removed 108) and now considering 216/382 (removed 166) transitions.
[2024-06-02 22:15:09] [INFO ] Flow matrix only has 207 transitions (discarded 9 similar events)
// Phase 1: matrix 207 rows 74 cols
[2024-06-02 22:15:09] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:15:09] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-02 22:15:09] [INFO ] Flow matrix only has 207 transitions (discarded 9 similar events)
[2024-06-02 22:15:09] [INFO ] Invariant cache hit.
[2024-06-02 22:15:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:15:09] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2024-06-02 22:15:09] [INFO ] Redundant transitions in 4 ms returned []
Running 186 sub problems to find dead transitions.
[2024-06-02 22:15:09] [INFO ] Flow matrix only has 207 transitions (discarded 9 similar events)
[2024-06-02 22:15:09] [INFO ] Invariant cache hit.
[2024-06-02 22:15:09] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 203/274 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 6/280 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (OVERLAPS) 0/280 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/281 variables, and 84 constraints, problems are : Problem set: 0 solved, 186 unsolved in 9119 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 74/74 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 203/274 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 6/280 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 184/270 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 11 (OVERLAPS) 0/280 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/281 variables, and 270 constraints, problems are : Problem set: 0 solved, 186 unsolved in 8616 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 74/74 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 17882ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 17887ms
Starting structural reductions in SI_LTL mode, iteration 1 : 74/182 places, 216/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18309 ms. Remains : 74/182 places, 216/382 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-23-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-11 finished in 18478 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(p0)||(X(p2)&&p1)))))'
Support contains 7 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 167 transition count 357
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 167 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 167 transition count 356
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 39 place count 159 transition count 340
Iterating global reduction 1 with 8 rules applied. Total rules applied 47 place count 159 transition count 340
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 159 transition count 337
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 54 place count 155 transition count 329
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 155 transition count 329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 155 transition count 328
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 61 place count 153 transition count 323
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 153 transition count 323
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 65 place count 153 transition count 321
Applied a total of 65 rules in 8 ms. Remains 153 /182 variables (removed 29) and now considering 321/382 (removed 61) transitions.
// Phase 1: matrix 321 rows 153 cols
[2024-06-02 22:15:27] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:15:27] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 22:15:27] [INFO ] Invariant cache hit.
[2024-06-02 22:15:27] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Running 320 sub problems to find dead transitions.
[2024-06-02 22:15:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (OVERLAPS) 321/474 variables, 153/161 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-02 22:15:37] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (OVERLAPS) 0/474 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/474 variables, and 162 constraints, problems are : Problem set: 0 solved, 320 unsolved in 22905 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 321/474 variables, 153/162 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 320/482 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-02 22:15:57] [INFO ] Deduced a trap composed of 54 places in 122 ms of which 2 ms to minimize.
[2024-06-02 22:15:57] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 2/484 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (OVERLAPS) 0/474 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Int declared 474/474 variables, and 484 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 3/3 constraints]
After SMT, in 53141ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 53147ms
Starting structural reductions in LTL mode, iteration 1 : 153/182 places, 321/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53536 ms. Remains : 153/182 places, 321/382 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-12
Product exploration explored 100000 steps with 11 reset in 234 ms.
Product exploration explored 100000 steps with 12 reset in 603 ms.
Computed a total of 17 stabilizing places and 22 stable transitions
Computed a total of 17 stabilizing places and 22 stable transitions
Detected a total of 17/153 stabilizing places and 22/321 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 712 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
RANDOM walk for 40000 steps (18 resets) in 710 ms. (56 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40001 steps (23 resets) in 495 ms. (80 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 13 factoid took 1844 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 224 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 7 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 321/321 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 321/321 (removed 0) transitions.
[2024-06-02 22:16:25] [INFO ] Invariant cache hit.
[2024-06-02 22:16:26] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-06-02 22:16:26] [INFO ] Invariant cache hit.
[2024-06-02 22:16:26] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
Running 320 sub problems to find dead transitions.
[2024-06-02 22:16:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (OVERLAPS) 321/474 variables, 153/161 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-02 22:16:35] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (OVERLAPS) 0/474 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/474 variables, and 162 constraints, problems are : Problem set: 0 solved, 320 unsolved in 22589 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 321/474 variables, 153/162 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 320/482 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-02 22:16:56] [INFO ] Deduced a trap composed of 54 places in 126 ms of which 3 ms to minimize.
[2024-06-02 22:16:56] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 2/484 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (OVERLAPS) 0/474 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Int declared 474/474 variables, and 484 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 3/3 constraints]
After SMT, in 52826ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 52833ms
Finished structural reductions in LTL mode , in 1 iterations and 53387 ms. Remains : 153/153 places, 321/321 transitions.
Computed a total of 17 stabilizing places and 22 stable transitions
Computed a total of 17 stabilizing places and 22 stable transitions
Detected a total of 17/153 stabilizing places and 22/321 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 652 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
RANDOM walk for 40000 steps (16 resets) in 319 ms. (125 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (48 resets) in 82 ms. (481 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 13 factoid took 1845 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 208 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 60 reset in 225 ms.
Product exploration explored 100000 steps with 3 reset in 409 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 203 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 7 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 321/321 transitions.
Graph (trivial) has 115 edges and 153 vertex of which 16 / 153 are part of one of the 3 SCC in 1 ms
Free SCC test removed 13 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 140 transition count 301
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 7 place count 140 transition count 304
Deduced a syphon composed of 9 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 140 transition count 304
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 19 place count 131 transition count 289
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 28 place count 131 transition count 289
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 53 place count 131 transition count 289
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 131 transition count 288
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 67 place count 118 transition count 263
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 2 with 13 rules applied. Total rules applied 80 place count 118 transition count 263
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 83 place count 118 transition count 260
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 118 transition count 260
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 85 place count 117 transition count 259
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 117 transition count 259
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 98 place count 117 transition count 301
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 101 place count 117 transition count 298
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 104 place count 114 transition count 292
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 107 place count 114 transition count 292
Deduced a syphon composed of 33 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 119 place count 114 transition count 280
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 125 place count 108 transition count 268
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 131 place count 108 transition count 268
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 134 place count 108 transition count 265
Deduced a syphon composed of 30 places in 0 ms
Applied a total of 134 rules in 75 ms. Remains 108 /153 variables (removed 45) and now considering 265/321 (removed 56) transitions.
[2024-06-02 22:17:24] [INFO ] Redundant transitions in 3 ms returned []
Running 264 sub problems to find dead transitions.
[2024-06-02 22:17:24] [INFO ] Flow matrix only has 256 transitions (discarded 9 similar events)
// Phase 1: matrix 256 rows 108 cols
[2024-06-02 22:17:24] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:17:24] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 22:17:26] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
[2024-06-02 22:17:26] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
[2024-06-02 22:17:26] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
[2024-06-02 22:17:27] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-06-02 22:17:27] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD81 is UNSAT
[2024-06-02 22:17:27] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 2 ms to minimize.
Problem TDEAD123 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD174 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 6/14 constraints. Problems are: Problem set: 19 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/14 constraints. Problems are: Problem set: 19 solved, 245 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD149 is UNSAT
At refinement iteration 4 (OVERLAPS) 255/363 variables, 108/122 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 2/124 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/124 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 1/364 variables, 1/125 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/125 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 0/364 variables, 0/125 constraints. Problems are: Problem set: 45 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 125 constraints, problems are : Problem set: 45 solved, 219 unsolved in 15516 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 45 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 17/94 variables, 8/8 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 6/14 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/14 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 252/346 variables, 94/108 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 2/110 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 219/329 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 0/329 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 17/363 variables, 14/343 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/343 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 10 (OVERLAPS) 1/364 variables, 1/344 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/364 variables, 0/344 constraints. Problems are: Problem set: 45 solved, 219 unsolved
At refinement iteration 12 (OVERLAPS) 0/364 variables, 0/344 constraints. Problems are: Problem set: 45 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 344 constraints, problems are : Problem set: 45 solved, 219 unsolved in 22999 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 219/264 constraints, Known Traps: 6/6 constraints]
After SMT, in 38715ms problems are : Problem set: 45 solved, 219 unsolved
Search for dead transitions found 45 dead transitions in 38720ms
Found 45 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 45 transitions
Dead transitions reduction (with SMT) removed 45 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 108/153 places, 220/321 transitions.
Graph (complete) has 438 edges and 108 vertex of which 78 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.3 ms
Discarding 30 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 19 ms. Remains 78 /108 variables (removed 30) and now considering 220/220 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/153 places, 220/321 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 38827 ms. Remains : 78/153 places, 220/321 transitions.
Support contains 7 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 321/321 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 321/321 (removed 0) transitions.
// Phase 1: matrix 321 rows 153 cols
[2024-06-02 22:18:03] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:18:03] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-02 22:18:03] [INFO ] Invariant cache hit.
[2024-06-02 22:18:03] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
Running 320 sub problems to find dead transitions.
[2024-06-02 22:18:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (OVERLAPS) 321/474 variables, 153/161 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-02 22:18:13] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (OVERLAPS) 0/474 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/474 variables, and 162 constraints, problems are : Problem set: 0 solved, 320 unsolved in 22864 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 321/474 variables, 153/162 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 320/482 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-02 22:18:33] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 2 ms to minimize.
[2024-06-02 22:18:33] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 2/484 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (OVERLAPS) 0/474 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Int declared 474/474 variables, and 484 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 3/3 constraints]
After SMT, in 53139ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 53146ms
Finished structural reductions in LTL mode , in 1 iterations and 53656 ms. Remains : 153/153 places, 321/321 transitions.
Treatment of property MedleyA-PT-23-LTLFireability-12 finished in 209309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((p1&&F(G(p2)))))))'
Support contains 3 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Graph (trivial) has 152 edges and 182 vertex of which 20 / 182 are part of one of the 3 SCC in 1 ms
Free SCC test removed 17 places
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 164 transition count 340
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 152 transition count 339
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 26 place count 152 transition count 330
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 44 place count 143 transition count 330
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 65 place count 122 transition count 291
Iterating global reduction 2 with 21 rules applied. Total rules applied 86 place count 122 transition count 291
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 89 place count 122 transition count 288
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 89 place count 122 transition count 286
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 93 place count 120 transition count 286
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 98 place count 115 transition count 272
Iterating global reduction 3 with 5 rules applied. Total rules applied 103 place count 115 transition count 272
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 106 place count 115 transition count 269
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 107 place count 114 transition count 266
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 114 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 109 place count 114 transition count 265
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 153 place count 92 transition count 243
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 157 place count 92 transition count 239
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 162 place count 87 transition count 224
Iterating global reduction 6 with 5 rules applied. Total rules applied 167 place count 87 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 168 place count 87 transition count 223
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 169 place count 86 transition count 221
Iterating global reduction 7 with 1 rules applied. Total rules applied 170 place count 86 transition count 221
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 171 place count 85 transition count 218
Iterating global reduction 7 with 1 rules applied. Total rules applied 172 place count 85 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 173 place count 85 transition count 217
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 8 with 2 rules applied. Total rules applied 175 place count 84 transition count 216
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 193 place count 75 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 202 place count 75 transition count 222
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 205 place count 72 transition count 213
Iterating global reduction 8 with 3 rules applied. Total rules applied 208 place count 72 transition count 213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 211 place count 72 transition count 210
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 213 place count 70 transition count 208
Applied a total of 213 rules in 74 ms. Remains 70 /182 variables (removed 112) and now considering 208/382 (removed 174) transitions.
[2024-06-02 22:18:56] [INFO ] Flow matrix only has 198 transitions (discarded 10 similar events)
// Phase 1: matrix 198 rows 70 cols
[2024-06-02 22:18:56] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:18:57] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 22:18:57] [INFO ] Flow matrix only has 198 transitions (discarded 10 similar events)
[2024-06-02 22:18:57] [INFO ] Invariant cache hit.
[2024-06-02 22:18:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:18:57] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2024-06-02 22:18:57] [INFO ] Redundant transitions in 2 ms returned []
Running 179 sub problems to find dead transitions.
[2024-06-02 22:18:57] [INFO ] Flow matrix only has 198 transitions (discarded 10 similar events)
[2024-06-02 22:18:57] [INFO ] Invariant cache hit.
[2024-06-02 22:18:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 194/261 variables, 67/75 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 6/267 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/267 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/268 variables, and 79 constraints, problems are : Problem set: 0 solved, 179 unsolved in 6929 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 194/261 variables, 67/75 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (OVERLAPS) 6/267 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 178/258 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (OVERLAPS) 0/267 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/268 variables, and 258 constraints, problems are : Problem set: 0 solved, 179 unsolved in 8406 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
After SMT, in 15470ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 15474ms
Starting structural reductions in SI_LTL mode, iteration 1 : 70/182 places, 208/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15900 ms. Remains : 70/182 places, 208/382 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-13
Product exploration explored 100000 steps with 11 reset in 353 ms.
Product exploration explored 100000 steps with 4 reset in 298 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 122 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (41 resets) in 965 ms. (41 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40001 steps (24 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
[2024-06-02 22:19:14] [INFO ] Flow matrix only has 198 transitions (discarded 10 similar events)
[2024-06-02 22:19:14] [INFO ] Invariant cache hit.
[2024-06-02 22:19:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/22 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 91/113 variables, 22/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 137/250 variables, 34/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 13/263 variables, 12/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/264 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/267 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/267 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/267 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/267 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/268 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/22 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 91/113 variables, 22/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 137/250 variables, 34/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 263/268 variables, and 76 constraints, problems are : Problem set: 1 solved, 0 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 7/8 constraints, State Equation: 68/70 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 329ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR p0 p2 (NOT p1))))]
Knowledge based reduction with 18 factoid took 529 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 208/208 transitions.
Applied a total of 0 rules in 6 ms. Remains 70 /70 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2024-06-02 22:19:15] [INFO ] Flow matrix only has 198 transitions (discarded 10 similar events)
[2024-06-02 22:19:15] [INFO ] Invariant cache hit.
[2024-06-02 22:19:15] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-02 22:19:15] [INFO ] Flow matrix only has 198 transitions (discarded 10 similar events)
[2024-06-02 22:19:15] [INFO ] Invariant cache hit.
[2024-06-02 22:19:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:19:15] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2024-06-02 22:19:15] [INFO ] Redundant transitions in 1 ms returned []
Running 179 sub problems to find dead transitions.
[2024-06-02 22:19:15] [INFO ] Flow matrix only has 198 transitions (discarded 10 similar events)
[2024-06-02 22:19:15] [INFO ] Invariant cache hit.
[2024-06-02 22:19:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 194/261 variables, 67/75 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 6/267 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/267 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/268 variables, and 79 constraints, problems are : Problem set: 0 solved, 179 unsolved in 7484 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 194/261 variables, 67/75 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (OVERLAPS) 6/267 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 178/258 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (OVERLAPS) 0/267 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/268 variables, and 258 constraints, problems are : Problem set: 0 solved, 179 unsolved in 8676 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
After SMT, in 16299ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 16305ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16713 ms. Remains : 70/70 places, 208/208 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) p2), (X p2), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X p2)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 149 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 30048 steps (27 resets) in 177 ms. (168 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p2), (X p2), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X p2)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 9 factoid took 313 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 5 reset in 202 ms.
Product exploration explored 100000 steps with 10 reset in 267 ms.
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 208/208 transitions.
Applied a total of 0 rules in 5 ms. Remains 70 /70 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2024-06-02 22:19:33] [INFO ] Flow matrix only has 198 transitions (discarded 10 similar events)
[2024-06-02 22:19:33] [INFO ] Invariant cache hit.
[2024-06-02 22:19:33] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-02 22:19:33] [INFO ] Flow matrix only has 198 transitions (discarded 10 similar events)
[2024-06-02 22:19:33] [INFO ] Invariant cache hit.
[2024-06-02 22:19:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:19:33] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-06-02 22:19:33] [INFO ] Redundant transitions in 1 ms returned []
Running 179 sub problems to find dead transitions.
[2024-06-02 22:19:33] [INFO ] Flow matrix only has 198 transitions (discarded 10 similar events)
[2024-06-02 22:19:33] [INFO ] Invariant cache hit.
[2024-06-02 22:19:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 194/261 variables, 67/75 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 6/267 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/267 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/268 variables, and 79 constraints, problems are : Problem set: 0 solved, 179 unsolved in 7415 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 194/261 variables, 67/75 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (OVERLAPS) 6/267 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 178/258 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (OVERLAPS) 0/267 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/268 variables, and 258 constraints, problems are : Problem set: 0 solved, 179 unsolved in 7501 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
After SMT, in 15045ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 15048ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15424 ms. Remains : 70/70 places, 208/208 transitions.
Treatment of property MedleyA-PT-23-LTLFireability-13 finished in 51912 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((p0||F(G(p1)))))))'
Support contains 5 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 166 transition count 354
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 166 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 166 transition count 353
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 41 place count 158 transition count 338
Iterating global reduction 1 with 8 rules applied. Total rules applied 49 place count 158 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 52 place count 158 transition count 335
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 153 transition count 324
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 153 transition count 324
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 153 transition count 322
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 66 place count 151 transition count 317
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 151 transition count 317
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 151 transition count 315
Applied a total of 70 rules in 9 ms. Remains 151 /182 variables (removed 31) and now considering 315/382 (removed 67) transitions.
// Phase 1: matrix 315 rows 151 cols
[2024-06-02 22:19:48] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:19:48] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-02 22:19:48] [INFO ] Invariant cache hit.
[2024-06-02 22:19:49] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Running 314 sub problems to find dead transitions.
[2024-06-02 22:19:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (OVERLAPS) 315/466 variables, 151/159 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-06-02 22:19:58] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (OVERLAPS) 0/466 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 160 constraints, problems are : Problem set: 0 solved, 314 unsolved in 22738 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 314 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 315/466 variables, 151/160 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 314/474 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-06-02 22:20:19] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 2 ms to minimize.
[2024-06-02 22:20:19] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 8 (OVERLAPS) 0/466 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Int declared 466/466 variables, and 476 constraints, problems are : Problem set: 0 solved, 314 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 3/3 constraints]
After SMT, in 52948ms problems are : Problem set: 0 solved, 314 unsolved
Search for dead transitions found 0 dead transitions in 52953ms
Starting structural reductions in LTL mode, iteration 1 : 151/182 places, 315/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53505 ms. Remains : 151/182 places, 315/382 transitions.
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-23-LTLFireability-14
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-23-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLFireability-14 finished in 53829 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(p0)||(X(p2)&&p1)))))'
Found a Lengthening insensitive property : MedleyA-PT-23-LTLFireability-12
Stuttering acceptance computed with spot in 208 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 7 out of 182 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 182/182 places, 382/382 transitions.
Graph (trivial) has 146 edges and 182 vertex of which 20 / 182 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 164 transition count 338
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 150 transition count 337
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 30 place count 150 transition count 332
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 40 place count 145 transition count 332
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 60 place count 125 transition count 296
Iterating global reduction 2 with 20 rules applied. Total rules applied 80 place count 125 transition count 296
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 125 transition count 294
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 82 place count 125 transition count 292
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 86 place count 123 transition count 292
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 91 place count 118 transition count 277
Iterating global reduction 3 with 5 rules applied. Total rules applied 96 place count 118 transition count 277
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 100 place count 118 transition count 273
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 138 place count 99 transition count 254
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 142 place count 99 transition count 250
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 147 place count 94 transition count 235
Iterating global reduction 5 with 5 rules applied. Total rules applied 152 place count 94 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 153 place count 94 transition count 234
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 154 place count 93 transition count 232
Iterating global reduction 6 with 1 rules applied. Total rules applied 155 place count 93 transition count 232
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 156 place count 92 transition count 229
Iterating global reduction 6 with 1 rules applied. Total rules applied 157 place count 92 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 158 place count 92 transition count 228
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 7 with 2 rules applied. Total rules applied 160 place count 91 transition count 227
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 178 place count 82 transition count 242
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 180 place count 80 transition count 240
Applied a total of 180 rules in 40 ms. Remains 80 /182 variables (removed 102) and now considering 240/382 (removed 142) transitions.
[2024-06-02 22:20:43] [INFO ] Flow matrix only has 231 transitions (discarded 9 similar events)
// Phase 1: matrix 231 rows 80 cols
[2024-06-02 22:20:43] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:20:43] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-06-02 22:20:43] [INFO ] Flow matrix only has 231 transitions (discarded 9 similar events)
[2024-06-02 22:20:43] [INFO ] Invariant cache hit.
[2024-06-02 22:20:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:20:43] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Running 207 sub problems to find dead transitions.
[2024-06-02 22:20:43] [INFO ] Flow matrix only has 231 transitions (discarded 9 similar events)
[2024-06-02 22:20:43] [INFO ] Invariant cache hit.
[2024-06-02 22:20:43] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-02 22:20:45] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 227/304 variables, 77/86 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (OVERLAPS) 6/310 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 10 (OVERLAPS) 0/310 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/311 variables, and 91 constraints, problems are : Problem set: 0 solved, 207 unsolved in 11881 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 80/80 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 227/304 variables, 77/86 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 9 (OVERLAPS) 6/310 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 204/298 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 12 (OVERLAPS) 0/310 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/311 variables, and 298 constraints, problems are : Problem set: 0 solved, 207 unsolved in 11253 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 80/80 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 1/1 constraints]
After SMT, in 23327ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 23331ms
Starting structural reductions in LI_LTL mode, iteration 1 : 80/182 places, 240/382 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 23814 ms. Remains : 80/182 places, 240/382 transitions.
Running random walk in product with property : MedleyA-PT-23-LTLFireability-12
Product exploration explored 100000 steps with 2 reset in 164 ms.
Product exploration explored 100000 steps with 15 reset in 167 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Computed a total of 5 stabilizing places and 10 stable transitions
Detected a total of 5/80 stabilizing places and 10/240 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 12 factoid took 913 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
RANDOM walk for 40000 steps (32 resets) in 516 ms. (77 steps per ms) remains 1/6 properties
BEST_FIRST walk for 1306 steps (10 resets) in 5 ms. (217 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p0 p1))), (F (NOT (OR p2 p0 (NOT p1))))]
Knowledge based reduction with 12 factoid took 2102 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 218 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 7 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 240/240 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-02 22:21:11] [INFO ] Flow matrix only has 231 transitions (discarded 9 similar events)
[2024-06-02 22:21:11] [INFO ] Invariant cache hit.
[2024-06-02 22:21:11] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-06-02 22:21:11] [INFO ] Flow matrix only has 231 transitions (discarded 9 similar events)
[2024-06-02 22:21:11] [INFO ] Invariant cache hit.
[2024-06-02 22:21:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:21:11] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 207 sub problems to find dead transitions.
[2024-06-02 22:21:11] [INFO ] Flow matrix only has 231 transitions (discarded 9 similar events)
[2024-06-02 22:21:11] [INFO ] Invariant cache hit.
[2024-06-02 22:21:11] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-02 22:21:13] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 227/304 variables, 77/86 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (OVERLAPS) 6/310 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 10 (OVERLAPS) 0/310 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/311 variables, and 91 constraints, problems are : Problem set: 0 solved, 207 unsolved in 11819 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 80/80 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 227/304 variables, 77/86 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 9 (OVERLAPS) 6/310 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 204/298 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 12 (OVERLAPS) 0/310 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/311 variables, and 298 constraints, problems are : Problem set: 0 solved, 207 unsolved in 12680 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 80/80 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 1/1 constraints]
After SMT, in 24672ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 24676ms
Finished structural reductions in LTL mode , in 1 iterations and 25114 ms. Remains : 80/80 places, 240/240 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Computed a total of 5 stabilizing places and 10 stable transitions
Detected a total of 5/80 stabilizing places and 10/240 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 12 factoid took 734 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
RANDOM walk for 40000 steps (30 resets) in 791 ms. (50 steps per ms) remains 2/6 properties
BEST_FIRST walk for 7996 steps (15 resets) in 54 ms. (145 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p0 p1))), (F (NOT (OR p2 p0 (NOT p1))))]
Knowledge based reduction with 12 factoid took 2101 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 208 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 213 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering criterion allowed to conclude after 145 steps with 14 reset in 0 ms.
Treatment of property MedleyA-PT-23-LTLFireability-12 finished in 57814 ms.
FORMULA MedleyA-PT-23-LTLFireability-12 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((p1&&F(G(p2)))))))'
[2024-06-02 22:21:40] [INFO ] Flatten gal took : 45 ms
[2024-06-02 22:21:40] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-02 22:21:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 182 places, 382 transitions and 1340 arcs took 10 ms.
Total runtime 694642 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA MedleyA-PT-23-LTLFireability-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MedleyA-PT-23-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717367084400

--------------------
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 MedleyA-PT-23-LTLFireability-12
ltl formula formula --ltl=/tmp/1640/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 182 places, 382 transitions and 1340 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.060 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1640/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1640/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1640/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1640/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 184 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 183, there are 423 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~931 levels ~10000 states ~30424 transitions
pnml2lts-mc( 0/ 4): ~1925 levels ~20000 states ~69348 transitions
pnml2lts-mc( 0/ 4): ~4125 levels ~40000 states ~148252 transitions
pnml2lts-mc( 0/ 4): ~8278 levels ~80000 states ~307308 transitions
pnml2lts-mc( 0/ 4): ~15668 levels ~160000 states ~614280 transitions
pnml2lts-mc( 2/ 4): ~37687 levels ~320000 states ~1530712 transitions
pnml2lts-mc( 2/ 4): ~73846 levels ~640000 states ~3140992 transitions
pnml2lts-mc( 2/ 4): ~173053 levels ~1280000 states ~6222392 transitions
pnml2lts-mc( 2/ 4): ~343078 levels ~2560000 states ~12779556 transitions
pnml2lts-mc( 1/ 4): ~563986 levels ~5120000 states ~25508840 transitions
pnml2lts-mc( 2/ 4): ~1328818 levels ~10240000 states ~52943364 transitions
pnml2lts-mc( 2/ 4): ~1632117 levels ~20480000 states ~107069340 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1275426
pnml2lts-mc( 0/ 4): unique states count: 22648031
pnml2lts-mc( 0/ 4): unique transitions count: 116313988
pnml2lts-mc( 0/ 4): - self-loop count: 31182
pnml2lts-mc( 0/ 4): - claim dead count: 9116575
pnml2lts-mc( 0/ 4): - claim found count: 64122770
pnml2lts-mc( 0/ 4): - claim success count: 22653582
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8252309
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 22692824 states 116556477 transitions, fanout: 5.136
pnml2lts-mc( 0/ 4): Total exploration time 182.580 sec (182.440 sec minimum, 182.492 sec on average)
pnml2lts-mc( 0/ 4): States per second: 124290, Transitions per second: 638386
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 262.8MB, 8.2 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/10.0%
pnml2lts-mc( 0/ 4): Stored 385 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 262.8MB (~256.0MB paged-in)
ltl formula name MedleyA-PT-23-LTLFireability-13
ltl formula formula --ltl=/tmp/1640/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 182 places, 382 transitions and 1340 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.060 real 0.020 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1640/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1640/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1640/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1640/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 183 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 183, there are 486 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~245!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 340
pnml2lts-mc( 0/ 4): unique states count: 2214
pnml2lts-mc( 0/ 4): unique transitions count: 30556
pnml2lts-mc( 0/ 4): - self-loop count: 172
pnml2lts-mc( 0/ 4): - claim dead count: 4310
pnml2lts-mc( 0/ 4): - claim found count: 5500
pnml2lts-mc( 0/ 4): - claim success count: 2224
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1301
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2224 states 30644 transitions, fanout: 13.779
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 37067, Transitions per second: 510733
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 13.9 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 385 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-23"
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 MedleyA-PT-23, 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 r579-smll-171734921400180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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