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.r070-tall-171620505200124.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is CANInsertWithFailure-PT-040, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505200124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.8M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716246300215

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-040
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-20 23:05:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 23:05:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 23:05:01] [INFO ] Load time of PNML (sax parser for PT used): 386 ms
[2024-05-20 23:05:01] [INFO ] Transformed 3684 places.
[2024-05-20 23:05:01] [INFO ] Transformed 9840 transitions.
[2024-05-20 23:05:01] [INFO ] Parsed PT model containing 3684 places and 9840 transitions and 26400 arcs in 520 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 3684 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3684/3684 places, 9840/9840 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3683 transition count 9840
Applied a total of 1 rules in 514 ms. Remains 3683 /3684 variables (removed 1) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 23:05:03] [INFO ] Computed 42 invariants in 507 ms
[2024-05-20 23:05:05] [INFO ] Implicit Places using invariants in 2736 ms returned []
[2024-05-20 23:05:05] [INFO ] Invariant cache hit.
[2024-05-20 23:05:08] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 23:05:39] [INFO ] Performed 455/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:05:44] [INFO ] Implicit Places using invariants and state equation in 39419 ms returned []
Implicit Place search using SMT with State Equation took 42185 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-20 23:05:45] [INFO ] Invariant cache hit.
[2024-05-20 23:05:45] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 40314ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 40447ms
Starting structural reductions in LTL mode, iteration 1 : 3683/3684 places, 9840/9840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83240 ms. Remains : 3683/3684 places, 9840/9840 transitions.
Support contains 43 out of 3683 places after structural reductions.
[2024-05-20 23:06:25] [INFO ] Flatten gal took : 381 ms
[2024-05-20 23:06:26] [INFO ] Flatten gal took : 261 ms
[2024-05-20 23:06:26] [INFO ] Input system was already deterministic with 9840 transitions.
Support contains 37 out of 3683 places (down from 43) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 31 to 29
RANDOM walk for 40000 steps (40 resets) in 2611 ms. (15 steps per ms) remains 10/29 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 10/10 properties
[2024-05-20 23:06:28] [INFO ] Invariant cache hit.
[2024-05-20 23:06:28] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 3589/3604 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-20 23:06:28] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 21 ms to minimize.
[2024-05-20 23:06:28] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 2 ms to minimize.
[2024-05-20 23:06:29] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 2 ms to minimize.
[2024-05-20 23:06:29] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 2 ms to minimize.
[2024-05-20 23:06:29] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 1 ms to minimize.
[2024-05-20 23:06:29] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2024-05-20 23:06:29] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 2 ms to minimize.
[2024-05-20 23:06:29] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 2 ms to minimize.
[2024-05-20 23:06:30] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 2 ms to minimize.
[2024-05-20 23:06:30] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 1 ms to minimize.
[2024-05-20 23:06:30] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-05-20 23:06:30] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2024-05-20 23:06:30] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2024-05-20 23:06:30] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2024-05-20 23:06:31] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-20 23:06:31] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 2 ms to minimize.
[2024-05-20 23:06:31] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2024-05-20 23:06:31] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 2 ms to minimize.
[2024-05-20 23:06:31] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-05-20 23:06:31] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3604 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-20 23:06:31] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2024-05-20 23:06:32] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-05-20 23:06:32] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2024-05-20 23:06:32] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2024-05-20 23:06:32] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 2 ms to minimize.
[2024-05-20 23:06:32] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2024-05-20 23:06:32] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2024-05-20 23:06:32] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2024-05-20 23:06:33] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-20 23:06:33] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
SMT process timed out in 5133ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 15 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 3683 transition count 9562
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 556 place count 3405 transition count 9561
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1549 Post agglomeration using F-continuation condition.Transition count delta: 1549
Deduced a syphon composed of 1549 places in 7 ms
Reduce places removed 1549 places and 0 transitions.
Iterating global reduction 2 with 3098 rules applied. Total rules applied 3656 place count 1855 transition count 8012
Drop transitions (Redundant composition of simpler transitions.) removed 1472 transitions
Redundant transition composition rules discarded 1472 transitions
Iterating global reduction 2 with 1472 rules applied. Total rules applied 5128 place count 1855 transition count 6540
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5130 place count 1855 transition count 6538
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 5132 place count 1853 transition count 6538
Partial Free-agglomeration rule applied 1559 times.
Drop transitions (Partial Free agglomeration) removed 1559 transitions
Iterating global reduction 3 with 1559 rules applied. Total rules applied 6691 place count 1853 transition count 6538
Partial Free-agglomeration rule applied 38 times.
Drop transitions (Partial Free agglomeration) removed 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 6729 place count 1853 transition count 6538
Applied a total of 6729 rules in 1991 ms. Remains 1853 /3683 variables (removed 1830) and now considering 6538/9840 (removed 3302) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1992 ms. Remains : 1853/3683 places, 6538/9840 transitions.
RANDOM walk for 40000 steps (215 resets) in 651 ms. (61 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
// Phase 1: matrix 6538 rows 1853 cols
[2024-05-20 23:06:35] [INFO ] Computed 42 invariants in 267 ms
[2024-05-20 23:06:35] [INFO ] State equation strengthened by 6306 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1768/1773 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 23:06:36] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-20 23:06:36] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-20 23:06:36] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-05-20 23:06:36] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-20 23:06:36] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 2 ms to minimize.
[2024-05-20 23:06:36] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:06:36] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-05-20 23:06:36] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-20 23:06:36] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 0 ms to minimize.
[2024-05-20 23:06:36] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 2 ms to minimize.
[2024-05-20 23:06:36] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-20 23:06:36] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-20 23:06:36] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:06:37] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-20 23:06:37] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 0 ms to minimize.
[2024-05-20 23:06:37] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-20 23:06:37] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:06:37] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:06:37] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
[2024-05-20 23:06:37] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1773 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 23:06:37] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 2 ms to minimize.
[2024-05-20 23:06:37] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 0 ms to minimize.
[2024-05-20 23:06:37] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-20 23:06:37] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-20 23:06:37] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 3 ms to minimize.
[2024-05-20 23:06:37] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:06:38] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:06:38] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:06:38] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-20 23:06:38] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:06:38] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-20 23:06:38] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-20 23:06:38] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-20 23:06:38] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-20 23:06:38] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-20 23:06:38] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-20 23:06:38] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-20 23:06:38] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-20 23:06:38] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1773 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1773 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 76/1849 variables, 38/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1849 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/1851 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 23:06:40] [INFO ] Deduced a trap composed of 51 places in 1427 ms of which 12 ms to minimize.
[2024-05-20 23:06:42] [INFO ] Deduced a trap composed of 50 places in 1446 ms of which 11 ms to minimize.
[2024-05-20 23:06:43] [INFO ] Deduced a trap composed of 55 places in 1371 ms of which 11 ms to minimize.
[2024-05-20 23:06:44] [INFO ] Deduced a trap composed of 55 places in 1332 ms of which 10 ms to minimize.
[2024-05-20 23:06:46] [INFO ] Deduced a trap composed of 58 places in 1347 ms of which 11 ms to minimize.
[2024-05-20 23:06:47] [INFO ] Deduced a trap composed of 63 places in 1387 ms of which 11 ms to minimize.
[2024-05-20 23:06:49] [INFO ] Deduced a trap composed of 52 places in 1388 ms of which 11 ms to minimize.
[2024-05-20 23:06:50] [INFO ] Deduced a trap composed of 70 places in 1389 ms of which 11 ms to minimize.
[2024-05-20 23:06:51] [INFO ] Deduced a trap composed of 55 places in 1325 ms of which 10 ms to minimize.
[2024-05-20 23:06:53] [INFO ] Deduced a trap composed of 50 places in 1269 ms of which 10 ms to minimize.
[2024-05-20 23:06:54] [INFO ] Deduced a trap composed of 54 places in 1243 ms of which 10 ms to minimize.
[2024-05-20 23:06:55] [INFO ] Deduced a trap composed of 57 places in 1249 ms of which 10 ms to minimize.
[2024-05-20 23:06:57] [INFO ] Deduced a trap composed of 59 places in 1242 ms of which 10 ms to minimize.
[2024-05-20 23:06:58] [INFO ] Deduced a trap composed of 57 places in 1245 ms of which 10 ms to minimize.
[2024-05-20 23:06:59] [INFO ] Deduced a trap composed of 57 places in 1250 ms of which 10 ms to minimize.
[2024-05-20 23:07:00] [INFO ] Deduced a trap composed of 56 places in 1239 ms of which 10 ms to minimize.
[2024-05-20 23:07:02] [INFO ] Deduced a trap composed of 56 places in 1199 ms of which 10 ms to minimize.
[2024-05-20 23:07:03] [INFO ] Deduced a trap composed of 55 places in 1205 ms of which 10 ms to minimize.
[2024-05-20 23:07:04] [INFO ] Deduced a trap composed of 61 places in 1206 ms of which 10 ms to minimize.
[2024-05-20 23:07:05] [INFO ] Deduced a trap composed of 56 places in 1181 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1851 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 23:07:06] [INFO ] Deduced a trap composed of 45 places in 1153 ms of which 10 ms to minimize.
[2024-05-20 23:07:08] [INFO ] Deduced a trap composed of 57 places in 1130 ms of which 10 ms to minimize.
[2024-05-20 23:07:09] [INFO ] Deduced a trap composed of 73 places in 1087 ms of which 9 ms to minimize.
[2024-05-20 23:07:10] [INFO ] Deduced a trap composed of 64 places in 1088 ms of which 10 ms to minimize.
[2024-05-20 23:07:11] [INFO ] Deduced a trap composed of 55 places in 1096 ms of which 9 ms to minimize.
[2024-05-20 23:07:12] [INFO ] Deduced a trap composed of 58 places in 1094 ms of which 8 ms to minimize.
[2024-05-20 23:07:13] [INFO ] Deduced a trap composed of 52 places in 1133 ms of which 9 ms to minimize.
[2024-05-20 23:07:14] [INFO ] Deduced a trap composed of 57 places in 1116 ms of which 9 ms to minimize.
[2024-05-20 23:07:16] [INFO ] Deduced a trap composed of 52 places in 1085 ms of which 11 ms to minimize.
[2024-05-20 23:07:17] [INFO ] Deduced a trap composed of 55 places in 1099 ms of which 9 ms to minimize.
[2024-05-20 23:07:18] [INFO ] Deduced a trap composed of 57 places in 1060 ms of which 9 ms to minimize.
[2024-05-20 23:07:19] [INFO ] Deduced a trap composed of 55 places in 1201 ms of which 9 ms to minimize.
[2024-05-20 23:07:20] [INFO ] Deduced a trap composed of 53 places in 1092 ms of which 10 ms to minimize.
[2024-05-20 23:07:21] [INFO ] Deduced a trap composed of 56 places in 1116 ms of which 9 ms to minimize.
SMT process timed out in 46402ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1853 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1853/1853 places, 6538/6538 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1845 transition count 6530
Partial Free-agglomeration rule applied 82 times.
Drop transitions (Partial Free agglomeration) removed 82 transitions
Iterating global reduction 0 with 82 rules applied. Total rules applied 98 place count 1845 transition count 6530
Applied a total of 98 rules in 445 ms. Remains 1845 /1853 variables (removed 8) and now considering 6530/6538 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 445 ms. Remains : 1845/1853 places, 6530/6538 transitions.
RANDOM walk for 40000 steps (211 resets) in 745 ms. (53 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 116101 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 2
Probabilistic random walk after 116101 steps, saw 27555 distinct states, run finished after 3006 ms. (steps per millisecond=38 ) properties seen :0
// Phase 1: matrix 6530 rows 1845 cols
[2024-05-20 23:07:25] [INFO ] Computed 42 invariants in 148 ms
[2024-05-20 23:07:25] [INFO ] State equation strengthened by 6403 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 23:07:26] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 23:07:27] [INFO ] Deduced a trap composed of 52 places in 1431 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6530/8373 variables, 1843/1887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8373 variables, 6403/8290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8373 variables, 0/8290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/8375 variables, 2/8292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8375 variables, 0/8292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/8375 variables, 0/8292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8375/8375 variables, and 8292 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5559 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6403/6403 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 23:07:31] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1765 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 76/1841 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/1843 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 23:07:33] [INFO ] Deduced a trap composed of 53 places in 1413 ms of which 11 ms to minimize.
[2024-05-20 23:07:34] [INFO ] Deduced a trap composed of 48 places in 1418 ms of which 11 ms to minimize.
[2024-05-20 23:07:36] [INFO ] Deduced a trap composed of 50 places in 1414 ms of which 10 ms to minimize.
[2024-05-20 23:07:37] [INFO ] Deduced a trap composed of 60 places in 1410 ms of which 11 ms to minimize.
[2024-05-20 23:07:39] [INFO ] Deduced a trap composed of 51 places in 1306 ms of which 11 ms to minimize.
[2024-05-20 23:07:40] [INFO ] Deduced a trap composed of 60 places in 1302 ms of which 10 ms to minimize.
[2024-05-20 23:07:41] [INFO ] Deduced a trap composed of 52 places in 1205 ms of which 10 ms to minimize.
[2024-05-20 23:07:42] [INFO ] Deduced a trap composed of 54 places in 1307 ms of which 10 ms to minimize.
[2024-05-20 23:07:44] [INFO ] Deduced a trap composed of 68 places in 1338 ms of which 11 ms to minimize.
[2024-05-20 23:07:45] [INFO ] Deduced a trap composed of 52 places in 1371 ms of which 12 ms to minimize.
[2024-05-20 23:07:47] [INFO ] Deduced a trap composed of 52 places in 1326 ms of which 12 ms to minimize.
[2024-05-20 23:07:48] [INFO ] Deduced a trap composed of 49 places in 1355 ms of which 10 ms to minimize.
[2024-05-20 23:07:49] [INFO ] Deduced a trap composed of 52 places in 1345 ms of which 11 ms to minimize.
[2024-05-20 23:07:51] [INFO ] Deduced a trap composed of 58 places in 1309 ms of which 11 ms to minimize.
[2024-05-20 23:07:52] [INFO ] Deduced a trap composed of 53 places in 1204 ms of which 9 ms to minimize.
[2024-05-20 23:07:53] [INFO ] Deduced a trap composed of 58 places in 1205 ms of which 10 ms to minimize.
[2024-05-20 23:07:54] [INFO ] Deduced a trap composed of 62 places in 1201 ms of which 10 ms to minimize.
[2024-05-20 23:07:56] [INFO ] Deduced a trap composed of 56 places in 1147 ms of which 9 ms to minimize.
[2024-05-20 23:07:57] [INFO ] Deduced a trap composed of 52 places in 1133 ms of which 9 ms to minimize.
[2024-05-20 23:07:58] [INFO ] Deduced a trap composed of 53 places in 1099 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1843 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 23:07:59] [INFO ] Deduced a trap composed of 56 places in 1120 ms of which 10 ms to minimize.
[2024-05-20 23:08:00] [INFO ] Deduced a trap composed of 52 places in 1144 ms of which 10 ms to minimize.
[2024-05-20 23:08:01] [INFO ] Deduced a trap composed of 53 places in 1134 ms of which 10 ms to minimize.
[2024-05-20 23:08:02] [INFO ] Deduced a trap composed of 52 places in 1125 ms of which 9 ms to minimize.
[2024-05-20 23:08:04] [INFO ] Deduced a trap composed of 48 places in 1051 ms of which 9 ms to minimize.
[2024-05-20 23:08:05] [INFO ] Deduced a trap composed of 50 places in 1123 ms of which 10 ms to minimize.
[2024-05-20 23:08:06] [INFO ] Deduced a trap composed of 51 places in 1074 ms of which 9 ms to minimize.
[2024-05-20 23:08:07] [INFO ] Deduced a trap composed of 57 places in 1112 ms of which 10 ms to minimize.
[2024-05-20 23:08:08] [INFO ] Deduced a trap composed of 57 places in 1092 ms of which 9 ms to minimize.
[2024-05-20 23:08:09] [INFO ] Deduced a trap composed of 107 places in 1120 ms of which 9 ms to minimize.
[2024-05-20 23:08:10] [INFO ] Deduced a trap composed of 63 places in 1006 ms of which 9 ms to minimize.
[2024-05-20 23:08:11] [INFO ] Deduced a trap composed of 54 places in 1009 ms of which 9 ms to minimize.
[2024-05-20 23:08:12] [INFO ] Deduced a trap composed of 53 places in 1015 ms of which 9 ms to minimize.
[2024-05-20 23:08:13] [INFO ] Deduced a trap composed of 53 places in 1017 ms of which 9 ms to minimize.
[2024-05-20 23:08:14] [INFO ] Deduced a trap composed of 54 places in 1029 ms of which 9 ms to minimize.
[2024-05-20 23:08:15] [INFO ] Deduced a trap composed of 56 places in 1010 ms of which 9 ms to minimize.
[2024-05-20 23:08:17] [INFO ] Deduced a trap composed of 59 places in 1036 ms of which 9 ms to minimize.
[2024-05-20 23:08:18] [INFO ] Deduced a trap composed of 58 places in 1024 ms of which 9 ms to minimize.
[2024-05-20 23:08:19] [INFO ] Deduced a trap composed of 55 places in 1037 ms of which 9 ms to minimize.
[2024-05-20 23:08:20] [INFO ] Deduced a trap composed of 56 places in 1018 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1843 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 23:08:21] [INFO ] Deduced a trap composed of 62 places in 1015 ms of which 9 ms to minimize.
[2024-05-20 23:08:22] [INFO ] Deduced a trap composed of 54 places in 1058 ms of which 9 ms to minimize.
[2024-05-20 23:08:23] [INFO ] Deduced a trap composed of 52 places in 1053 ms of which 9 ms to minimize.
[2024-05-20 23:08:24] [INFO ] Deduced a trap composed of 66 places in 1157 ms of which 9 ms to minimize.
[2024-05-20 23:08:25] [INFO ] Deduced a trap composed of 60 places in 1012 ms of which 9 ms to minimize.
[2024-05-20 23:08:26] [INFO ] Deduced a trap composed of 60 places in 990 ms of which 8 ms to minimize.
[2024-05-20 23:08:27] [INFO ] Deduced a trap composed of 56 places in 916 ms of which 8 ms to minimize.
[2024-05-20 23:08:28] [INFO ] Deduced a trap composed of 45 places in 902 ms of which 8 ms to minimize.
[2024-05-20 23:08:29] [INFO ] Deduced a trap composed of 83 places in 954 ms of which 9 ms to minimize.
[2024-05-20 23:08:30] [INFO ] Deduced a trap composed of 58 places in 916 ms of which 8 ms to minimize.
[2024-05-20 23:08:31] [INFO ] Deduced a trap composed of 57 places in 864 ms of which 10 ms to minimize.
[2024-05-20 23:08:32] [INFO ] Deduced a trap composed of 54 places in 868 ms of which 8 ms to minimize.
[2024-05-20 23:08:33] [INFO ] Deduced a trap composed of 60 places in 845 ms of which 7 ms to minimize.
[2024-05-20 23:08:34] [INFO ] Deduced a trap composed of 56 places in 825 ms of which 8 ms to minimize.
[2024-05-20 23:08:34] [INFO ] Deduced a trap composed of 56 places in 822 ms of which 8 ms to minimize.
[2024-05-20 23:08:35] [INFO ] Deduced a trap composed of 57 places in 792 ms of which 7 ms to minimize.
[2024-05-20 23:08:36] [INFO ] Deduced a trap composed of 58 places in 800 ms of which 7 ms to minimize.
[2024-05-20 23:08:37] [INFO ] Deduced a trap composed of 60 places in 847 ms of which 8 ms to minimize.
[2024-05-20 23:08:38] [INFO ] Deduced a trap composed of 58 places in 803 ms of which 7 ms to minimize.
[2024-05-20 23:08:39] [INFO ] Deduced a trap composed of 72 places in 827 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1843 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 23:08:40] [INFO ] Deduced a trap composed of 74 places in 897 ms of which 10 ms to minimize.
[2024-05-20 23:08:40] [INFO ] Deduced a trap composed of 58 places in 894 ms of which 8 ms to minimize.
[2024-05-20 23:08:41] [INFO ] Deduced a trap composed of 56 places in 849 ms of which 8 ms to minimize.
[2024-05-20 23:08:42] [INFO ] Deduced a trap composed of 56 places in 921 ms of which 9 ms to minimize.
[2024-05-20 23:08:43] [INFO ] Deduced a trap composed of 57 places in 944 ms of which 8 ms to minimize.
[2024-05-20 23:08:44] [INFO ] Deduced a trap composed of 54 places in 904 ms of which 9 ms to minimize.
[2024-05-20 23:08:45] [INFO ] Deduced a trap composed of 54 places in 876 ms of which 8 ms to minimize.
[2024-05-20 23:08:46] [INFO ] Deduced a trap composed of 55 places in 839 ms of which 8 ms to minimize.
SMT process timed out in 80852ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6530/6530 transitions.
Applied a total of 0 rules in 191 ms. Remains 1845 /1845 variables (removed 0) and now considering 6530/6530 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 1845/1845 places, 6530/6530 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6530/6530 transitions.
Applied a total of 0 rules in 178 ms. Remains 1845 /1845 variables (removed 0) and now considering 6530/6530 (removed 0) transitions.
[2024-05-20 23:08:46] [INFO ] Invariant cache hit.
[2024-05-20 23:08:48] [INFO ] Implicit Places using invariants in 1970 ms returned []
[2024-05-20 23:08:48] [INFO ] Invariant cache hit.
[2024-05-20 23:08:50] [INFO ] State equation strengthened by 6403 read => feed constraints.
[2024-05-20 23:09:20] [INFO ] Performed 697/1845 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:09:50] [INFO ] Performed 1581/1845 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:09:59] [INFO ] Implicit Places using invariants and state equation in 70844 ms returned []
Implicit Place search using SMT with State Equation took 72817 ms to find 0 implicit places.
[2024-05-20 23:10:00] [INFO ] Redundant transitions in 642 ms returned []
Running 6490 sub problems to find dead transitions.
[2024-05-20 23:10:00] [INFO ] Invariant cache hit.
[2024-05-20 23:10:00] [INFO ] State equation strengthened by 6403 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6490 unsolved
SMT process timed out in 36613ms, After SMT, problems are : Problem set: 0 solved, 6490 unsolved
Search for dead transitions found 0 dead transitions in 36683ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110354 ms. Remains : 1845/1845 places, 6530/6530 transitions.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 162 stabilizing places and 280 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((X(p0) U p1)&&!p0))))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 225 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 23:10:38] [INFO ] Computed 42 invariants in 483 ms
[2024-05-20 23:10:40] [INFO ] Implicit Places using invariants in 2563 ms returned []
[2024-05-20 23:10:40] [INFO ] Invariant cache hit.
[2024-05-20 23:10:43] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 23:11:13] [INFO ] Performed 308/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:11:29] [INFO ] Implicit Places using invariants and state equation in 49318 ms returned []
Implicit Place search using SMT with State Equation took 51883 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-20 23:11:29] [INFO ] Invariant cache hit.
[2024-05-20 23:11:29] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 39460ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39549ms
Finished structural reductions in LTL mode , in 1 iterations and 91692 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-00
Stuttering criterion allowed to conclude after 908 steps with 0 reset in 18 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-00 finished in 92027 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 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 943 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2024-05-20 23:12:10] [INFO ] Computed 42 invariants in 146 ms
[2024-05-20 23:12:11] [INFO ] Implicit Places using invariants in 1259 ms returned []
[2024-05-20 23:12:11] [INFO ] Invariant cache hit.
[2024-05-20 23:12:13] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 23:12:30] [INFO ] Implicit Places using invariants and state equation in 18444 ms returned []
Implicit Place search using SMT with State Equation took 19709 ms to find 0 implicit places.
[2024-05-20 23:12:30] [INFO ] Redundant transitions in 599 ms returned []
Running 6480 sub problems to find dead transitions.
[2024-05-20 23:12:30] [INFO ] Invariant cache hit.
[2024-05-20 23:12:30] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1843 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6480 unsolved
SMT process timed out in 35037ms, After SMT, problems are : Problem set: 0 solved, 6480 unsolved
Search for dead transitions found 0 dead transitions in 35091ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56369 ms. Remains : 1844/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-01
Stuttering criterion allowed to conclude after 204 steps with 0 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-01 finished in 56423 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)) U (X((p1 U p2))||G(p3))))'
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 192 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 23:13:06] [INFO ] Computed 42 invariants in 427 ms
[2024-05-20 23:13:08] [INFO ] Implicit Places using invariants in 2479 ms returned []
[2024-05-20 23:13:08] [INFO ] Invariant cache hit.
[2024-05-20 23:13:11] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 23:13:41] [INFO ] Performed 329/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:13:55] [INFO ] Implicit Places using invariants and state equation in 47147 ms returned []
Implicit Place search using SMT with State Equation took 49626 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-20 23:13:55] [INFO ] Invariant cache hit.
[2024-05-20 23:13:55] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 39140ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39214ms
Finished structural reductions in LTL mode , in 1 iterations and 89059 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 323 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-03
Product exploration explored 100000 steps with 104 reset in 798 ms.
Product exploration explored 100000 steps with 105 reset in 760 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Detected a total of 162/3683 stabilizing places and 280/9840 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p3 p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p3) (NOT p2)))), (X p3), (X (AND p3 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p3 (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (AND p3 (NOT p2) (NOT p1))), (X (NOT (AND p3 (NOT p2) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (AND p3 (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 28 factoid took 671 ms. Reduced automaton from 8 states, 24 edges and 4 AP (stutter sensitive) to 15 states, 47 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 612 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), false, false, false, false, false, false, false, false]
RANDOM walk for 40000 steps (39 resets) in 860 ms. (46 steps per ms) remains 13/25 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 59 ms. (666 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 99 ms. (400 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 13/13 properties
[2024-05-20 23:14:38] [INFO ] Invariant cache hit.
[2024-05-20 23:14:39] [INFO ] State equation strengthened by 3160 read => feed constraints.
Problem apf11 is UNSAT
Problem apf16 is UNSAT
Problem apf17 is UNSAT
Problem apf18 is UNSAT
Problem apf20 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 3599/3603 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 8 unsolved
[2024-05-20 23:14:39] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 2 ms to minimize.
[2024-05-20 23:14:39] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3603 variables, 2/4 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3603 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 76/3679 variables, 38/42 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3679 variables, 0/42 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/3681 variables, 2/44 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3681 variables, 0/44 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 9840/13521 variables, 3681/3725 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/13521 variables, 3160/6885 constraints. Problems are: Problem set: 5 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13521/13523 variables, and 6885 constraints, problems are : Problem set: 5 solved, 8 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 3681/3683 constraints, ReadFeed: 3160/3160 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 5 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 3599/3603 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3603 variables, 2/4 constraints. Problems are: Problem set: 5 solved, 8 unsolved
[2024-05-20 23:14:44] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2024-05-20 23:14:44] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 2 ms to minimize.
[2024-05-20 23:14:44] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 1 ms to minimize.
[2024-05-20 23:14:44] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2024-05-20 23:14:45] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2024-05-20 23:14:45] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2024-05-20 23:14:45] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2024-05-20 23:14:45] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
[2024-05-20 23:14:45] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2024-05-20 23:14:45] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2024-05-20 23:14:46] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2024-05-20 23:14:46] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2024-05-20 23:14:46] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2024-05-20 23:14:46] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-20 23:14:46] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2024-05-20 23:14:46] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2024-05-20 23:14:46] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2024-05-20 23:14:47] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2024-05-20 23:14:47] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2024-05-20 23:14:47] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/3603 variables, 20/24 constraints. Problems are: Problem set: 5 solved, 8 unsolved
[2024-05-20 23:14:47] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-20 23:14:47] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-20 23:14:47] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 2 ms to minimize.
[2024-05-20 23:14:47] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-20 23:14:48] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 2 ms to minimize.
[2024-05-20 23:14:48] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-20 23:14:48] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2024-05-20 23:14:48] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-20 23:14:48] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-20 23:14:48] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2024-05-20 23:14:48] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-20 23:14:48] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-05-20 23:14:49] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
SMT process timed out in 10125ms, After SMT, problems are : Problem set: 5 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 3683 transition count 9563
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 3406 transition count 9562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1557 Post agglomeration using F-continuation condition.Transition count delta: 1557
Deduced a syphon composed of 1557 places in 2 ms
Reduce places removed 1557 places and 0 transitions.
Iterating global reduction 3 with 3114 rules applied. Total rules applied 3670 place count 1848 transition count 8005
Drop transitions (Redundant composition of simpler transitions.) removed 1479 transitions
Redundant transition composition rules discarded 1479 transitions
Iterating global reduction 3 with 1479 rules applied. Total rules applied 5149 place count 1848 transition count 6526
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5151 place count 1848 transition count 6524
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5153 place count 1846 transition count 6524
Partial Free-agglomeration rule applied 1641 times.
Drop transitions (Partial Free agglomeration) removed 1641 transitions
Iterating global reduction 4 with 1641 rules applied. Total rules applied 6794 place count 1846 transition count 6524
Applied a total of 6794 rules in 1229 ms. Remains 1846 /3683 variables (removed 1837) and now considering 6524/9840 (removed 3316) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1229 ms. Remains : 1846/3683 places, 6524/9840 transitions.
RANDOM walk for 40000 steps (215 resets) in 1317 ms. (30 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 105 ms. (377 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 85796 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 8
Probabilistic random walk after 85796 steps, saw 24509 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
// Phase 1: matrix 6524 rows 1846 cols
[2024-05-20 23:14:54] [INFO ] Computed 42 invariants in 156 ms
[2024-05-20 23:14:54] [INFO ] State equation strengthened by 6395 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1762/1766 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-20 23:14:54] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1766 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1766 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 76/1842 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1842 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/1844 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-20 23:14:57] [INFO ] Deduced a trap composed of 69 places in 1516 ms of which 11 ms to minimize.
[2024-05-20 23:14:58] [INFO ] Deduced a trap composed of 57 places in 1470 ms of which 11 ms to minimize.
[2024-05-20 23:15:00] [INFO ] Deduced a trap composed of 75 places in 1506 ms of which 12 ms to minimize.
[2024-05-20 23:15:01] [INFO ] Deduced a trap composed of 47 places in 1393 ms of which 11 ms to minimize.
[2024-05-20 23:15:02] [INFO ] Deduced a trap composed of 53 places in 1378 ms of which 11 ms to minimize.
[2024-05-20 23:15:04] [INFO ] Deduced a trap composed of 46 places in 1274 ms of which 10 ms to minimize.
[2024-05-20 23:15:05] [INFO ] Deduced a trap composed of 57 places in 1294 ms of which 10 ms to minimize.
[2024-05-20 23:15:06] [INFO ] Deduced a trap composed of 49 places in 1255 ms of which 10 ms to minimize.
[2024-05-20 23:15:08] [INFO ] Deduced a trap composed of 47 places in 1175 ms of which 9 ms to minimize.
[2024-05-20 23:15:09] [INFO ] Deduced a trap composed of 47 places in 1190 ms of which 10 ms to minimize.
[2024-05-20 23:15:10] [INFO ] Deduced a trap composed of 63 places in 1227 ms of which 10 ms to minimize.
[2024-05-20 23:15:11] [INFO ] Deduced a trap composed of 57 places in 1098 ms of which 9 ms to minimize.
[2024-05-20 23:15:12] [INFO ] Deduced a trap composed of 52 places in 1140 ms of which 9 ms to minimize.
[2024-05-20 23:15:14] [INFO ] Deduced a trap composed of 52 places in 1128 ms of which 10 ms to minimize.
[2024-05-20 23:15:15] [INFO ] Deduced a trap composed of 74 places in 1128 ms of which 10 ms to minimize.
[2024-05-20 23:15:16] [INFO ] Deduced a trap composed of 47 places in 1098 ms of which 9 ms to minimize.
[2024-05-20 23:15:17] [INFO ] Deduced a trap composed of 51 places in 1110 ms of which 10 ms to minimize.
[2024-05-20 23:15:18] [INFO ] Deduced a trap composed of 46 places in 1059 ms of which 9 ms to minimize.
[2024-05-20 23:15:19] [INFO ] Deduced a trap composed of 62 places in 995 ms of which 8 ms to minimize.
[2024-05-20 23:15:20] [INFO ] Deduced a trap composed of 68 places in 1009 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1844 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-20 23:15:21] [INFO ] Deduced a trap composed of 55 places in 940 ms of which 8 ms to minimize.
[2024-05-20 23:15:22] [INFO ] Deduced a trap composed of 57 places in 944 ms of which 9 ms to minimize.
[2024-05-20 23:15:23] [INFO ] Deduced a trap composed of 53 places in 930 ms of which 8 ms to minimize.
[2024-05-20 23:15:24] [INFO ] Deduced a trap composed of 52 places in 909 ms of which 8 ms to minimize.
[2024-05-20 23:15:25] [INFO ] Deduced a trap composed of 55 places in 921 ms of which 9 ms to minimize.
[2024-05-20 23:15:26] [INFO ] Deduced a trap composed of 52 places in 904 ms of which 8 ms to minimize.
[2024-05-20 23:15:27] [INFO ] Deduced a trap composed of 61 places in 920 ms of which 8 ms to minimize.
[2024-05-20 23:15:28] [INFO ] Deduced a trap composed of 56 places in 916 ms of which 8 ms to minimize.
[2024-05-20 23:15:29] [INFO ] Deduced a trap composed of 66 places in 933 ms of which 9 ms to minimize.
[2024-05-20 23:15:30] [INFO ] Deduced a trap composed of 46 places in 870 ms of which 8 ms to minimize.
[2024-05-20 23:15:31] [INFO ] Deduced a trap composed of 45 places in 867 ms of which 7 ms to minimize.
[2024-05-20 23:15:31] [INFO ] Deduced a trap composed of 59 places in 894 ms of which 8 ms to minimize.
[2024-05-20 23:15:32] [INFO ] Deduced a trap composed of 52 places in 836 ms of which 8 ms to minimize.
[2024-05-20 23:15:33] [INFO ] Deduced a trap composed of 47 places in 866 ms of which 8 ms to minimize.
[2024-05-20 23:15:34] [INFO ] Deduced a trap composed of 47 places in 880 ms of which 7 ms to minimize.
[2024-05-20 23:15:35] [INFO ] Deduced a trap composed of 51 places in 844 ms of which 8 ms to minimize.
[2024-05-20 23:15:36] [INFO ] Deduced a trap composed of 56 places in 790 ms of which 8 ms to minimize.
[2024-05-20 23:15:37] [INFO ] Deduced a trap composed of 58 places in 834 ms of which 7 ms to minimize.
[2024-05-20 23:15:38] [INFO ] Deduced a trap composed of 49 places in 775 ms of which 8 ms to minimize.
[2024-05-20 23:15:38] [INFO ] Deduced a trap composed of 53 places in 745 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1844 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-20 23:15:39] [INFO ] Deduced a trap composed of 47 places in 752 ms of which 7 ms to minimize.
SMT process timed out in 45578ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 181 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 164 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
[2024-05-20 23:15:39] [INFO ] Invariant cache hit.
[2024-05-20 23:15:41] [INFO ] Implicit Places using invariants in 1921 ms returned []
[2024-05-20 23:15:41] [INFO ] Invariant cache hit.
[2024-05-20 23:15:43] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2024-05-20 23:16:13] [INFO ] Performed 767/1846 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:16:43] [INFO ] Performed 1718/1846 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:16:47] [INFO ] Implicit Places using invariants and state equation in 65748 ms returned []
Implicit Place search using SMT with State Equation took 67671 ms to find 0 implicit places.
[2024-05-20 23:16:48] [INFO ] Redundant transitions in 515 ms returned []
Running 6484 sub problems to find dead transitions.
[2024-05-20 23:16:48] [INFO ] Invariant cache hit.
[2024-05-20 23:16:48] [INFO ] State equation strengthened by 6395 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1845 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6484 unsolved
SMT process timed out in 36545ms, After SMT, problems are : Problem set: 0 solved, 6484 unsolved
Search for dead transitions found 0 dead transitions in 36600ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104977 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p3 p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p3) (NOT p2)))), (X p3), (X (AND p3 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p3 (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (AND p3 (NOT p2) (NOT p1))), (X (NOT (AND p3 (NOT p2) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (G (OR p2 p3 p0 (NOT p1))), (G (OR p2 (NOT p3) p0 (NOT p1))), (G (OR p2 p0 (NOT p1))), (G (OR (NOT p2) (NOT p3) p0 (NOT p1))), (G (OR (NOT p2) p3 p0 (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (AND p3 (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (F (NOT (OR p2 (NOT p3) p0 p1))), (F (NOT (AND (NOT p2) p3 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p3) (NOT p0) p1))), (F (NOT (OR p2 p3 p1))), (F p1), (F (NOT (AND (NOT p2) p3))), (F (NOT p0)), (F (NOT (OR p2 p3))), (F (NOT (OR p2 p0 p1))), (F p2), (F (NOT (OR p2 (NOT p3) (NOT p1)))), (F (NOT p3))]
Knowledge based reduction with 33 factoid took 1175 ms. Reduced automaton from 15 states, 47 edges and 4 AP (stutter insensitive) to 14 states, 43 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 577 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 597 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), false, false, false, false, false, false, false, false]
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 3683 transition count 9563
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 3406 transition count 9562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1557 Post agglomeration using F-continuation condition.Transition count delta: 1557
Deduced a syphon composed of 1557 places in 2 ms
Reduce places removed 1557 places and 0 transitions.
Iterating global reduction 3 with 3114 rules applied. Total rules applied 3670 place count 1848 transition count 8005
Drop transitions (Redundant composition of simpler transitions.) removed 1479 transitions
Redundant transition composition rules discarded 1479 transitions
Iterating global reduction 3 with 1479 rules applied. Total rules applied 5149 place count 1848 transition count 6526
Applied a total of 5149 rules in 958 ms. Remains 1848 /3683 variables (removed 1835) and now considering 6526/9840 (removed 3314) transitions.
// Phase 1: matrix 6526 rows 1848 cols
[2024-05-20 23:17:28] [INFO ] Computed 42 invariants in 218 ms
[2024-05-20 23:17:29] [INFO ] Implicit Places using invariants in 1388 ms returned []
[2024-05-20 23:17:29] [INFO ] Invariant cache hit.
[2024-05-20 23:17:30] [INFO ] State equation strengthened by 4755 read => feed constraints.
[2024-05-20 23:17:49] [INFO ] Implicit Places using invariants and state equation in 20030 ms returned []
Implicit Place search using SMT with State Equation took 21419 ms to find 0 implicit places.
[2024-05-20 23:17:50] [INFO ] Redundant transitions in 754 ms returned []
Running 6486 sub problems to find dead transitions.
[2024-05-20 23:17:50] [INFO ] Invariant cache hit.
[2024-05-20 23:17:50] [INFO ] State equation strengthened by 4755 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1847 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6486 unsolved
SMT process timed out in 35491ms, After SMT, problems are : Problem set: 0 solved, 6486 unsolved
Search for dead transitions found 0 dead transitions in 35542ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1848/3683 places, 6526/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58694 ms. Remains : 1848/3683 places, 6526/9840 transitions.
Computed a total of 125 stabilizing places and 202 stable transitions
Computed a total of 125 stabilizing places and 202 stable transitions
Detected a total of 125/1848 stabilizing places and 202/6526 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p3 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X p3), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p2) p3)), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X p0), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
Knowledge based reduction with 37 factoid took 537 ms. Reduced automaton from 14 states, 43 edges and 4 AP (stutter insensitive) to 14 states, 43 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 591 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), false, false, false, false, false, false, false, false]
RANDOM walk for 40000 steps (194 resets) in 1510 ms. (26 steps per ms) remains 10/21 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 68 ms. (579 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 10/10 properties
[2024-05-20 23:18:27] [INFO ] Invariant cache hit.
[2024-05-20 23:18:27] [INFO ] State equation strengthened by 4755 read => feed constraints.
Problem apf1 is UNSAT
Problem apf3 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1764/1768 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1768 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 76/1844 variables, 38/40 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1844 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/1846 variables, 2/42 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1846 variables, 0/42 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 6526/8372 variables, 1846/1888 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8372 variables, 4755/6643 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8372 variables, 0/6643 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 2/8374 variables, 2/6645 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8374 variables, 0/6645 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8374/8374 variables, and 6645 constraints, problems are : Problem set: 2 solved, 8 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1848/1848 constraints, ReadFeed: 4755/4755 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1764/1768 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-20 23:18:33] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1768 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1768 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 76/1844 variables, 38/41 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1844 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/1846 variables, 2/43 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-20 23:18:35] [INFO ] Deduced a trap composed of 47 places in 1404 ms of which 11 ms to minimize.
[2024-05-20 23:18:36] [INFO ] Deduced a trap composed of 59 places in 1455 ms of which 11 ms to minimize.
[2024-05-20 23:18:38] [INFO ] Deduced a trap composed of 47 places in 1370 ms of which 11 ms to minimize.
SMT process timed out in 10479ms, After SMT, problems are : Problem set: 2 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1848 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1848/1848 places, 6526/6526 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1848 transition count 6524
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1846 transition count 6524
Partial Free-agglomeration rule applied 1641 times.
Drop transitions (Partial Free agglomeration) removed 1641 transitions
Iterating global reduction 1 with 1641 rules applied. Total rules applied 1645 place count 1846 transition count 6524
Applied a total of 1645 rules in 469 ms. Remains 1846 /1848 variables (removed 2) and now considering 6524/6526 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 469 ms. Remains : 1846/1848 places, 6524/6526 transitions.
RANDOM walk for 40000 steps (215 resets) in 1196 ms. (33 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 64 ms. (615 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 93716 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 8
Probabilistic random walk after 93716 steps, saw 25465 distinct states, run finished after 3003 ms. (steps per millisecond=31 ) properties seen :0
// Phase 1: matrix 6524 rows 1846 cols
[2024-05-20 23:18:42] [INFO ] Computed 42 invariants in 156 ms
[2024-05-20 23:18:42] [INFO ] State equation strengthened by 6395 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1762/1766 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1766 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 76/1842 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1842 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/1844 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1844 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 6524/8368 variables, 1844/1886 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8368 variables, 6395/8281 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8368 variables, 0/8281 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 2/8370 variables, 2/8283 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8370 variables, 0/8283 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/8370 variables, 0/8283 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8370/8370 variables, and 8283 constraints, problems are : Problem set: 0 solved, 8 unsolved in 6706 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1846/1846 constraints, ReadFeed: 6395/6395 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1762/1766 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-20 23:18:49] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1766 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1766 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 76/1842 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1842 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/1844 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-20 23:18:52] [INFO ] Deduced a trap composed of 48 places in 1416 ms of which 11 ms to minimize.
[2024-05-20 23:18:53] [INFO ] Deduced a trap composed of 51 places in 1489 ms of which 11 ms to minimize.
[2024-05-20 23:18:53] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2024-05-20 23:18:53] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 1 ms to minimize.
[2024-05-20 23:18:55] [INFO ] Deduced a trap composed of 51 places in 1461 ms of which 11 ms to minimize.
[2024-05-20 23:18:56] [INFO ] Deduced a trap composed of 71 places in 1505 ms of which 11 ms to minimize.
[2024-05-20 23:18:58] [INFO ] Deduced a trap composed of 91 places in 1508 ms of which 11 ms to minimize.
[2024-05-20 23:18:59] [INFO ] Deduced a trap composed of 52 places in 1411 ms of which 11 ms to minimize.
[2024-05-20 23:19:01] [INFO ] Deduced a trap composed of 53 places in 1397 ms of which 12 ms to minimize.
[2024-05-20 23:19:02] [INFO ] Deduced a trap composed of 55 places in 1280 ms of which 10 ms to minimize.
[2024-05-20 23:19:03] [INFO ] Deduced a trap composed of 49 places in 1219 ms of which 10 ms to minimize.
[2024-05-20 23:19:04] [INFO ] Deduced a trap composed of 54 places in 1141 ms of which 9 ms to minimize.
[2024-05-20 23:19:06] [INFO ] Deduced a trap composed of 68 places in 1153 ms of which 9 ms to minimize.
[2024-05-20 23:19:07] [INFO ] Deduced a trap composed of 54 places in 1054 ms of which 9 ms to minimize.
[2024-05-20 23:19:08] [INFO ] Deduced a trap composed of 82 places in 1062 ms of which 10 ms to minimize.
[2024-05-20 23:19:09] [INFO ] Deduced a trap composed of 72 places in 1093 ms of which 10 ms to minimize.
[2024-05-20 23:19:10] [INFO ] Deduced a trap composed of 52 places in 1065 ms of which 10 ms to minimize.
[2024-05-20 23:19:11] [INFO ] Deduced a trap composed of 51 places in 1090 ms of which 8 ms to minimize.
[2024-05-20 23:19:12] [INFO ] Deduced a trap composed of 53 places in 1000 ms of which 9 ms to minimize.
[2024-05-20 23:19:13] [INFO ] Deduced a trap composed of 49 places in 1015 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1844 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-20 23:19:14] [INFO ] Deduced a trap composed of 56 places in 1088 ms of which 10 ms to minimize.
[2024-05-20 23:19:15] [INFO ] Deduced a trap composed of 52 places in 1069 ms of which 9 ms to minimize.
[2024-05-20 23:19:17] [INFO ] Deduced a trap composed of 52 places in 1078 ms of which 9 ms to minimize.
[2024-05-20 23:19:18] [INFO ] Deduced a trap composed of 52 places in 1064 ms of which 9 ms to minimize.
[2024-05-20 23:19:19] [INFO ] Deduced a trap composed of 51 places in 1048 ms of which 9 ms to minimize.
[2024-05-20 23:19:20] [INFO ] Deduced a trap composed of 51 places in 1092 ms of which 9 ms to minimize.
[2024-05-20 23:19:21] [INFO ] Deduced a trap composed of 53 places in 1072 ms of which 10 ms to minimize.
[2024-05-20 23:19:22] [INFO ] Deduced a trap composed of 53 places in 1092 ms of which 9 ms to minimize.
[2024-05-20 23:19:23] [INFO ] Deduced a trap composed of 51 places in 1071 ms of which 9 ms to minimize.
[2024-05-20 23:19:24] [INFO ] Deduced a trap composed of 53 places in 1073 ms of which 9 ms to minimize.
[2024-05-20 23:19:25] [INFO ] Deduced a trap composed of 83 places in 1096 ms of which 9 ms to minimize.
[2024-05-20 23:19:26] [INFO ] Deduced a trap composed of 52 places in 1038 ms of which 9 ms to minimize.
[2024-05-20 23:19:28] [INFO ] Deduced a trap composed of 54 places in 1020 ms of which 9 ms to minimize.
[2024-05-20 23:19:28] [INFO ] Deduced a trap composed of 67 places in 934 ms of which 9 ms to minimize.
[2024-05-20 23:19:30] [INFO ] Deduced a trap composed of 71 places in 1024 ms of which 8 ms to minimize.
[2024-05-20 23:19:30] [INFO ] Deduced a trap composed of 50 places in 865 ms of which 8 ms to minimize.
[2024-05-20 23:19:31] [INFO ] Deduced a trap composed of 55 places in 914 ms of which 8 ms to minimize.
[2024-05-20 23:19:32] [INFO ] Deduced a trap composed of 50 places in 939 ms of which 8 ms to minimize.
[2024-05-20 23:19:33] [INFO ] Deduced a trap composed of 56 places in 851 ms of which 8 ms to minimize.
[2024-05-20 23:19:34] [INFO ] Deduced a trap composed of 52 places in 860 ms of which 8 ms to minimize.
SMT process timed out in 52110ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 172 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 163 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
[2024-05-20 23:19:34] [INFO ] Invariant cache hit.
[2024-05-20 23:19:36] [INFO ] Implicit Places using invariants in 1867 ms returned []
[2024-05-20 23:19:36] [INFO ] Invariant cache hit.
[2024-05-20 23:19:38] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2024-05-20 23:20:08] [INFO ] Performed 736/1846 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:20:38] [INFO ] Performed 1633/1846 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:20:45] [INFO ] Implicit Places using invariants and state equation in 68730 ms returned []
Implicit Place search using SMT with State Equation took 70598 ms to find 0 implicit places.
[2024-05-20 23:20:46] [INFO ] Redundant transitions in 511 ms returned []
Running 6484 sub problems to find dead transitions.
[2024-05-20 23:20:46] [INFO ] Invariant cache hit.
[2024-05-20 23:20:46] [INFO ] State equation strengthened by 6395 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1845 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6484 unsolved
SMT process timed out in 36263ms, After SMT, problems are : Problem set: 0 solved, 6484 unsolved
Search for dead transitions found 0 dead transitions in 36316ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107614 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p3 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X p3), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p2) p3)), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X p0), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (F (OR (G p3) (G (NOT p3)))), (G (OR p0 (NOT p1) (NOT p2) (NOT p3))), (G (OR p0 (NOT p1) (NOT p2) p3))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (F (NOT (OR (NOT p1) p2 (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p0) p1 (NOT p2) (NOT p3)))), (F (NOT (OR p1 p2 p3))), (F (NOT (AND (NOT p2) p3))), (F p1), (F p2), (F (NOT (OR p2 p3))), (F (NOT p3)), (F (NOT p0)), (F (NOT (OR p0 p2 (NOT p3))))]
Knowledge based reduction with 39 factoid took 866 ms. Reduced automaton from 14 states, 43 edges and 4 AP (stutter insensitive) to 14 states, 43 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 586 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 591 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 555 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), false, false, false, false, false, false, false, false]
Product exploration explored 100000 steps with 491 reset in 950 ms.
Product exploration explored 100000 steps with 491 reset in 1015 ms.
Built C files in :
/tmp/ltsmin6579950796947908957
[2024-05-20 23:21:26] [INFO ] Too many transitions (6526) to apply POR reductions. Disabling POR matrices.
[2024-05-20 23:21:27] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6579950796947908957
Running compilation step : cd /tmp/ltsmin6579950796947908957;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6579950796947908957;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6579950796947908957;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 1848 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1848/1848 places, 6526/6526 transitions.
Applied a total of 0 rules in 154 ms. Remains 1848 /1848 variables (removed 0) and now considering 6526/6526 (removed 0) transitions.
// Phase 1: matrix 6526 rows 1848 cols
[2024-05-20 23:21:30] [INFO ] Computed 42 invariants in 111 ms
[2024-05-20 23:21:31] [INFO ] Implicit Places using invariants in 1276 ms returned []
[2024-05-20 23:21:31] [INFO ] Invariant cache hit.
[2024-05-20 23:21:32] [INFO ] State equation strengthened by 4755 read => feed constraints.
[2024-05-20 23:21:50] [INFO ] Implicit Places using invariants and state equation in 19210 ms returned []
Implicit Place search using SMT with State Equation took 20488 ms to find 0 implicit places.
[2024-05-20 23:21:51] [INFO ] Redundant transitions in 453 ms returned []
Running 6486 sub problems to find dead transitions.
[2024-05-20 23:21:51] [INFO ] Invariant cache hit.
[2024-05-20 23:21:51] [INFO ] State equation strengthened by 4755 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1847 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6486 unsolved
SMT process timed out in 35183ms, After SMT, problems are : Problem set: 0 solved, 6486 unsolved
Search for dead transitions found 0 dead transitions in 35242ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56354 ms. Remains : 1848/1848 places, 6526/6526 transitions.
Built C files in :
/tmp/ltsmin17763123444043797801
[2024-05-20 23:22:26] [INFO ] Too many transitions (6526) to apply POR reductions. Disabling POR matrices.
[2024-05-20 23:22:26] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17763123444043797801
Running compilation step : cd /tmp/ltsmin17763123444043797801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17763123444043797801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17763123444043797801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-20 23:22:30] [INFO ] Flatten gal took : 158 ms
[2024-05-20 23:22:30] [INFO ] Flatten gal took : 135 ms
[2024-05-20 23:22:30] [INFO ] Time to serialize gal into /tmp/LTL3820264659903576504.gal : 74 ms
[2024-05-20 23:22:30] [INFO ] Time to serialize properties into /tmp/LTL15787956183147991255.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3820264659903576504.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9218559249028453533.hoa' '-atoms' '/tmp/LTL15787956183147991255.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15787956183147991255.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9218559249028453533.hoa
Detected timeout of ITS tools.
[2024-05-20 23:22:45] [INFO ] Flatten gal took : 120 ms
[2024-05-20 23:22:45] [INFO ] Flatten gal took : 122 ms
[2024-05-20 23:22:45] [INFO ] Time to serialize gal into /tmp/LTL638797887724668927.gal : 23 ms
[2024-05-20 23:22:45] [INFO ] Time to serialize properties into /tmp/LTL4897110570484615362.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL638797887724668927.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4897110570484615362.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !(((G(F("((Node37GiveAnswer4>=1)||(Node3GiveAnswer8<1))")))U((X(("(Node37GiveAnswer4>=1)")U("(Node34GiveAnswer16>=1)")))||(G("(Node13I...165
Formula 0 simplified : FG!"((Node37GiveAnswer4>=1)||(Node3GiveAnswer8<1))" R (X(!"(Node37GiveAnswer4>=1)" R !"(Node34GiveAnswer16>=1)") & F!"(Node13ID<1)")
Detected timeout of ITS tools.
[2024-05-20 23:23:00] [INFO ] Flatten gal took : 112 ms
[2024-05-20 23:23:00] [INFO ] Applying decomposition
[2024-05-20 23:23:01] [INFO ] Flatten gal took : 115 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4927566500487820832.txt' '-o' '/tmp/graph4927566500487820832.bin' '-w' '/tmp/graph4927566500487820832.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4927566500487820832.bin' '-l' '-1' '-v' '-w' '/tmp/graph4927566500487820832.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:23:01] [INFO ] Decomposing Gal with order
[2024-05-20 23:23:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:23:02] [INFO ] Removed a total of 4810 redundant transitions.
[2024-05-20 23:23:02] [INFO ] Flatten gal took : 1054 ms
[2024-05-20 23:23:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 3121 labels/synchronizations in 326 ms.
[2024-05-20 23:23:03] [INFO ] Time to serialize gal into /tmp/LTL3351549746250191696.gal : 36 ms
[2024-05-20 23:23:03] [INFO ] Time to serialize properties into /tmp/LTL12712853900787995628.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3351549746250191696.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12712853900787995628.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G(F("((u5.Node37GiveAnswer4>=1)||(u9.Node3GiveAnswer8<1))")))U((X(("(u5.Node37GiveAnswer4>=1)")U("(u18.Node34GiveAnswer16>=1)")))|...185
Formula 0 simplified : FG!"((u5.Node37GiveAnswer4>=1)||(u9.Node3GiveAnswer8<1))" R (X(!"(u5.Node37GiveAnswer4>=1)" R !"(u18.Node34GiveAnswer16>=1)") & F!"(...175
Detected timeout of ITS tools.
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-03 finished in 612621 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(p0)||X((p1 U !p2))))'
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 189 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 23:23:19] [INFO ] Computed 42 invariants in 349 ms
[2024-05-20 23:23:21] [INFO ] Implicit Places using invariants in 2403 ms returned []
[2024-05-20 23:23:21] [INFO ] Invariant cache hit.
[2024-05-20 23:23:23] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 23:23:54] [INFO ] Performed 343/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:24:06] [INFO ] Implicit Places using invariants and state equation in 45611 ms returned []
Implicit Place search using SMT with State Equation took 48015 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-20 23:24:06] [INFO ] Invariant cache hit.
[2024-05-20 23:24:06] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38943ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39017ms
Finished structural reductions in LTL mode , in 1 iterations and 87233 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 1346 ms.
Product exploration explored 100000 steps with 50000 reset in 1300 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 21 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-040-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-05 finished in 90133 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)&&((p1 U p2)||X((!p3 U (p4||G(!p3)))))))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 188 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2024-05-20 23:24:48] [INFO ] Invariant cache hit.
[2024-05-20 23:24:50] [INFO ] Implicit Places using invariants in 2084 ms returned []
[2024-05-20 23:24:50] [INFO ] Invariant cache hit.
[2024-05-20 23:24:53] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 23:25:24] [INFO ] Performed 343/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:25:38] [INFO ] Implicit Places using invariants and state equation in 47305 ms returned []
Implicit Place search using SMT with State Equation took 49390 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-20 23:25:38] [INFO ] Invariant cache hit.
[2024-05-20 23:25:38] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38911ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 38985ms
Finished structural reductions in LTL mode , in 1 iterations and 88573 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-06
Product exploration explored 100000 steps with 33424 reset in 1162 ms.
Product exploration explored 100000 steps with 33194 reset in 1227 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1) p4 (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3))), (X p4), (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3))), (X (AND (NOT p2) p0 (NOT p1))), (X (OR p2 p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3))), (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3))), (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3)))), (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3))))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3)))), (X (X p4)), (X (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (OR p2 p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3)))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 37 factoid took 137 ms. Reduced automaton from 4 states, 27 edges and 5 AP (stutter sensitive) to 4 states, 27 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4))]
Reduction of identical properties reduced properties to check from 18 to 16
RANDOM walk for 40000 steps (40 resets) in 688 ms. (58 steps per ms) remains 10/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 418 ms. (95 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 10/10 properties
[2024-05-20 23:26:20] [INFO ] Invariant cache hit.
[2024-05-20 23:26:20] [INFO ] State equation strengthened by 3160 read => feed constraints.
Problem apf2 is UNSAT
Problem apf4 is UNSAT
Problem apf8 is UNSAT
Problem apf10 is UNSAT
Problem apf15 is UNSAT
Problem apf16 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3598/3603 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 4 unsolved
[2024-05-20 23:26:21] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3603 variables, 1/3 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3603 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/3679 variables, 38/41 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3679 variables, 0/41 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/3681 variables, 2/43 constraints. Problems are: Problem set: 6 solved, 4 unsolved
[2024-05-20 23:26:25] [INFO ] Deduced a trap composed of 70 places in 3187 ms of which 22 ms to minimize.
[2024-05-20 23:26:28] [INFO ] Deduced a trap composed of 66 places in 3008 ms of which 21 ms to minimize.
SMT process timed out in 7851ms, After SMT, problems are : Problem set: 6 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5157 place count 1845 transition count 6521
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5159 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 5161 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1638 times.
Drop transitions (Partial Free agglomeration) removed 1638 transitions
Iterating global reduction 3 with 1638 rules applied. Total rules applied 6799 place count 1843 transition count 6519
Applied a total of 6799 rules in 1086 ms. Remains 1843 /3683 variables (removed 1840) and now considering 6519/9840 (removed 3321) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1086 ms. Remains : 1843/3683 places, 6519/9840 transitions.
RANDOM walk for 40000 steps (214 resets) in 1130 ms. (35 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 2/4 properties
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-20 23:26:30] [INFO ] Computed 42 invariants in 137 ms
[2024-05-20 23:26:30] [INFO ] State equation strengthened by 6394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 23:26:30] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 23:26:32] [INFO ] Deduced a trap composed of 67 places in 1419 ms of which 11 ms to minimize.
[2024-05-20 23:26:33] [INFO ] Deduced a trap composed of 47 places in 1333 ms of which 12 ms to minimize.
[2024-05-20 23:26:35] [INFO ] Deduced a trap composed of 56 places in 1345 ms of which 11 ms to minimize.
[2024-05-20 23:26:36] [INFO ] Deduced a trap composed of 51 places in 1267 ms of which 11 ms to minimize.
[2024-05-20 23:26:37] [INFO ] Deduced a trap composed of 54 places in 1286 ms of which 10 ms to minimize.
[2024-05-20 23:26:39] [INFO ] Deduced a trap composed of 79 places in 1273 ms of which 10 ms to minimize.
[2024-05-20 23:26:40] [INFO ] Deduced a trap composed of 54 places in 1289 ms of which 10 ms to minimize.
[2024-05-20 23:26:41] [INFO ] Deduced a trap composed of 50 places in 1267 ms of which 10 ms to minimize.
[2024-05-20 23:26:43] [INFO ] Deduced a trap composed of 52 places in 1263 ms of which 10 ms to minimize.
[2024-05-20 23:26:44] [INFO ] Deduced a trap composed of 48 places in 1282 ms of which 11 ms to minimize.
[2024-05-20 23:26:45] [INFO ] Deduced a trap composed of 48 places in 1296 ms of which 12 ms to minimize.
[2024-05-20 23:26:46] [INFO ] Deduced a trap composed of 51 places in 1225 ms of which 10 ms to minimize.
[2024-05-20 23:26:48] [INFO ] Deduced a trap composed of 74 places in 1276 ms of which 10 ms to minimize.
[2024-05-20 23:26:49] [INFO ] Deduced a trap composed of 72 places in 1183 ms of which 10 ms to minimize.
[2024-05-20 23:26:50] [INFO ] Deduced a trap composed of 48 places in 1171 ms of which 9 ms to minimize.
[2024-05-20 23:26:51] [INFO ] Deduced a trap composed of 48 places in 1209 ms of which 10 ms to minimize.
[2024-05-20 23:26:53] [INFO ] Deduced a trap composed of 53 places in 1165 ms of which 10 ms to minimize.
[2024-05-20 23:26:54] [INFO ] Deduced a trap composed of 52 places in 1164 ms of which 9 ms to minimize.
[2024-05-20 23:26:55] [INFO ] Deduced a trap composed of 54 places in 1146 ms of which 9 ms to minimize.
[2024-05-20 23:26:56] [INFO ] Deduced a trap composed of 48 places in 1093 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 23:26:57] [INFO ] Deduced a trap composed of 48 places in 1098 ms of which 9 ms to minimize.
[2024-05-20 23:26:58] [INFO ] Deduced a trap composed of 60 places in 1105 ms of which 10 ms to minimize.
[2024-05-20 23:26:59] [INFO ] Deduced a trap composed of 60 places in 1052 ms of which 9 ms to minimize.
[2024-05-20 23:27:00] [INFO ] Deduced a trap composed of 58 places in 1031 ms of which 9 ms to minimize.
[2024-05-20 23:27:01] [INFO ] Deduced a trap composed of 53 places in 905 ms of which 8 ms to minimize.
[2024-05-20 23:27:02] [INFO ] Deduced a trap composed of 51 places in 975 ms of which 8 ms to minimize.
[2024-05-20 23:27:03] [INFO ] Deduced a trap composed of 59 places in 926 ms of which 8 ms to minimize.
[2024-05-20 23:27:04] [INFO ] Deduced a trap composed of 56 places in 918 ms of which 8 ms to minimize.
[2024-05-20 23:27:05] [INFO ] Deduced a trap composed of 51 places in 895 ms of which 8 ms to minimize.
[2024-05-20 23:27:06] [INFO ] Deduced a trap composed of 72 places in 932 ms of which 8 ms to minimize.
[2024-05-20 23:27:07] [INFO ] Deduced a trap composed of 54 places in 861 ms of which 8 ms to minimize.
[2024-05-20 23:27:08] [INFO ] Deduced a trap composed of 55 places in 898 ms of which 8 ms to minimize.
[2024-05-20 23:27:09] [INFO ] Deduced a trap composed of 55 places in 908 ms of which 8 ms to minimize.
[2024-05-20 23:27:10] [INFO ] Deduced a trap composed of 64 places in 941 ms of which 8 ms to minimize.
[2024-05-20 23:27:11] [INFO ] Deduced a trap composed of 48 places in 916 ms of which 8 ms to minimize.
[2024-05-20 23:27:12] [INFO ] Deduced a trap composed of 55 places in 916 ms of which 8 ms to minimize.
[2024-05-20 23:27:13] [INFO ] Deduced a trap composed of 51 places in 867 ms of which 8 ms to minimize.
[2024-05-20 23:27:14] [INFO ] Deduced a trap composed of 47 places in 851 ms of which 8 ms to minimize.
[2024-05-20 23:27:14] [INFO ] Deduced a trap composed of 49 places in 846 ms of which 8 ms to minimize.
[2024-05-20 23:27:15] [INFO ] Deduced a trap composed of 47 places in 838 ms of which 7 ms to minimize.
SMT process timed out in 45633ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 168 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 1843/1843 places, 6519/6519 transitions.
RANDOM walk for 40000 steps (216 resets) in 1116 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 101907 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 2
Probabilistic random walk after 101907 steps, saw 27211 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
[2024-05-20 23:27:19] [INFO ] Invariant cache hit.
[2024-05-20 23:27:19] [INFO ] State equation strengthened by 6394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 23:27:19] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 23:27:21] [INFO ] Deduced a trap composed of 67 places in 1440 ms of which 11 ms to minimize.
[2024-05-20 23:27:22] [INFO ] Deduced a trap composed of 48 places in 1401 ms of which 12 ms to minimize.
[2024-05-20 23:27:23] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6519/8360 variables, 1841/1887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8360 variables, 6394/8281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8360 variables, 0/8281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/8362 variables, 2/8283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8362 variables, 0/8283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/8362 variables, 0/8283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8362/8362 variables, and 8283 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6980 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1843/1843 constraints, ReadFeed: 6394/6394 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 23:27:28] [INFO ] Deduced a trap composed of 47 places in 1255 ms of which 10 ms to minimize.
[2024-05-20 23:27:29] [INFO ] Deduced a trap composed of 58 places in 1330 ms of which 10 ms to minimize.
[2024-05-20 23:27:30] [INFO ] Deduced a trap composed of 49 places in 1272 ms of which 11 ms to minimize.
[2024-05-20 23:27:32] [INFO ] Deduced a trap composed of 47 places in 1233 ms of which 10 ms to minimize.
[2024-05-20 23:27:33] [INFO ] Deduced a trap composed of 51 places in 1184 ms of which 10 ms to minimize.
[2024-05-20 23:27:34] [INFO ] Deduced a trap composed of 49 places in 1154 ms of which 10 ms to minimize.
[2024-05-20 23:27:35] [INFO ] Deduced a trap composed of 51 places in 1159 ms of which 10 ms to minimize.
[2024-05-20 23:27:36] [INFO ] Deduced a trap composed of 47 places in 1193 ms of which 10 ms to minimize.
[2024-05-20 23:27:37] [INFO ] Deduced a trap composed of 53 places in 1031 ms of which 8 ms to minimize.
[2024-05-20 23:27:39] [INFO ] Deduced a trap composed of 72 places in 1150 ms of which 9 ms to minimize.
[2024-05-20 23:27:40] [INFO ] Deduced a trap composed of 61 places in 1097 ms of which 9 ms to minimize.
[2024-05-20 23:27:41] [INFO ] Deduced a trap composed of 67 places in 1074 ms of which 9 ms to minimize.
[2024-05-20 23:27:42] [INFO ] Deduced a trap composed of 56 places in 1078 ms of which 9 ms to minimize.
[2024-05-20 23:27:43] [INFO ] Deduced a trap composed of 59 places in 1076 ms of which 9 ms to minimize.
[2024-05-20 23:27:44] [INFO ] Deduced a trap composed of 58 places in 1061 ms of which 9 ms to minimize.
[2024-05-20 23:27:45] [INFO ] Deduced a trap composed of 63 places in 1079 ms of which 9 ms to minimize.
[2024-05-20 23:27:46] [INFO ] Deduced a trap composed of 48 places in 993 ms of which 9 ms to minimize.
[2024-05-20 23:27:47] [INFO ] Deduced a trap composed of 46 places in 1025 ms of which 9 ms to minimize.
[2024-05-20 23:27:48] [INFO ] Deduced a trap composed of 48 places in 990 ms of which 9 ms to minimize.
[2024-05-20 23:27:49] [INFO ] Deduced a trap composed of 49 places in 987 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 23:27:50] [INFO ] Deduced a trap composed of 52 places in 979 ms of which 8 ms to minimize.
[2024-05-20 23:27:51] [INFO ] Deduced a trap composed of 54 places in 942 ms of which 8 ms to minimize.
[2024-05-20 23:27:52] [INFO ] Deduced a trap composed of 50 places in 927 ms of which 8 ms to minimize.
[2024-05-20 23:27:53] [INFO ] Deduced a trap composed of 49 places in 957 ms of which 9 ms to minimize.
[2024-05-20 23:27:54] [INFO ] Deduced a trap composed of 50 places in 931 ms of which 9 ms to minimize.
[2024-05-20 23:27:55] [INFO ] Deduced a trap composed of 49 places in 917 ms of which 9 ms to minimize.
[2024-05-20 23:27:56] [INFO ] Deduced a trap composed of 69 places in 920 ms of which 8 ms to minimize.
[2024-05-20 23:27:57] [INFO ] Deduced a trap composed of 52 places in 953 ms of which 8 ms to minimize.
[2024-05-20 23:27:58] [INFO ] Deduced a trap composed of 49 places in 867 ms of which 8 ms to minimize.
[2024-05-20 23:27:59] [INFO ] Deduced a trap composed of 63 places in 871 ms of which 7 ms to minimize.
[2024-05-20 23:28:00] [INFO ] Deduced a trap composed of 81 places in 784 ms of which 7 ms to minimize.
[2024-05-20 23:28:00] [INFO ] Deduced a trap composed of 55 places in 780 ms of which 8 ms to minimize.
[2024-05-20 23:28:01] [INFO ] Deduced a trap composed of 67 places in 780 ms of which 7 ms to minimize.
[2024-05-20 23:28:02] [INFO ] Deduced a trap composed of 55 places in 757 ms of which 7 ms to minimize.
[2024-05-20 23:28:03] [INFO ] Deduced a trap composed of 67 places in 768 ms of which 7 ms to minimize.
[2024-05-20 23:28:04] [INFO ] Deduced a trap composed of 51 places in 720 ms of which 7 ms to minimize.
[2024-05-20 23:28:04] [INFO ] Deduced a trap composed of 48 places in 735 ms of which 7 ms to minimize.
[2024-05-20 23:28:05] [INFO ] Deduced a trap composed of 49 places in 679 ms of which 7 ms to minimize.
[2024-05-20 23:28:06] [INFO ] Deduced a trap composed of 47 places in 672 ms of which 7 ms to minimize.
[2024-05-20 23:28:07] [INFO ] Deduced a trap composed of 47 places in 682 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1841 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 23:28:07] [INFO ] Deduced a trap composed of 47 places in 662 ms of which 7 ms to minimize.
[2024-05-20 23:28:08] [INFO ] Deduced a trap composed of 47 places in 676 ms of which 6 ms to minimize.
[2024-05-20 23:28:09] [INFO ] Deduced a trap composed of 68 places in 695 ms of which 7 ms to minimize.
[2024-05-20 23:28:09] [INFO ] Deduced a trap composed of 58 places in 666 ms of which 6 ms to minimize.
[2024-05-20 23:28:10] [INFO ] Deduced a trap composed of 52 places in 622 ms of which 7 ms to minimize.
[2024-05-20 23:28:11] [INFO ] Deduced a trap composed of 52 places in 661 ms of which 6 ms to minimize.
[2024-05-20 23:28:11] [INFO ] Deduced a trap composed of 56 places in 566 ms of which 6 ms to minimize.
[2024-05-20 23:28:12] [INFO ] Deduced a trap composed of 65 places in 578 ms of which 7 ms to minimize.
[2024-05-20 23:28:13] [INFO ] Deduced a trap composed of 64 places in 603 ms of which 6 ms to minimize.
[2024-05-20 23:28:13] [INFO ] Deduced a trap composed of 59 places in 588 ms of which 6 ms to minimize.
[2024-05-20 23:28:14] [INFO ] Deduced a trap composed of 61 places in 563 ms of which 6 ms to minimize.
[2024-05-20 23:28:14] [INFO ] Deduced a trap composed of 68 places in 566 ms of which 5 ms to minimize.
[2024-05-20 23:28:15] [INFO ] Deduced a trap composed of 62 places in 578 ms of which 6 ms to minimize.
[2024-05-20 23:28:16] [INFO ] Deduced a trap composed of 67 places in 574 ms of which 6 ms to minimize.
[2024-05-20 23:28:16] [INFO ] Deduced a trap composed of 68 places in 577 ms of which 5 ms to minimize.
[2024-05-20 23:28:17] [INFO ] Deduced a trap composed of 47 places in 571 ms of which 6 ms to minimize.
[2024-05-20 23:28:17] [INFO ] Deduced a trap composed of 65 places in 574 ms of which 6 ms to minimize.
[2024-05-20 23:28:18] [INFO ] Deduced a trap composed of 48 places in 590 ms of which 6 ms to minimize.
[2024-05-20 23:28:19] [INFO ] Deduced a trap composed of 47 places in 604 ms of which 6 ms to minimize.
[2024-05-20 23:28:19] [INFO ] Deduced a trap composed of 47 places in 612 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1841 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 23:28:20] [INFO ] Deduced a trap composed of 69 places in 615 ms of which 7 ms to minimize.
[2024-05-20 23:28:20] [INFO ] Deduced a trap composed of 67 places in 614 ms of which 7 ms to minimize.
[2024-05-20 23:28:21] [INFO ] Deduced a trap composed of 57 places in 584 ms of which 6 ms to minimize.
[2024-05-20 23:28:22] [INFO ] Deduced a trap composed of 72 places in 629 ms of which 6 ms to minimize.
[2024-05-20 23:28:22] [INFO ] Deduced a trap composed of 68 places in 618 ms of which 6 ms to minimize.
[2024-05-20 23:28:23] [INFO ] Deduced a trap composed of 51 places in 604 ms of which 6 ms to minimize.
[2024-05-20 23:28:24] [INFO ] Deduced a trap composed of 59 places in 636 ms of which 6 ms to minimize.
[2024-05-20 23:28:24] [INFO ] Deduced a trap composed of 66 places in 658 ms of which 7 ms to minimize.
[2024-05-20 23:28:25] [INFO ] Deduced a trap composed of 48 places in 657 ms of which 7 ms to minimize.
[2024-05-20 23:28:26] [INFO ] Deduced a trap composed of 52 places in 707 ms of which 7 ms to minimize.
[2024-05-20 23:28:27] [INFO ] Deduced a trap composed of 54 places in 731 ms of which 8 ms to minimize.
[2024-05-20 23:28:27] [INFO ] Deduced a trap composed of 60 places in 704 ms of which 6 ms to minimize.
[2024-05-20 23:28:28] [INFO ] Deduced a trap composed of 64 places in 673 ms of which 7 ms to minimize.
[2024-05-20 23:28:29] [INFO ] Deduced a trap composed of 52 places in 640 ms of which 6 ms to minimize.
[2024-05-20 23:28:29] [INFO ] Deduced a trap composed of 65 places in 667 ms of which 7 ms to minimize.
[2024-05-20 23:28:30] [INFO ] Deduced a trap composed of 51 places in 579 ms of which 6 ms to minimize.
[2024-05-20 23:28:31] [INFO ] Deduced a trap composed of 51 places in 629 ms of which 6 ms to minimize.
[2024-05-20 23:28:31] [INFO ] Deduced a trap composed of 49 places in 601 ms of which 6 ms to minimize.
[2024-05-20 23:28:32] [INFO ] Deduced a trap composed of 48 places in 596 ms of which 6 ms to minimize.
[2024-05-20 23:28:33] [INFO ] Deduced a trap composed of 66 places in 615 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1841 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 23:28:33] [INFO ] Deduced a trap composed of 64 places in 586 ms of which 6 ms to minimize.
[2024-05-20 23:28:34] [INFO ] Deduced a trap composed of 60 places in 576 ms of which 6 ms to minimize.
[2024-05-20 23:28:34] [INFO ] Deduced a trap composed of 49 places in 604 ms of which 6 ms to minimize.
[2024-05-20 23:28:35] [INFO ] Deduced a trap composed of 72 places in 579 ms of which 6 ms to minimize.
[2024-05-20 23:28:36] [INFO ] Deduced a trap composed of 62 places in 568 ms of which 6 ms to minimize.
[2024-05-20 23:28:36] [INFO ] Deduced a trap composed of 64 places in 570 ms of which 6 ms to minimize.
[2024-05-20 23:28:37] [INFO ] Deduced a trap composed of 56 places in 566 ms of which 6 ms to minimize.
[2024-05-20 23:28:37] [INFO ] Deduced a trap composed of 56 places in 564 ms of which 6 ms to minimize.
[2024-05-20 23:28:38] [INFO ] Deduced a trap composed of 53 places in 571 ms of which 6 ms to minimize.
[2024-05-20 23:28:39] [INFO ] Deduced a trap composed of 49 places in 544 ms of which 6 ms to minimize.
[2024-05-20 23:28:39] [INFO ] Deduced a trap composed of 68 places in 548 ms of which 6 ms to minimize.
[2024-05-20 23:28:40] [INFO ] Deduced a trap composed of 68 places in 537 ms of which 5 ms to minimize.
[2024-05-20 23:28:40] [INFO ] Deduced a trap composed of 55 places in 532 ms of which 5 ms to minimize.
[2024-05-20 23:28:41] [INFO ] Deduced a trap composed of 58 places in 506 ms of which 6 ms to minimize.
[2024-05-20 23:28:41] [INFO ] Deduced a trap composed of 67 places in 459 ms of which 5 ms to minimize.
SMT process timed out in 82322ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 169 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 178 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2024-05-20 23:28:42] [INFO ] Invariant cache hit.
[2024-05-20 23:28:43] [INFO ] Implicit Places using invariants in 1837 ms returned []
[2024-05-20 23:28:43] [INFO ] Invariant cache hit.
[2024-05-20 23:28:45] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-20 23:29:15] [INFO ] Performed 699/1843 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:29:45] [INFO ] Performed 1641/1843 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:29:52] [INFO ] Implicit Places using invariants and state equation in 68244 ms returned []
Implicit Place search using SMT with State Equation took 70085 ms to find 0 implicit places.
[2024-05-20 23:29:52] [INFO ] Redundant transitions in 509 ms returned []
Running 6479 sub problems to find dead transitions.
[2024-05-20 23:29:52] [INFO ] Invariant cache hit.
[2024-05-20 23:29:52] [INFO ] State equation strengthened by 6394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1842 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6479 unsolved
SMT process timed out in 36042ms, After SMT, problems are : Problem set: 0 solved, 6479 unsolved
Search for dead transitions found 0 dead transitions in 36092ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106884 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1) p4 (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3))), (X p4), (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3))), (X (AND (NOT p2) p0 (NOT p1))), (X (OR p2 p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3))), (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3))), (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3)))), (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3))))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3)))), (X (X p4)), (X (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (OR p2 p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3)))))), (X (X p0)), (X (X (NOT p1))), (G (OR (NOT p0) p1 p2 (NOT p3) p4)), (G (OR p0 p1 p2)), (G (OR p0 p1 p2)), (G (OR p0 p1 p2 (NOT p3) p4)), (G (OR p0 (NOT p1) p2)), (G (OR p0 (NOT p1) p2 (NOT p3) p4)), (G (OR (NOT p0) (NOT p1) p2 (NOT p3) p4))]
False Knowledge obtained : [(F (NOT (OR p1 p2 p3 p4))), (F (NOT p4)), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p1) p2 p3 p4))), (F (NOT (AND (OR (NOT p1) p3 p4) (OR (NOT p2) p3 p4)))), (F p2), (F p1), (F (NOT (AND p0 (NOT p1) (NOT p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 44 factoid took 459 ms. Reduced automaton from 4 states, 27 edges and 5 AP (stutter sensitive) to 3 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5157 place count 1845 transition count 6521
Applied a total of 5157 rules in 801 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6521/9840 (removed 3319) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-20 23:30:30] [INFO ] Computed 42 invariants in 133 ms
[2024-05-20 23:30:31] [INFO ] Implicit Places using invariants in 1283 ms returned []
[2024-05-20 23:30:31] [INFO ] Invariant cache hit.
[2024-05-20 23:30:33] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 23:30:48] [INFO ] Implicit Places using invariants and state equation in 16767 ms returned []
Implicit Place search using SMT with State Equation took 18052 ms to find 0 implicit places.
[2024-05-20 23:30:49] [INFO ] Redundant transitions in 674 ms returned []
Running 6481 sub problems to find dead transitions.
[2024-05-20 23:30:49] [INFO ] Invariant cache hit.
[2024-05-20 23:30:49] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 35091ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 35140ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/3683 places, 6521/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54684 ms. Remains : 1845/3683 places, 6521/9840 transitions.
Computed a total of 124 stabilizing places and 201 stable transitions
Computed a total of 124 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) p4), (X (NOT p2)), (X (NOT (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4))))), (X (NOT p3)), (X p4), (X (NOT (AND p1 (NOT p2) (NOT p4)))), (X (NOT (AND p1 (NOT p2) p3 (NOT p4)))), (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4)))), (X (NOT (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4))))), (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4))), (X (OR p1 p2 (NOT p3) p4)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4)))))), (X (X (NOT p3))), (X (X p4)), (X (X (NOT (AND p1 (NOT p2) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4))))), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4)))))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4)))), (X (X (OR p1 p2 (NOT p3) p4))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 29 factoid took 153 ms. Reduced automaton from 3 states, 13 edges and 4 AP (stutter insensitive) to 3 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Reduction of identical properties reduced properties to check from 14 to 12
RANDOM walk for 40000 steps (196 resets) in 653 ms. (61 steps per ms) remains 6/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 6/6 properties
[2024-05-20 23:31:25] [INFO ] Invariant cache hit.
[2024-05-20 23:31:25] [INFO ] State equation strengthened by 4757 read => feed constraints.
Problem apf5 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-20 23:31:25] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/41 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-20 23:31:27] [INFO ] Deduced a trap composed of 68 places in 1343 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 1/44 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 0/44 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 6521/8364 variables, 1843/1887 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8364 variables, 4757/6644 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8364 variables, 0/6644 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/8366 variables, 2/6646 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8366/8366 variables, and 6646 constraints, problems are : Problem set: 2 solved, 4 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 4757/4757 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/41 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 1/44 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-20 23:31:32] [INFO ] Deduced a trap composed of 49 places in 1425 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 1/45 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1843 variables, 0/45 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 6521/8364 variables, 1843/1888 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8364 variables, 4757/6645 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8364 variables, 4/6649 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8364 variables, 0/6649 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/8366 variables, 2/6651 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8366/8366 variables, and 6651 constraints, problems are : Problem set: 2 solved, 4 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 4757/4757 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 10094ms problems are : Problem set: 2 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1638 times.
Drop transitions (Partial Free agglomeration) removed 1638 transitions
Iterating global reduction 1 with 1638 rules applied. Total rules applied 1642 place count 1843 transition count 6519
Applied a total of 1642 rules in 462 ms. Remains 1843 /1845 variables (removed 2) and now considering 6519/6521 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 462 ms. Remains : 1843/1845 places, 6519/6521 transitions.
RANDOM walk for 40000 steps (215 resets) in 1619 ms. (24 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 93146 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 4
Probabilistic random walk after 93146 steps, saw 26133 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-20 23:31:39] [INFO ] Computed 42 invariants in 145 ms
[2024-05-20 23:31:39] [INFO ] State equation strengthened by 6394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 23:31:39] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-20 23:31:39] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 23:31:41] [INFO ] Deduced a trap composed of 62 places in 1441 ms of which 11 ms to minimize.
[2024-05-20 23:31:43] [INFO ] Deduced a trap composed of 46 places in 1404 ms of which 11 ms to minimize.
[2024-05-20 23:31:44] [INFO ] Deduced a trap composed of 60 places in 1387 ms of which 11 ms to minimize.
[2024-05-20 23:31:46] [INFO ] Deduced a trap composed of 51 places in 1351 ms of which 10 ms to minimize.
[2024-05-20 23:31:47] [INFO ] Deduced a trap composed of 51 places in 1301 ms of which 10 ms to minimize.
[2024-05-20 23:31:48] [INFO ] Deduced a trap composed of 55 places in 1299 ms of which 10 ms to minimize.
[2024-05-20 23:31:49] [INFO ] Deduced a trap composed of 53 places in 1293 ms of which 10 ms to minimize.
[2024-05-20 23:31:51] [INFO ] Deduced a trap composed of 51 places in 1177 ms of which 10 ms to minimize.
[2024-05-20 23:31:52] [INFO ] Deduced a trap composed of 54 places in 1224 ms of which 10 ms to minimize.
[2024-05-20 23:31:53] [INFO ] Deduced a trap composed of 65 places in 1270 ms of which 10 ms to minimize.
[2024-05-20 23:31:54] [INFO ] Deduced a trap composed of 52 places in 1157 ms of which 10 ms to minimize.
[2024-05-20 23:31:56] [INFO ] Deduced a trap composed of 53 places in 1119 ms of which 9 ms to minimize.
[2024-05-20 23:31:57] [INFO ] Deduced a trap composed of 51 places in 1057 ms of which 9 ms to minimize.
[2024-05-20 23:31:58] [INFO ] Deduced a trap composed of 53 places in 1140 ms of which 9 ms to minimize.
[2024-05-20 23:31:59] [INFO ] Deduced a trap composed of 48 places in 1123 ms of which 9 ms to minimize.
[2024-05-20 23:32:00] [INFO ] Deduced a trap composed of 51 places in 1115 ms of which 10 ms to minimize.
[2024-05-20 23:32:01] [INFO ] Deduced a trap composed of 47 places in 1108 ms of which 10 ms to minimize.
[2024-05-20 23:32:02] [INFO ] Deduced a trap composed of 46 places in 1092 ms of which 10 ms to minimize.
[2024-05-20 23:32:03] [INFO ] Deduced a trap composed of 56 places in 1040 ms of which 9 ms to minimize.
[2024-05-20 23:32:04] [INFO ] Deduced a trap composed of 61 places in 997 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 23:32:06] [INFO ] Deduced a trap composed of 55 places in 993 ms of which 8 ms to minimize.
[2024-05-20 23:32:07] [INFO ] Deduced a trap composed of 64 places in 984 ms of which 8 ms to minimize.
[2024-05-20 23:32:08] [INFO ] Deduced a trap composed of 57 places in 959 ms of which 9 ms to minimize.
[2024-05-20 23:32:08] [INFO ] Deduced a trap composed of 54 places in 951 ms of which 9 ms to minimize.
[2024-05-20 23:32:09] [INFO ] Deduced a trap composed of 55 places in 942 ms of which 9 ms to minimize.
[2024-05-20 23:32:10] [INFO ] Deduced a trap composed of 56 places in 953 ms of which 9 ms to minimize.
[2024-05-20 23:32:11] [INFO ] Deduced a trap composed of 55 places in 962 ms of which 9 ms to minimize.
[2024-05-20 23:32:12] [INFO ] Deduced a trap composed of 56 places in 908 ms of which 8 ms to minimize.
[2024-05-20 23:32:13] [INFO ] Deduced a trap composed of 53 places in 906 ms of which 8 ms to minimize.
[2024-05-20 23:32:14] [INFO ] Deduced a trap composed of 56 places in 952 ms of which 8 ms to minimize.
[2024-05-20 23:32:15] [INFO ] Deduced a trap composed of 61 places in 935 ms of which 8 ms to minimize.
[2024-05-20 23:32:16] [INFO ] Deduced a trap composed of 47 places in 883 ms of which 8 ms to minimize.
[2024-05-20 23:32:17] [INFO ] Deduced a trap composed of 57 places in 944 ms of which 8 ms to minimize.
[2024-05-20 23:32:18] [INFO ] Deduced a trap composed of 63 places in 946 ms of which 8 ms to minimize.
[2024-05-20 23:32:19] [INFO ] Deduced a trap composed of 77 places in 889 ms of which 8 ms to minimize.
[2024-05-20 23:32:20] [INFO ] Deduced a trap composed of 54 places in 867 ms of which 8 ms to minimize.
[2024-05-20 23:32:21] [INFO ] Deduced a trap composed of 69 places in 884 ms of which 8 ms to minimize.
[2024-05-20 23:32:22] [INFO ] Deduced a trap composed of 52 places in 837 ms of which 8 ms to minimize.
[2024-05-20 23:32:23] [INFO ] Deduced a trap composed of 76 places in 828 ms of which 8 ms to minimize.
[2024-05-20 23:32:23] [INFO ] Deduced a trap composed of 49 places in 791 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 23:32:24] [INFO ] Deduced a trap composed of 65 places in 799 ms of which 7 ms to minimize.
SMT process timed out in 45559ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 170 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 167 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2024-05-20 23:32:25] [INFO ] Invariant cache hit.
[2024-05-20 23:32:26] [INFO ] Implicit Places using invariants in 1870 ms returned []
[2024-05-20 23:32:26] [INFO ] Invariant cache hit.
[2024-05-20 23:32:28] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-20 23:32:58] [INFO ] Performed 682/1843 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:33:28] [INFO ] Performed 1639/1843 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:33:34] [INFO ] Implicit Places using invariants and state equation in 67986 ms returned []
Implicit Place search using SMT with State Equation took 69857 ms to find 0 implicit places.
[2024-05-20 23:33:35] [INFO ] Redundant transitions in 502 ms returned []
Running 6479 sub problems to find dead transitions.
[2024-05-20 23:33:35] [INFO ] Invariant cache hit.
[2024-05-20 23:33:35] [INFO ] State equation strengthened by 6394 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1842 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6479 unsolved
SMT process timed out in 36408ms, After SMT, problems are : Problem set: 0 solved, 6479 unsolved
Search for dead transitions found 0 dead transitions in 36458ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107013 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) p4), (X (NOT p2)), (X (NOT (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4))))), (X (NOT p3)), (X p4), (X (NOT (AND p1 (NOT p2) (NOT p4)))), (X (NOT (AND p1 (NOT p2) p3 (NOT p4)))), (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4)))), (X (NOT (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4))))), (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4))), (X (OR p1 p2 (NOT p3) p4)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4)))))), (X (X (NOT p3))), (X (X p4)), (X (X (NOT (AND p1 (NOT p2) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4))))), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4)))))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4)))), (X (X (OR p1 p2 (NOT p3) p4))), (X (X (NOT p1))), (G (OR (NOT p1) p2 (NOT p3) p4)), (G (OR p1 p2 (NOT p3) p4)), (G (OR p1 p2 (NOT p3) p4))]
False Knowledge obtained : [(F (NOT p4)), (F p1), (F p2), (F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4)))), (F (NOT (OR p1 p2 p3 p4))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 32 factoid took 406 ms. Reduced automaton from 3 states, 13 edges and 4 AP (stutter insensitive) to 3 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Product exploration explored 100000 steps with 33323 reset in 1326 ms.
Product exploration explored 100000 steps with 33214 reset in 1336 ms.
Built C files in :
/tmp/ltsmin5368280706819100398
[2024-05-20 23:34:15] [INFO ] Too many transitions (6521) to apply POR reductions. Disabling POR matrices.
[2024-05-20 23:34:15] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5368280706819100398
Running compilation step : cd /tmp/ltsmin5368280706819100398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5368280706819100398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5368280706819100398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Applied a total of 0 rules in 159 ms. Remains 1845 /1845 variables (removed 0) and now considering 6521/6521 (removed 0) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-20 23:34:19] [INFO ] Computed 42 invariants in 127 ms
[2024-05-20 23:34:20] [INFO ] Implicit Places using invariants in 1326 ms returned []
[2024-05-20 23:34:20] [INFO ] Invariant cache hit.
[2024-05-20 23:34:21] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 23:34:37] [INFO ] Implicit Places using invariants and state equation in 17464 ms returned []
Implicit Place search using SMT with State Equation took 18792 ms to find 0 implicit places.
[2024-05-20 23:34:38] [INFO ] Redundant transitions in 452 ms returned []
Running 6481 sub problems to find dead transitions.
[2024-05-20 23:34:38] [INFO ] Invariant cache hit.
[2024-05-20 23:34:38] [INFO ] State equation strengthened by 4757 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 35555ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 35604ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55024 ms. Remains : 1845/1845 places, 6521/6521 transitions.
Built C files in :
/tmp/ltsmin12497769096522111784
[2024-05-20 23:35:13] [INFO ] Too many transitions (6521) to apply POR reductions. Disabling POR matrices.
[2024-05-20 23:35:13] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12497769096522111784
Running compilation step : cd /tmp/ltsmin12497769096522111784;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12497769096522111784;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12497769096522111784;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-20 23:35:17] [INFO ] Flatten gal took : 115 ms
[2024-05-20 23:35:17] [INFO ] Flatten gal took : 114 ms
[2024-05-20 23:35:17] [INFO ] Time to serialize gal into /tmp/LTL12295017730003917387.gal : 23 ms
[2024-05-20 23:35:17] [INFO ] Time to serialize properties into /tmp/LTL1612773751056430466.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12295017730003917387.gal' '-t' 'CGAL' '-hoa' '/tmp/aut130116349017675542.hoa' '-atoms' '/tmp/LTL1612773751056430466.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1612773751056430466.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut130116349017675542.hoa
Detected timeout of ITS tools.
[2024-05-20 23:35:32] [INFO ] Flatten gal took : 114 ms
[2024-05-20 23:35:32] [INFO ] Flatten gal took : 117 ms
[2024-05-20 23:35:32] [INFO ] Time to serialize gal into /tmp/LTL14753702028330116034.gal : 23 ms
[2024-05-20 23:35:32] [INFO ] Time to serialize properties into /tmp/LTL10329811402047445894.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14753702028330116034.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10329811402047445894.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G((("((Node24requestsent29<1)||(Node8GiveAnswer17<1))")||(("((Node19IsInserted>=1)&&(Node10requestsent19>=1))")U("(Node24requests...415
Formula 0 simplified : GF((!"((Node24requestsent29<1)||(Node8GiveAnswer17<1))" & (!"((Node19IsInserted>=1)&&(Node10requestsent19>=1))" R !"(Node24requestse...342
Detected timeout of ITS tools.
[2024-05-20 23:35:47] [INFO ] Flatten gal took : 120 ms
[2024-05-20 23:35:47] [INFO ] Applying decomposition
[2024-05-20 23:35:47] [INFO ] Flatten gal took : 127 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18379813301312255493.txt' '-o' '/tmp/graph18379813301312255493.bin' '-w' '/tmp/graph18379813301312255493.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18379813301312255493.bin' '-l' '-1' '-v' '-w' '/tmp/graph18379813301312255493.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:35:48] [INFO ] Decomposing Gal with order
[2024-05-20 23:35:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:35:48] [INFO ] Removed a total of 4814 redundant transitions.
[2024-05-20 23:35:48] [INFO ] Flatten gal took : 534 ms
[2024-05-20 23:35:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 3121 labels/synchronizations in 203 ms.
[2024-05-20 23:35:49] [INFO ] Time to serialize gal into /tmp/LTL12778643147931155365.gal : 34 ms
[2024-05-20 23:35:49] [INFO ] Time to serialize properties into /tmp/LTL9557324473632017851.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12778643147931155365.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9557324473632017851.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G((("((u25.Node24requestsent29<1)||(u18.Node8GiveAnswer17<1))")||(("((u20.Node19IsInserted>=1)&&(u11.Node10requestsent19>=1))")U(...467
Formula 0 simplified : GF((!"((u25.Node24requestsent29<1)||(u18.Node8GiveAnswer17<1))" & (!"((u20.Node19IsInserted>=1)&&(u11.Node10requestsent19>=1))" R !"...386
Detected timeout of ITS tools.
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-06 finished in 675680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U G(p1))))'
Support contains 3 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 191 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 23:36:04] [INFO ] Computed 42 invariants in 342 ms
[2024-05-20 23:36:06] [INFO ] Implicit Places using invariants in 2347 ms returned []
[2024-05-20 23:36:06] [INFO ] Invariant cache hit.
[2024-05-20 23:36:09] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 23:36:40] [INFO ] Performed 385/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:36:49] [INFO ] Implicit Places using invariants and state equation in 42967 ms returned []
Implicit Place search using SMT with State Equation took 45315 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-20 23:36:49] [INFO ] Invariant cache hit.
[2024-05-20 23:36:49] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38995ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39069ms
Finished structural reductions in LTL mode , in 1 iterations and 84586 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-08
Stuttering criterion allowed to conclude after 793 steps with 0 reset in 6 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-08 finished in 84772 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((p0||X(p0))))'
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 185 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2024-05-20 23:37:29] [INFO ] Invariant cache hit.
[2024-05-20 23:37:31] [INFO ] Implicit Places using invariants in 2145 ms returned []
[2024-05-20 23:37:31] [INFO ] Invariant cache hit.
[2024-05-20 23:37:34] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 23:38:04] [INFO ] Performed 335/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:38:18] [INFO ] Implicit Places using invariants and state equation in 47240 ms returned []
Implicit Place search using SMT with State Equation took 49386 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-20 23:38:18] [INFO ] Invariant cache hit.
[2024-05-20 23:38:18] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38940ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39015ms
Finished structural reductions in LTL mode , in 1 iterations and 88597 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-09
Entered a terminal (fully accepting) state of product in 82269 steps with 86 reset in 585 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-09 finished in 89289 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U p1))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 187 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2024-05-20 23:38:58] [INFO ] Invariant cache hit.
[2024-05-20 23:39:00] [INFO ] Implicit Places using invariants in 1963 ms returned []
[2024-05-20 23:39:00] [INFO ] Invariant cache hit.
[2024-05-20 23:39:03] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 23:39:33] [INFO ] Performed 307/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:39:48] [INFO ] Implicit Places using invariants and state equation in 47673 ms returned []
Implicit Place search using SMT with State Equation took 49641 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-20 23:39:48] [INFO ] Invariant cache hit.
[2024-05-20 23:39:48] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38884ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 38957ms
Finished structural reductions in LTL mode , in 1 iterations and 88798 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-10 finished in 88967 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||((X(p1)&&F(p2)) U (G(((X(p1)&&F(p2))||X(G(p1))))||(!p3&&((X(p1)&&F(p2))||X(G(p1))))))))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 187 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2024-05-20 23:40:27] [INFO ] Invariant cache hit.
[2024-05-20 23:40:29] [INFO ] Implicit Places using invariants in 2018 ms returned []
[2024-05-20 23:40:29] [INFO ] Invariant cache hit.
[2024-05-20 23:40:32] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 23:41:02] [INFO ] Performed 315/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:41:16] [INFO ] Implicit Places using invariants and state equation in 47263 ms returned []
Implicit Place search using SMT with State Equation took 49284 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-20 23:41:16] [INFO ] Invariant cache hit.
[2024-05-20 23:41:16] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38890ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 38964ms
Finished structural reductions in LTL mode , in 1 iterations and 88445 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-11
Product exploration explored 100000 steps with 107 reset in 720 ms.
Product exploration explored 100000 steps with 106 reset in 851 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Detected a total of 162/3683 stabilizing places and 280/9840 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p3) p1), (X (NOT p3)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p1), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p3 p1))), (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1)))), (X (NOT (OR (AND p0 (NOT p2) p3) (AND (NOT p2) p3 p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p1)), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))))), (X (X (NOT (OR (AND p0 (NOT p2) p3) (AND (NOT p2) p3 p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3))))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))]
Knowledge based reduction with 38 factoid took 580 ms. Reduced automaton from 6 states, 28 edges and 4 AP (stutter sensitive) to 6 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (40 resets) in 573 ms. (69 steps per ms) remains 17/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 12/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 12/12 properties
[2024-05-20 23:41:58] [INFO ] Invariant cache hit.
[2024-05-20 23:41:58] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3600/3605 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-20 23:41:59] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3605 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3605 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 74/3679 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3679 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 2/3681 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-20 23:42:06] [INFO ] Deduced a trap composed of 75 places in 3478 ms of which 24 ms to minimize.
SMT process timed out in 7367ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 3683 transition count 9563
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 3406 transition count 9562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1558 Post agglomeration using F-continuation condition.Transition count delta: 1558
Deduced a syphon composed of 1558 places in 2 ms
Reduce places removed 1558 places and 0 transitions.
Iterating global reduction 3 with 3116 rules applied. Total rules applied 3672 place count 1847 transition count 8004
Drop transitions (Redundant composition of simpler transitions.) removed 1480 transitions
Redundant transition composition rules discarded 1480 transitions
Iterating global reduction 3 with 1480 rules applied. Total rules applied 5152 place count 1847 transition count 6524
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5154 place count 1847 transition count 6522
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5156 place count 1845 transition count 6522
Partial Free-agglomeration rule applied 1640 times.
Drop transitions (Partial Free agglomeration) removed 1640 transitions
Iterating global reduction 4 with 1640 rules applied. Total rules applied 6796 place count 1845 transition count 6522
Applied a total of 6796 rules in 1115 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6522/9840 (removed 3318) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1115 ms. Remains : 1845/3683 places, 6522/9840 transitions.
RANDOM walk for 40000 steps (215 resets) in 2279 ms. (17 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 76180 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 12
Probabilistic random walk after 76180 steps, saw 22801 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
// Phase 1: matrix 6522 rows 1845 cols
[2024-05-20 23:42:11] [INFO ] Computed 42 invariants in 136 ms
[2024-05-20 23:42:11] [INFO ] State equation strengthened by 6395 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1762/1767 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-20 23:42:11] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1767 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1767 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 74/1841 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-20 23:42:14] [INFO ] Deduced a trap composed of 49 places in 1299 ms of which 10 ms to minimize.
[2024-05-20 23:42:16] [INFO ] Deduced a trap composed of 51 places in 1382 ms of which 10 ms to minimize.
[2024-05-20 23:42:17] [INFO ] Deduced a trap composed of 86 places in 1424 ms of which 10 ms to minimize.
[2024-05-20 23:42:19] [INFO ] Deduced a trap composed of 67 places in 1426 ms of which 11 ms to minimize.
[2024-05-20 23:42:20] [INFO ] Deduced a trap composed of 66 places in 1329 ms of which 11 ms to minimize.
[2024-05-20 23:42:22] [INFO ] Deduced a trap composed of 56 places in 1392 ms of which 11 ms to minimize.
[2024-05-20 23:42:23] [INFO ] Deduced a trap composed of 56 places in 1329 ms of which 11 ms to minimize.
[2024-05-20 23:42:24] [INFO ] Deduced a trap composed of 55 places in 1385 ms of which 11 ms to minimize.
[2024-05-20 23:42:26] [INFO ] Deduced a trap composed of 59 places in 1449 ms of which 11 ms to minimize.
[2024-05-20 23:42:27] [INFO ] Deduced a trap composed of 61 places in 1443 ms of which 11 ms to minimize.
[2024-05-20 23:42:29] [INFO ] Deduced a trap composed of 68 places in 1450 ms of which 10 ms to minimize.
[2024-05-20 23:42:30] [INFO ] Deduced a trap composed of 49 places in 1308 ms of which 10 ms to minimize.
[2024-05-20 23:42:32] [INFO ] Deduced a trap composed of 54 places in 1368 ms of which 10 ms to minimize.
[2024-05-20 23:42:33] [INFO ] Deduced a trap composed of 59 places in 1273 ms of which 10 ms to minimize.
[2024-05-20 23:42:34] [INFO ] Deduced a trap composed of 57 places in 1316 ms of which 10 ms to minimize.
[2024-05-20 23:42:36] [INFO ] Deduced a trap composed of 57 places in 1290 ms of which 10 ms to minimize.
[2024-05-20 23:42:37] [INFO ] Deduced a trap composed of 45 places in 1283 ms of which 11 ms to minimize.
[2024-05-20 23:42:38] [INFO ] Deduced a trap composed of 57 places in 1160 ms of which 9 ms to minimize.
[2024-05-20 23:42:39] [INFO ] Deduced a trap composed of 55 places in 1222 ms of which 10 ms to minimize.
[2024-05-20 23:42:40] [INFO ] Deduced a trap composed of 61 places in 1212 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-20 23:42:42] [INFO ] Deduced a trap composed of 67 places in 1197 ms of which 10 ms to minimize.
[2024-05-20 23:42:43] [INFO ] Deduced a trap composed of 59 places in 1165 ms of which 10 ms to minimize.
[2024-05-20 23:42:44] [INFO ] Deduced a trap composed of 63 places in 1255 ms of which 11 ms to minimize.
[2024-05-20 23:42:45] [INFO ] Deduced a trap composed of 60 places in 1180 ms of which 9 ms to minimize.
[2024-05-20 23:42:47] [INFO ] Deduced a trap composed of 55 places in 1084 ms of which 9 ms to minimize.
[2024-05-20 23:42:48] [INFO ] Deduced a trap composed of 54 places in 1161 ms of which 10 ms to minimize.
[2024-05-20 23:42:49] [INFO ] Deduced a trap composed of 55 places in 1164 ms of which 10 ms to minimize.
[2024-05-20 23:42:50] [INFO ] Deduced a trap composed of 54 places in 1158 ms of which 10 ms to minimize.
[2024-05-20 23:42:51] [INFO ] Deduced a trap composed of 57 places in 1133 ms of which 10 ms to minimize.
[2024-05-20 23:42:52] [INFO ] Deduced a trap composed of 56 places in 1168 ms of which 10 ms to minimize.
[2024-05-20 23:42:54] [INFO ] Deduced a trap composed of 52 places in 1106 ms of which 10 ms to minimize.
[2024-05-20 23:42:55] [INFO ] Deduced a trap composed of 51 places in 996 ms of which 8 ms to minimize.
[2024-05-20 23:42:56] [INFO ] Deduced a trap composed of 51 places in 1022 ms of which 9 ms to minimize.
[2024-05-20 23:42:57] [INFO ] Deduced a trap composed of 54 places in 1050 ms of which 9 ms to minimize.
SMT process timed out in 45829ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6522/6522 transitions.
Applied a total of 0 rules in 172 ms. Remains 1845 /1845 variables (removed 0) and now considering 6522/6522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 1845/1845 places, 6522/6522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6522/6522 transitions.
Applied a total of 0 rules in 168 ms. Remains 1845 /1845 variables (removed 0) and now considering 6522/6522 (removed 0) transitions.
[2024-05-20 23:42:57] [INFO ] Invariant cache hit.
[2024-05-20 23:42:59] [INFO ] Implicit Places using invariants in 1856 ms returned []
[2024-05-20 23:42:59] [INFO ] Invariant cache hit.
[2024-05-20 23:43:00] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2024-05-20 23:43:31] [INFO ] Performed 730/1845 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:44:01] [INFO ] Performed 1726/1845 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:44:04] [INFO ] Implicit Places using invariants and state equation in 65248 ms returned []
Implicit Place search using SMT with State Equation took 67107 ms to find 0 implicit places.
[2024-05-20 23:44:05] [INFO ] Redundant transitions in 492 ms returned []
Running 6482 sub problems to find dead transitions.
[2024-05-20 23:44:05] [INFO ] Invariant cache hit.
[2024-05-20 23:44:05] [INFO ] State equation strengthened by 6395 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6482 unsolved
SMT process timed out in 36273ms, After SMT, problems are : Problem set: 0 solved, 6482 unsolved
Search for dead transitions found 0 dead transitions in 36324ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104111 ms. Remains : 1845/1845 places, 6522/6522 transitions.
Knowledge obtained : [(AND p0 p2 (NOT p3) p1), (X (NOT p3)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p1), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p3 p1))), (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1)))), (X (NOT (OR (AND p0 (NOT p2) p3) (AND (NOT p2) p3 p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p1)), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))))), (X (X (NOT (OR (AND p0 (NOT p2) p3) (AND (NOT p2) p3 p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3))))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT p2)), (F (NOT (AND (OR (NOT p0) p2) (OR p2 p3)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (OR (NOT p0) p2) (OR (NOT p1) p2)))), (F p3), (F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT p0))]
Knowledge based reduction with 38 factoid took 1113 ms. Reduced automaton from 6 states, 28 edges and 4 AP (stutter sensitive) to 6 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 188 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 23:44:43] [INFO ] Computed 42 invariants in 348 ms
[2024-05-20 23:44:45] [INFO ] Implicit Places using invariants in 2347 ms returned []
[2024-05-20 23:44:45] [INFO ] Invariant cache hit.
[2024-05-20 23:44:48] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 23:45:19] [INFO ] Performed 315/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:45:32] [INFO ] Implicit Places using invariants and state equation in 47052 ms returned []
Implicit Place search using SMT with State Equation took 49402 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-20 23:45:32] [INFO ] Invariant cache hit.
[2024-05-20 23:45:32] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 39722ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39795ms
Finished structural reductions in LTL mode , in 1 iterations and 89395 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Detected a total of 162/3683 stabilizing places and 280/9840 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p3) p1), (X (NOT p3)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p3))), (X p1), (X (NOT (OR (AND p0 (NOT p2) p3) (AND p1 (NOT p2) p3)))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X p1)), (X (X (NOT (OR (AND p0 (NOT p2) p3) (AND p1 (NOT p2) p3))))), (X (X (NOT (AND p0 p3)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3))))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2))))]
Knowledge based reduction with 38 factoid took 720 ms. Reduced automaton from 6 states, 28 edges and 4 AP (stutter sensitive) to 6 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (40 resets) in 2168 ms. (18 steps per ms) remains 13/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 98 ms. (404 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 101 ms. (392 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 13/13 properties
[2024-05-20 23:46:14] [INFO ] Invariant cache hit.
[2024-05-20 23:46:14] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 3600/3605 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-20 23:46:15] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 1 ms to minimize.
[2024-05-20 23:46:15] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 1 ms to minimize.
[2024-05-20 23:46:15] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2024-05-20 23:46:15] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2024-05-20 23:46:15] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 2 ms to minimize.
[2024-05-20 23:46:16] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2024-05-20 23:46:16] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
[2024-05-20 23:46:16] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2024-05-20 23:46:16] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2024-05-20 23:46:16] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-20 23:46:16] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2024-05-20 23:46:16] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2024-05-20 23:46:17] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-20 23:46:17] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-20 23:46:17] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2024-05-20 23:46:17] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
[2024-05-20 23:46:17] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2024-05-20 23:46:17] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
[2024-05-20 23:46:17] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2024-05-20 23:46:18] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3605 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-20 23:46:18] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
[2024-05-20 23:46:18] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-20 23:46:18] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
[2024-05-20 23:46:18] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 1 ms to minimize.
[2024-05-20 23:46:18] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-20 23:46:18] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-20 23:46:19] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2024-05-20 23:46:19] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3605/13523 variables, and 31 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 3/40 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/3683 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 3600/3605 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3605 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3605 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 74/3679 variables, 37/68 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3679 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 2/3681 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-20 23:46:25] [INFO ] Deduced a trap composed of 63 places in 3252 ms of which 21 ms to minimize.
SMT process timed out in 10570ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 3683 transition count 9563
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 3406 transition count 9562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1558 Post agglomeration using F-continuation condition.Transition count delta: 1558
Deduced a syphon composed of 1558 places in 2 ms
Reduce places removed 1558 places and 0 transitions.
Iterating global reduction 3 with 3116 rules applied. Total rules applied 3672 place count 1847 transition count 8004
Drop transitions (Redundant composition of simpler transitions.) removed 1480 transitions
Redundant transition composition rules discarded 1480 transitions
Iterating global reduction 3 with 1480 rules applied. Total rules applied 5152 place count 1847 transition count 6524
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5154 place count 1847 transition count 6522
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5156 place count 1845 transition count 6522
Partial Free-agglomeration rule applied 1640 times.
Drop transitions (Partial Free agglomeration) removed 1640 transitions
Iterating global reduction 4 with 1640 rules applied. Total rules applied 6796 place count 1845 transition count 6522
Applied a total of 6796 rules in 1228 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6522/9840 (removed 3318) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1230 ms. Remains : 1845/3683 places, 6522/9840 transitions.
RANDOM walk for 40000 steps (216 resets) in 2465 ms. (16 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 71150 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 12
Probabilistic random walk after 71150 steps, saw 22246 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
// Phase 1: matrix 6522 rows 1845 cols
[2024-05-20 23:46:30] [INFO ] Computed 42 invariants in 135 ms
[2024-05-20 23:46:30] [INFO ] State equation strengthened by 6395 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1762/1767 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-20 23:46:31] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1767 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1767 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 74/1841 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-20 23:46:34] [INFO ] Deduced a trap composed of 49 places in 1263 ms of which 12 ms to minimize.
[2024-05-20 23:46:35] [INFO ] Deduced a trap composed of 51 places in 1324 ms of which 10 ms to minimize.
[2024-05-20 23:46:37] [INFO ] Deduced a trap composed of 86 places in 1415 ms of which 11 ms to minimize.
[2024-05-20 23:46:38] [INFO ] Deduced a trap composed of 52 places in 1311 ms of which 10 ms to minimize.
[2024-05-20 23:46:39] [INFO ] Deduced a trap composed of 53 places in 1359 ms of which 11 ms to minimize.
[2024-05-20 23:46:41] [INFO ] Deduced a trap composed of 55 places in 1327 ms of which 10 ms to minimize.
[2024-05-20 23:46:42] [INFO ] Deduced a trap composed of 55 places in 1302 ms of which 10 ms to minimize.
[2024-05-20 23:46:43] [INFO ] Deduced a trap composed of 51 places in 1313 ms of which 11 ms to minimize.
[2024-05-20 23:46:45] [INFO ] Deduced a trap composed of 51 places in 1271 ms of which 10 ms to minimize.
[2024-05-20 23:46:46] [INFO ] Deduced a trap composed of 52 places in 1292 ms of which 10 ms to minimize.
[2024-05-20 23:46:47] [INFO ] Deduced a trap composed of 53 places in 1321 ms of which 10 ms to minimize.
[2024-05-20 23:46:49] [INFO ] Deduced a trap composed of 55 places in 1343 ms of which 11 ms to minimize.
[2024-05-20 23:46:50] [INFO ] Deduced a trap composed of 56 places in 1298 ms of which 10 ms to minimize.
[2024-05-20 23:46:51] [INFO ] Deduced a trap composed of 53 places in 1258 ms of which 10 ms to minimize.
[2024-05-20 23:46:53] [INFO ] Deduced a trap composed of 55 places in 1274 ms of which 11 ms to minimize.
[2024-05-20 23:46:54] [INFO ] Deduced a trap composed of 53 places in 1271 ms of which 11 ms to minimize.
[2024-05-20 23:46:55] [INFO ] Deduced a trap composed of 52 places in 1261 ms of which 11 ms to minimize.
[2024-05-20 23:46:56] [INFO ] Deduced a trap composed of 54 places in 1171 ms of which 9 ms to minimize.
[2024-05-20 23:46:58] [INFO ] Deduced a trap composed of 51 places in 1136 ms of which 11 ms to minimize.
[2024-05-20 23:46:59] [INFO ] Deduced a trap composed of 51 places in 1136 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-20 23:47:00] [INFO ] Deduced a trap composed of 53 places in 1057 ms of which 8 ms to minimize.
[2024-05-20 23:47:01] [INFO ] Deduced a trap composed of 57 places in 1111 ms of which 9 ms to minimize.
[2024-05-20 23:47:02] [INFO ] Deduced a trap composed of 54 places in 1122 ms of which 9 ms to minimize.
[2024-05-20 23:47:03] [INFO ] Deduced a trap composed of 67 places in 1094 ms of which 9 ms to minimize.
[2024-05-20 23:47:04] [INFO ] Deduced a trap composed of 57 places in 1048 ms of which 9 ms to minimize.
[2024-05-20 23:47:05] [INFO ] Deduced a trap composed of 55 places in 1007 ms of which 9 ms to minimize.
[2024-05-20 23:47:06] [INFO ] Deduced a trap composed of 53 places in 978 ms of which 9 ms to minimize.
[2024-05-20 23:47:07] [INFO ] Deduced a trap composed of 73 places in 951 ms of which 9 ms to minimize.
[2024-05-20 23:47:08] [INFO ] Deduced a trap composed of 65 places in 910 ms of which 8 ms to minimize.
[2024-05-20 23:47:09] [INFO ] Deduced a trap composed of 75 places in 912 ms of which 8 ms to minimize.
[2024-05-20 23:47:10] [INFO ] Deduced a trap composed of 49 places in 932 ms of which 8 ms to minimize.
[2024-05-20 23:47:11] [INFO ] Deduced a trap composed of 45 places in 842 ms of which 8 ms to minimize.
[2024-05-20 23:47:12] [INFO ] Deduced a trap composed of 51 places in 779 ms of which 7 ms to minimize.
[2024-05-20 23:47:13] [INFO ] Deduced a trap composed of 67 places in 762 ms of which 7 ms to minimize.
[2024-05-20 23:47:14] [INFO ] Deduced a trap composed of 64 places in 812 ms of which 7 ms to minimize.
[2024-05-20 23:47:14] [INFO ] Deduced a trap composed of 60 places in 821 ms of which 7 ms to minimize.
[2024-05-20 23:47:15] [INFO ] Deduced a trap composed of 57 places in 820 ms of which 7 ms to minimize.
[2024-05-20 23:47:16] [INFO ] Deduced a trap composed of 80 places in 769 ms of which 7 ms to minimize.
SMT process timed out in 45781ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6522/6522 transitions.
Applied a total of 0 rules in 176 ms. Remains 1845 /1845 variables (removed 0) and now considering 6522/6522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 1845/1845 places, 6522/6522 transitions.
RANDOM walk for 40000 steps (214 resets) in 2368 ms. (16 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 76389 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 12
Probabilistic random walk after 76389 steps, saw 22820 distinct states, run finished after 3002 ms. (steps per millisecond=25 ) properties seen :0
[2024-05-20 23:47:20] [INFO ] Invariant cache hit.
[2024-05-20 23:47:20] [INFO ] State equation strengthened by 6395 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1762/1767 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-20 23:47:21] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-20 23:47:21] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-20 23:47:21] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-20 23:47:21] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:47:21] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:47:21] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:47:21] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-20 23:47:21] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-20 23:47:21] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:47:21] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:47:21] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:47:21] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:47:22] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-20 23:47:22] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-20 23:47:22] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-20 23:47:22] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-20 23:47:22] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:47:22] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-20 23:47:22] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-20 23:47:22] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1767 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-20 23:47:22] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-20 23:47:22] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-20 23:47:22] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-20 23:47:22] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-20 23:47:22] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:47:22] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-20 23:47:22] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-20 23:47:23] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1767 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1767 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 74/1841 variables, 37/68 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1841 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 2/1843 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-20 23:47:26] [INFO ] Deduced a trap composed of 49 places in 1391 ms of which 11 ms to minimize.
[2024-05-20 23:47:27] [INFO ] Deduced a trap composed of 51 places in 1398 ms of which 11 ms to minimize.
[2024-05-20 23:47:28] [INFO ] Deduced a trap composed of 86 places in 1408 ms of which 11 ms to minimize.
[2024-05-20 23:47:30] [INFO ] Deduced a trap composed of 53 places in 1399 ms of which 11 ms to minimize.
[2024-05-20 23:47:31] [INFO ] Deduced a trap composed of 53 places in 1415 ms of which 11 ms to minimize.
[2024-05-20 23:47:33] [INFO ] Deduced a trap composed of 56 places in 1389 ms of which 11 ms to minimize.
[2024-05-20 23:47:34] [INFO ] Deduced a trap composed of 54 places in 1284 ms of which 11 ms to minimize.
[2024-05-20 23:47:35] [INFO ] Deduced a trap composed of 53 places in 1322 ms of which 10 ms to minimize.
[2024-05-20 23:47:37] [INFO ] Deduced a trap composed of 48 places in 1325 ms of which 11 ms to minimize.
[2024-05-20 23:47:38] [INFO ] Deduced a trap composed of 50 places in 1218 ms of which 11 ms to minimize.
[2024-05-20 23:47:39] [INFO ] Deduced a trap composed of 52 places in 1205 ms of which 10 ms to minimize.
[2024-05-20 23:47:40] [INFO ] Deduced a trap composed of 57 places in 1196 ms of which 9 ms to minimize.
[2024-05-20 23:47:42] [INFO ] Deduced a trap composed of 53 places in 1158 ms of which 10 ms to minimize.
[2024-05-20 23:47:43] [INFO ] Deduced a trap composed of 52 places in 1201 ms of which 9 ms to minimize.
[2024-05-20 23:47:44] [INFO ] Deduced a trap composed of 54 places in 1213 ms of which 10 ms to minimize.
[2024-05-20 23:47:45] [INFO ] Deduced a trap composed of 57 places in 1185 ms of which 10 ms to minimize.
[2024-05-20 23:47:46] [INFO ] Deduced a trap composed of 56 places in 1151 ms of which 10 ms to minimize.
[2024-05-20 23:47:48] [INFO ] Deduced a trap composed of 54 places in 1180 ms of which 10 ms to minimize.
[2024-05-20 23:47:49] [INFO ] Deduced a trap composed of 52 places in 1158 ms of which 10 ms to minimize.
[2024-05-20 23:47:50] [INFO ] Deduced a trap composed of 63 places in 1146 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-20 23:47:51] [INFO ] Deduced a trap composed of 63 places in 1139 ms of which 9 ms to minimize.
[2024-05-20 23:47:52] [INFO ] Deduced a trap composed of 62 places in 1153 ms of which 10 ms to minimize.
[2024-05-20 23:47:54] [INFO ] Deduced a trap composed of 77 places in 1153 ms of which 10 ms to minimize.
[2024-05-20 23:47:55] [INFO ] Deduced a trap composed of 86 places in 1137 ms of which 10 ms to minimize.
[2024-05-20 23:47:56] [INFO ] Deduced a trap composed of 57 places in 1115 ms of which 10 ms to minimize.
[2024-05-20 23:47:57] [INFO ] Deduced a trap composed of 58 places in 1168 ms of which 9 ms to minimize.
[2024-05-20 23:47:58] [INFO ] Deduced a trap composed of 70 places in 1166 ms of which 10 ms to minimize.
[2024-05-20 23:47:59] [INFO ] Deduced a trap composed of 56 places in 1187 ms of which 9 ms to minimize.
[2024-05-20 23:48:01] [INFO ] Deduced a trap composed of 52 places in 1237 ms of which 10 ms to minimize.
[2024-05-20 23:48:02] [INFO ] Deduced a trap composed of 55 places in 1123 ms of which 9 ms to minimize.
[2024-05-20 23:48:03] [INFO ] Deduced a trap composed of 55 places in 1159 ms of which 9 ms to minimize.
[2024-05-20 23:48:04] [INFO ] Deduced a trap composed of 54 places in 1169 ms of which 10 ms to minimize.
[2024-05-20 23:48:05] [INFO ] Deduced a trap composed of 53 places in 1163 ms of which 10 ms to minimize.
[2024-05-20 23:48:07] [INFO ] Deduced a trap composed of 54 places in 1163 ms of which 9 ms to minimize.
[2024-05-20 23:48:08] [INFO ] Deduced a trap composed of 54 places in 1171 ms of which 9 ms to minimize.
[2024-05-20 23:48:09] [INFO ] Deduced a trap composed of 55 places in 1205 ms of which 10 ms to minimize.
[2024-05-20 23:48:10] [INFO ] Deduced a trap composed of 54 places in 1179 ms of which 10 ms to minimize.
[2024-05-20 23:48:11] [INFO ] Deduced a trap composed of 52 places in 1126 ms of which 9 ms to minimize.
[2024-05-20 23:48:13] [INFO ] Deduced a trap composed of 75 places in 1198 ms of which 10 ms to minimize.
[2024-05-20 23:48:14] [INFO ] Deduced a trap composed of 57 places in 1156 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1843 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-20 23:48:15] [INFO ] Deduced a trap composed of 56 places in 1136 ms of which 9 ms to minimize.
[2024-05-20 23:48:17] [INFO ] Deduced a trap composed of 53 places in 1100 ms of which 10 ms to minimize.
[2024-05-20 23:48:18] [INFO ] Deduced a trap composed of 57 places in 1116 ms of which 9 ms to minimize.
[2024-05-20 23:48:19] [INFO ] Deduced a trap composed of 52 places in 1164 ms of which 10 ms to minimize.
[2024-05-20 23:48:20] [INFO ] Deduced a trap composed of 56 places in 1079 ms of which 9 ms to minimize.
[2024-05-20 23:48:21] [INFO ] Deduced a trap composed of 54 places in 1107 ms of which 10 ms to minimize.
[2024-05-20 23:48:22] [INFO ] Deduced a trap composed of 54 places in 1119 ms of which 10 ms to minimize.
[2024-05-20 23:48:23] [INFO ] Deduced a trap composed of 58 places in 1069 ms of which 10 ms to minimize.
[2024-05-20 23:48:24] [INFO ] Deduced a trap composed of 57 places in 1031 ms of which 9 ms to minimize.
[2024-05-20 23:48:25] [INFO ] Deduced a trap composed of 57 places in 1030 ms of which 9 ms to minimize.
[2024-05-20 23:48:27] [INFO ] Deduced a trap composed of 58 places in 1059 ms of which 9 ms to minimize.
[2024-05-20 23:48:28] [INFO ] Deduced a trap composed of 59 places in 1044 ms of which 9 ms to minimize.
[2024-05-20 23:48:29] [INFO ] Deduced a trap composed of 56 places in 1005 ms of which 9 ms to minimize.
[2024-05-20 23:48:30] [INFO ] Deduced a trap composed of 63 places in 1055 ms of which 8 ms to minimize.
[2024-05-20 23:48:31] [INFO ] Deduced a trap composed of 56 places in 1078 ms of which 9 ms to minimize.
[2024-05-20 23:48:32] [INFO ] Deduced a trap composed of 55 places in 1056 ms of which 9 ms to minimize.
[2024-05-20 23:48:33] [INFO ] Deduced a trap composed of 52 places in 1057 ms of which 9 ms to minimize.
[2024-05-20 23:48:34] [INFO ] Deduced a trap composed of 57 places in 1059 ms of which 9 ms to minimize.
[2024-05-20 23:48:35] [INFO ] Deduced a trap composed of 51 places in 1070 ms of which 9 ms to minimize.
[2024-05-20 23:48:36] [INFO ] Deduced a trap composed of 51 places in 1006 ms of which 9 ms to minimize.
SMT process timed out in 75958ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6522/6522 transitions.
Applied a total of 0 rules in 172 ms. Remains 1845 /1845 variables (removed 0) and now considering 6522/6522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 1845/1845 places, 6522/6522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6522/6522 transitions.
Applied a total of 0 rules in 171 ms. Remains 1845 /1845 variables (removed 0) and now considering 6522/6522 (removed 0) transitions.
[2024-05-20 23:48:37] [INFO ] Invariant cache hit.
[2024-05-20 23:48:39] [INFO ] Implicit Places using invariants in 1877 ms returned []
[2024-05-20 23:48:39] [INFO ] Invariant cache hit.
[2024-05-20 23:48:40] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2024-05-20 23:49:10] [INFO ] Performed 679/1845 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:49:40] [INFO ] Performed 1616/1845 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:49:47] [INFO ] Implicit Places using invariants and state equation in 68937 ms returned []
Implicit Place search using SMT with State Equation took 70816 ms to find 0 implicit places.
[2024-05-20 23:49:48] [INFO ] Redundant transitions in 499 ms returned []
Running 6482 sub problems to find dead transitions.
[2024-05-20 23:49:48] [INFO ] Invariant cache hit.
[2024-05-20 23:49:48] [INFO ] State equation strengthened by 6395 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6482 unsolved
SMT process timed out in 36083ms, After SMT, problems are : Problem set: 0 solved, 6482 unsolved
Search for dead transitions found 0 dead transitions in 36131ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107635 ms. Remains : 1845/1845 places, 6522/6522 transitions.
Knowledge obtained : [(AND p0 p2 (NOT p3) p1), (X (NOT p3)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p3))), (X p1), (X (NOT (OR (AND p0 (NOT p2) p3) (AND p1 (NOT p2) p3)))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X p1)), (X (X (NOT (OR (AND p0 (NOT p2) p3) (AND p1 (NOT p2) p3))))), (X (X (NOT (AND p0 p3)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3))))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p1)), (F (NOT p2)), (F (NOT (AND (OR (NOT p0) p2) (OR (NOT p1) p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (OR (NOT p0) p2) (OR p3 p2)))), (F p3), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) p2)))]
Knowledge based reduction with 38 factoid took 1180 ms. Reduced automaton from 6 states, 28 edges and 4 AP (stutter sensitive) to 6 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 105 reset in 706 ms.
Product exploration explored 100000 steps with 107 reset in 803 ms.
Applying partial POR strategy [false, false, true, true, false, true]
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 3683 transition count 9840
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 198 place count 3683 transition count 9840
Deduced a syphon composed of 239 places in 2 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 239 place count 3683 transition count 9840
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 319 place count 3603 transition count 9760
Deduced a syphon composed of 159 places in 2 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 399 place count 3603 transition count 9760
Performed 1597 Post agglomeration using F-continuation condition.Transition count delta: -3036
Deduced a syphon composed of 1756 places in 2 ms
Iterating global reduction 1 with 1597 rules applied. Total rules applied 1996 place count 3603 transition count 12796
Discarding 157 places :
Symmetric choice reduction at 1 with 157 rule applications. Total rules 2153 place count 3446 transition count 12639
Deduced a syphon composed of 1599 places in 2 ms
Iterating global reduction 1 with 157 rules applied. Total rules applied 2310 place count 3446 transition count 12639
Deduced a syphon composed of 1599 places in 2 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1480 transitions
Redundant transition composition rules discarded 1480 transitions
Iterating global reduction 1 with 1480 rules applied. Total rules applied 3790 place count 3446 transition count 11159
Deduced a syphon composed of 1599 places in 2 ms
Applied a total of 3790 rules in 2868 ms. Remains 3446 /3683 variables (removed 237) and now considering 11159/9840 (removed -1319) transitions.
Running 11119 sub problems to find dead transitions.
// Phase 1: matrix 11159 rows 3446 cols
[2024-05-20 23:50:32] [INFO ] Computed 42 invariants in 321 ms
[2024-05-20 23:50:32] [INFO ] State equation strengthened by 4756 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3445 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 11119 unsolved
SMT process timed out in 41850ms, After SMT, problems are : Problem set: 0 solved, 11119 unsolved
Search for dead transitions found 0 dead transitions in 41932ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3446/3683 places, 11159/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44815 ms. Remains : 3446/3683 places, 11159/9840 transitions.
Built C files in :
/tmp/ltsmin16880598831650005456
[2024-05-20 23:51:13] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16880598831650005456
Running compilation step : cd /tmp/ltsmin16880598831650005456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16880598831650005456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16880598831650005456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 246 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 23:51:17] [INFO ] Computed 42 invariants in 479 ms
[2024-05-20 23:51:19] [INFO ] Implicit Places using invariants in 2456 ms returned []
[2024-05-20 23:51:19] [INFO ] Invariant cache hit.
[2024-05-20 23:51:22] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 23:51:53] [INFO ] Performed 315/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:52:07] [INFO ] Implicit Places using invariants and state equation in 48194 ms returned []
Implicit Place search using SMT with State Equation took 50653 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-20 23:52:07] [INFO ] Invariant cache hit.
[2024-05-20 23:52:07] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 39083ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39154ms
Finished structural reductions in LTL mode , in 1 iterations and 90066 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Built C files in :
/tmp/ltsmin13594850333740809516
[2024-05-20 23:52:46] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13594850333740809516
Running compilation step : cd /tmp/ltsmin13594850333740809516;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13594850333740809516;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13594850333740809516;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-20 23:52:50] [INFO ] Flatten gal took : 169 ms
[2024-05-20 23:52:50] [INFO ] Flatten gal took : 177 ms
[2024-05-20 23:52:50] [INFO ] Time to serialize gal into /tmp/LTL2596671670605513794.gal : 28 ms
[2024-05-20 23:52:50] [INFO ] Time to serialize properties into /tmp/LTL3462227930966640069.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2596671670605513794.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8328682469032438436.hoa' '-atoms' '/tmp/LTL3462227930966640069.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3462227930966640069.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8328682469032438436.hoa
Detected timeout of ITS tools.
[2024-05-20 23:53:05] [INFO ] Flatten gal took : 163 ms
[2024-05-20 23:53:05] [INFO ] Flatten gal took : 173 ms
[2024-05-20 23:53:05] [INFO ] Time to serialize gal into /tmp/LTL14254801585067212533.gal : 30 ms
[2024-05-20 23:53:05] [INFO ] Time to serialize properties into /tmp/LTL9594760472992960826.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14254801585067212533.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9594760472992960826.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("(Node17GiveAnswer11<1)")||(((X("(Node12GiveAnswer26<1)"))&&(F("(Node7DHTinfo<1)")))U((G((X(G("(Node12GiveAnswer26<1)")))||((X...367
Formula 0 simplified : GF(!"(Node17GiveAnswer11<1)" & ((X!"(Node12GiveAnswer26<1)" | G!"(Node7DHTinfo<1)") R (F((X!"(Node12GiveAnswer26<1)" | G!"(Node7DHTi...336
Detected timeout of ITS tools.
[2024-05-20 23:53:21] [INFO ] Flatten gal took : 166 ms
[2024-05-20 23:53:21] [INFO ] Applying decomposition
[2024-05-20 23:53:21] [INFO ] Flatten gal took : 174 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3209645489715585569.txt' '-o' '/tmp/graph3209645489715585569.bin' '-w' '/tmp/graph3209645489715585569.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3209645489715585569.bin' '-l' '-1' '-v' '-w' '/tmp/graph3209645489715585569.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:53:21] [INFO ] Decomposing Gal with order
[2024-05-20 23:53:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:53:22] [INFO ] Removed a total of 4817 redundant transitions.
[2024-05-20 23:53:22] [INFO ] Flatten gal took : 430 ms
[2024-05-20 23:53:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 4684 labels/synchronizations in 245 ms.
[2024-05-20 23:53:22] [INFO ] Time to serialize gal into /tmp/LTL9355837478955792345.gal : 53 ms
[2024-05-20 23:53:22] [INFO ] Time to serialize properties into /tmp/LTL8836781000073262412.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9355837478955792345.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8836781000073262412.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G(("(u46.Node17GiveAnswer11<1)")||(((X("(u107.Node12GiveAnswer26<1)"))&&(F("(u28.Node7DHTinfo<1)")))U((G((X(G("(u107.Node12GiveAn...420
Formula 0 simplified : GF(!"(u46.Node17GiveAnswer11<1)" & ((X!"(u107.Node12GiveAnswer26<1)" | G!"(u28.Node7DHTinfo<1)") R (F((X!"(u107.Node12GiveAnswer26<1...389
Detected timeout of ITS tools.
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-11 finished in 790305 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((X(X((G(p1) U X(p2))))||p0))))'
Support contains 3 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 244 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2024-05-20 23:53:37] [INFO ] Invariant cache hit.
[2024-05-20 23:53:39] [INFO ] Implicit Places using invariants in 1984 ms returned []
[2024-05-20 23:53:39] [INFO ] Invariant cache hit.
[2024-05-20 23:53:42] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 23:54:12] [INFO ] Performed 301/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:54:28] [INFO ] Implicit Places using invariants and state equation in 48966 ms returned []
Implicit Place search using SMT with State Equation took 50952 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-20 23:54:28] [INFO ] Invariant cache hit.
[2024-05-20 23:54:28] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 39098ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39170ms
Finished structural reductions in LTL mode , in 1 iterations and 90378 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 332 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 988 ms.
Product exploration explored 100000 steps with 33333 reset in 969 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 22 ms. Reduced automaton from 9 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-040-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-12 finished in 92752 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||(!p0&&G(p1)))))'
Support contains 3 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5157 place count 1845 transition count 6521
Applied a total of 5157 rules in 957 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6521/9840 (removed 3319) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-20 23:55:11] [INFO ] Computed 42 invariants in 131 ms
[2024-05-20 23:55:12] [INFO ] Implicit Places using invariants in 1331 ms returned []
[2024-05-20 23:55:12] [INFO ] Invariant cache hit.
[2024-05-20 23:55:14] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 23:55:32] [INFO ] Implicit Places using invariants and state equation in 19387 ms returned []
Implicit Place search using SMT with State Equation took 20720 ms to find 0 implicit places.
[2024-05-20 23:55:32] [INFO ] Redundant transitions in 484 ms returned []
Running 6481 sub problems to find dead transitions.
[2024-05-20 23:55:32] [INFO ] Invariant cache hit.
[2024-05-20 23:55:32] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 34889ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 34939ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/3683 places, 6521/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57120 ms. Remains : 1845/3683 places, 6521/9840 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, p0, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-13
Product exploration explored 100000 steps with 489 reset in 940 ms.
Product exploration explored 100000 steps with 488 reset in 1009 ms.
Computed a total of 124 stabilizing places and 201 stable transitions
Computed a total of 124 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 129 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (194 resets) in 538 ms. (74 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
[2024-05-20 23:56:10] [INFO ] Invariant cache hit.
[2024-05-20 23:56:10] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1762/1765 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:56:10] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 1 ms to minimize.
[2024-05-20 23:56:10] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:56:12] [INFO ] Deduced a trap composed of 60 places in 1409 ms of which 11 ms to minimize.
[2024-05-20 23:56:13] [INFO ] Deduced a trap composed of 50 places in 1396 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6521/8364 variables, 1843/1889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8364 variables, 4757/6646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8364/8366 variables, and 6646 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1843/1845 constraints, ReadFeed: 4757/4757 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1762/1765 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:56:15] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 0 ms to minimize.
[2024-05-20 23:56:15] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 0 ms to minimize.
[2024-05-20 23:56:15] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-20 23:56:15] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:56:15] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 0 ms to minimize.
[2024-05-20 23:56:15] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 0 ms to minimize.
[2024-05-20 23:56:15] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 0 ms to minimize.
[2024-05-20 23:56:15] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-20 23:56:15] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-20 23:56:16] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1765 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 76/1841 variables, 38/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1841 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1843 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:56:17] [INFO ] Deduced a trap composed of 69 places in 1329 ms of which 11 ms to minimize.
[2024-05-20 23:56:18] [INFO ] Deduced a trap composed of 57 places in 1289 ms of which 11 ms to minimize.
[2024-05-20 23:56:20] [INFO ] Deduced a trap composed of 48 places in 1253 ms of which 10 ms to minimize.
SMT process timed out in 10071ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1640 times.
Drop transitions (Partial Free agglomeration) removed 1640 transitions
Iterating global reduction 1 with 1640 rules applied. Total rules applied 1644 place count 1843 transition count 6519
Applied a total of 1644 rules in 550 ms. Remains 1843 /1845 variables (removed 2) and now considering 6519/6521 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 551 ms. Remains : 1843/1845 places, 6519/6521 transitions.
RANDOM walk for 40000 steps (215 resets) in 554 ms. (72 steps per ms) remains 1/1 properties
BEST_FIRST walk for 32960 steps (6 resets) in 57 ms. (568 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p0), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (NOT p0) p1)))
Knowledge based reduction with 13 factoid took 268 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-040-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-13 finished in 70757 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)) U (X((p1 U p2))||G(p3))))'
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)&&((p1 U p2)||X((!p3 U (p4||G(!p3)))))))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-040-LTLFireability-06
Stuttering acceptance computed with spot in 193 ms :[(OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4))]
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5157 place count 1845 transition count 6521
Applied a total of 5157 rules in 887 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6521/9840 (removed 3319) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-20 23:56:22] [INFO ] Computed 42 invariants in 127 ms
[2024-05-20 23:56:23] [INFO ] Implicit Places using invariants in 1240 ms returned []
[2024-05-20 23:56:23] [INFO ] Invariant cache hit.
[2024-05-20 23:56:25] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 23:56:40] [INFO ] Implicit Places using invariants and state equation in 16802 ms returned []
Implicit Place search using SMT with State Equation took 18042 ms to find 0 implicit places.
Running 6481 sub problems to find dead transitions.
[2024-05-20 23:56:40] [INFO ] Invariant cache hit.
[2024-05-20 23:56:40] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 34945ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 34994ms
Starting structural reductions in LI_LTL mode, iteration 1 : 1845/3683 places, 6521/9840 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 53931 ms. Remains : 1845/3683 places, 6521/9840 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-06
Product exploration explored 100000 steps with 33166 reset in 1169 ms.
Product exploration explored 100000 steps with 33412 reset in 1202 ms.
Computed a total of 124 stabilizing places and 201 stable transitions
Computed a total of 124 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1) p4 (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3))), (X p4), (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3))), (X (AND (NOT p2) p0 (NOT p1))), (X (OR p2 p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3))), (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3))), (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3)))), (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3))))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3)))), (X (X p4)), (X (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (OR p2 p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3)))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 37 factoid took 143 ms. Reduced automaton from 4 states, 27 edges and 5 AP (stutter sensitive) to 4 states, 27 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4))]
Reduction of identical properties reduced properties to check from 18 to 16
RANDOM walk for 40000 steps (195 resets) in 3097 ms. (12 steps per ms) remains 10/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 10/10 properties
[2024-05-20 23:57:19] [INFO ] Invariant cache hit.
[2024-05-20 23:57:19] [INFO ] State equation strengthened by 4757 read => feed constraints.
Problem apf2 is UNSAT
Problem apf4 is UNSAT
Problem apf8 is UNSAT
Problem apf10 is UNSAT
Problem apf15 is UNSAT
Problem apf16 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 4 unsolved
[2024-05-20 23:57:20] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 1/3 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/41 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 6 solved, 4 unsolved
[2024-05-20 23:57:22] [INFO ] Deduced a trap composed of 68 places in 1389 ms of which 10 ms to minimize.
[2024-05-20 23:57:23] [INFO ] Deduced a trap composed of 69 places in 1411 ms of which 10 ms to minimize.
[2024-05-20 23:57:24] [INFO ] Deduced a trap composed of 49 places in 1306 ms of which 11 ms to minimize.
SMT process timed out in 5069ms, After SMT, problems are : Problem set: 6 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1638 times.
Drop transitions (Partial Free agglomeration) removed 1638 transitions
Iterating global reduction 1 with 1638 rules applied. Total rules applied 1642 place count 1843 transition count 6519
Applied a total of 1642 rules in 553 ms. Remains 1843 /1845 variables (removed 2) and now considering 6519/6521 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 553 ms. Remains : 1843/1845 places, 6519/6521 transitions.
RANDOM walk for 40000 steps (214 resets) in 1725 ms. (23 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 89 ms. (444 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 91173 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 4
Probabilistic random walk after 91173 steps, saw 25916 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-20 23:57:29] [INFO ] Computed 42 invariants in 155 ms
[2024-05-20 23:57:29] [INFO ] State equation strengthened by 6394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 23:57:29] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 0 ms to minimize.
[2024-05-20 23:57:29] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 23:57:31] [INFO ] Deduced a trap composed of 67 places in 1432 ms of which 11 ms to minimize.
[2024-05-20 23:57:31] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2024-05-20 23:57:31] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-05-20 23:57:31] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 6519/8360 variables, 1841/1889 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8360 variables, 6394/8283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8360 variables, 0/8283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/8362 variables, 2/8285 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8362 variables, 0/8285 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/8362 variables, 0/8285 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8362/8362 variables, and 8285 constraints, problems are : Problem set: 0 solved, 4 unsolved in 7544 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1843/1843 constraints, ReadFeed: 6394/6394 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 23:57:38] [INFO ] Deduced a trap composed of 71 places in 1292 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1841 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 6519/8360 variables, 1841/1890 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8360 variables, 6394/8284 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8360 variables, 4/8288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8360 variables, 0/8288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/8362 variables, 2/8290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/8362 variables, 0/8290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/8362 variables, 0/8290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8362/8362 variables, and 8290 constraints, problems are : Problem set: 0 solved, 4 unsolved in 10144 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1843/1843 constraints, ReadFeed: 6394/6394 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 17915ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 32 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=10 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 20 ms.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1) p4 (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3))), (X p4), (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3))), (X (AND (NOT p2) p0 (NOT p1))), (X (OR p2 p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3))), (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3))), (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3)))), (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3))))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3)))), (X (X p4)), (X (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (OR p2 p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3)))))), (X (X p0)), (X (X (NOT p1))), (G (OR (NOT p0) p1 p2 (NOT p3) p4)), (G (OR p0 p1 p2)), (G (OR p0 p1 p2)), (G (OR p0 p1 p2 (NOT p3) p4)), (G (OR p0 (NOT p1) p2)), (G (OR p0 (NOT p1) p2 (NOT p3) p4)), (G (OR (NOT p0) (NOT p1) p2 (NOT p3) p4))]
False Knowledge obtained : [(F (NOT (OR p1 p2 p3 p4))), (F (NOT p4)), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p1) p2 p3 p4))), (F (NOT (AND (OR (NOT p1) p3 p4) (OR (NOT p2) p3 p4)))), (F (NOT (AND (OR (NOT p0) (NOT p3) p4) (OR (NOT p1) (NOT p3) p4) (OR (NOT p2) (NOT p3) p4)))), (F p2), (F p1), (F p3), (F (NOT (AND p0 (NOT p1) (NOT p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 44 factoid took 449 ms. Reduced automaton from 4 states, 27 edges and 5 AP (stutter sensitive) to 3 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Applied a total of 0 rules in 207 ms. Remains 1845 /1845 variables (removed 0) and now considering 6521/6521 (removed 0) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-20 23:57:48] [INFO ] Computed 42 invariants in 126 ms
[2024-05-20 23:57:49] [INFO ] Implicit Places using invariants in 1317 ms returned []
[2024-05-20 23:57:49] [INFO ] Invariant cache hit.
[2024-05-20 23:57:50] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 23:58:07] [INFO ] Implicit Places using invariants and state equation in 17720 ms returned []
Implicit Place search using SMT with State Equation took 19039 ms to find 0 implicit places.
[2024-05-20 23:58:07] [INFO ] Redundant transitions in 488 ms returned []
Running 6481 sub problems to find dead transitions.
[2024-05-20 23:58:07] [INFO ] Invariant cache hit.
[2024-05-20 23:58:07] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 35661ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 35721ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55476 ms. Remains : 1845/1845 places, 6521/6521 transitions.
Computed a total of 124 stabilizing places and 201 stable transitions
Computed a total of 124 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) p4), (X (NOT p2)), (X (NOT (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4))))), (X (NOT p3)), (X p4), (X (NOT (AND p1 (NOT p2) (NOT p4)))), (X (NOT (AND p1 (NOT p2) p3 (NOT p4)))), (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4)))), (X (NOT (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4))))), (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4))), (X (OR p1 p2 (NOT p3) p4)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4)))))), (X (X (NOT p3))), (X (X p4)), (X (X (NOT (AND p1 (NOT p2) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4))))), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4)))))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4)))), (X (X (OR p1 p2 (NOT p3) p4))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 29 factoid took 162 ms. Reduced automaton from 3 states, 13 edges and 4 AP (stutter insensitive) to 3 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Reduction of identical properties reduced properties to check from 14 to 12
RANDOM walk for 40000 steps (194 resets) in 2203 ms. (18 steps per ms) remains 6/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 6/6 properties
[2024-05-20 23:58:44] [INFO ] Invariant cache hit.
[2024-05-20 23:58:44] [INFO ] State equation strengthened by 4757 read => feed constraints.
Problem apf5 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-20 23:58:44] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/41 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-20 23:58:46] [INFO ] Deduced a trap composed of 68 places in 1455 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 1/44 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 0/44 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 6521/8364 variables, 1843/1887 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8364 variables, 4757/6644 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8364 variables, 0/6644 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/8366 variables, 2/6646 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8366/8366 variables, and 6646 constraints, problems are : Problem set: 2 solved, 4 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 4757/4757 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/41 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 1/44 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-20 23:58:51] [INFO ] Deduced a trap composed of 49 places in 1460 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 1/45 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1843 variables, 0/45 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 6521/8364 variables, 1843/1888 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8364 variables, 4757/6645 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8364 variables, 4/6649 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8364 variables, 0/6649 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/8366 variables, 2/6651 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8366/8366 variables, and 6651 constraints, problems are : Problem set: 2 solved, 4 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 4757/4757 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 10096ms problems are : Problem set: 2 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1638 times.
Drop transitions (Partial Free agglomeration) removed 1638 transitions
Iterating global reduction 1 with 1638 rules applied. Total rules applied 1642 place count 1843 transition count 6519
Applied a total of 1642 rules in 549 ms. Remains 1843 /1845 variables (removed 2) and now considering 6519/6521 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 550 ms. Remains : 1843/1845 places, 6519/6521 transitions.
RANDOM walk for 40000 steps (214 resets) in 1686 ms. (23 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-20 23:58:56] [INFO ] Computed 42 invariants in 138 ms
[2024-05-20 23:58:56] [INFO ] State equation strengthened by 6394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 23:58:56] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2024-05-20 23:58:56] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 23:58:58] [INFO ] Deduced a trap composed of 48 places in 1418 ms of which 12 ms to minimize.
[2024-05-20 23:58:59] [INFO ] Deduced a trap composed of 50 places in 1374 ms of which 12 ms to minimize.
[2024-05-20 23:59:01] [INFO ] Deduced a trap composed of 46 places in 1396 ms of which 10 ms to minimize.
[2024-05-20 23:59:02] [INFO ] Deduced a trap composed of 47 places in 1362 ms of which 11 ms to minimize.
[2024-05-20 23:59:03] [INFO ] Deduced a trap composed of 49 places in 1348 ms of which 12 ms to minimize.
[2024-05-20 23:59:05] [INFO ] Deduced a trap composed of 50 places in 1250 ms of which 10 ms to minimize.
[2024-05-20 23:59:06] [INFO ] Deduced a trap composed of 50 places in 1183 ms of which 9 ms to minimize.
[2024-05-20 23:59:07] [INFO ] Deduced a trap composed of 50 places in 1181 ms of which 9 ms to minimize.
[2024-05-20 23:59:08] [INFO ] Deduced a trap composed of 50 places in 1196 ms of which 10 ms to minimize.
[2024-05-20 23:59:10] [INFO ] Deduced a trap composed of 49 places in 1196 ms of which 9 ms to minimize.
[2024-05-20 23:59:11] [INFO ] Deduced a trap composed of 47 places in 1190 ms of which 10 ms to minimize.
[2024-05-20 23:59:12] [INFO ] Deduced a trap composed of 50 places in 1146 ms of which 10 ms to minimize.
[2024-05-20 23:59:13] [INFO ] Deduced a trap composed of 47 places in 1143 ms of which 9 ms to minimize.
[2024-05-20 23:59:14] [INFO ] Deduced a trap composed of 52 places in 1095 ms of which 10 ms to minimize.
[2024-05-20 23:59:15] [INFO ] Deduced a trap composed of 48 places in 1102 ms of which 9 ms to minimize.
[2024-05-20 23:59:17] [INFO ] Deduced a trap composed of 48 places in 1064 ms of which 9 ms to minimize.
[2024-05-20 23:59:18] [INFO ] Deduced a trap composed of 46 places in 1100 ms of which 9 ms to minimize.
[2024-05-20 23:59:19] [INFO ] Deduced a trap composed of 49 places in 1108 ms of which 9 ms to minimize.
[2024-05-20 23:59:20] [INFO ] Deduced a trap composed of 49 places in 1093 ms of which 9 ms to minimize.
[2024-05-20 23:59:21] [INFO ] Deduced a trap composed of 52 places in 1085 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 23:59:22] [INFO ] Deduced a trap composed of 52 places in 1075 ms of which 9 ms to minimize.
[2024-05-20 23:59:23] [INFO ] Deduced a trap composed of 51 places in 1062 ms of which 9 ms to minimize.
[2024-05-20 23:59:24] [INFO ] Deduced a trap composed of 51 places in 1022 ms of which 9 ms to minimize.
[2024-05-20 23:59:25] [INFO ] Deduced a trap composed of 50 places in 1045 ms of which 9 ms to minimize.
[2024-05-20 23:59:26] [INFO ] Deduced a trap composed of 80 places in 965 ms of which 9 ms to minimize.
[2024-05-20 23:59:27] [INFO ] Deduced a trap composed of 80 places in 1044 ms of which 9 ms to minimize.
[2024-05-20 23:59:29] [INFO ] Deduced a trap composed of 57 places in 1049 ms of which 9 ms to minimize.
[2024-05-20 23:59:30] [INFO ] Deduced a trap composed of 71 places in 1043 ms of which 8 ms to minimize.
[2024-05-20 23:59:31] [INFO ] Deduced a trap composed of 61 places in 1051 ms of which 9 ms to minimize.
[2024-05-20 23:59:32] [INFO ] Deduced a trap composed of 56 places in 984 ms of which 9 ms to minimize.
[2024-05-20 23:59:33] [INFO ] Deduced a trap composed of 60 places in 994 ms of which 9 ms to minimize.
[2024-05-20 23:59:34] [INFO ] Deduced a trap composed of 53 places in 907 ms of which 8 ms to minimize.
[2024-05-20 23:59:35] [INFO ] Deduced a trap composed of 49 places in 990 ms of which 8 ms to minimize.
[2024-05-20 23:59:36] [INFO ] Deduced a trap composed of 53 places in 882 ms of which 8 ms to minimize.
[2024-05-20 23:59:37] [INFO ] Deduced a trap composed of 52 places in 894 ms of which 8 ms to minimize.
[2024-05-20 23:59:37] [INFO ] Deduced a trap composed of 50 places in 894 ms of which 8 ms to minimize.
[2024-05-20 23:59:38] [INFO ] Deduced a trap composed of 59 places in 917 ms of which 8 ms to minimize.
[2024-05-20 23:59:39] [INFO ] Deduced a trap composed of 51 places in 903 ms of which 7 ms to minimize.
[2024-05-20 23:59:40] [INFO ] Deduced a trap composed of 61 places in 904 ms of which 8 ms to minimize.
[2024-05-20 23:59:41] [INFO ] Deduced a trap composed of 50 places in 778 ms of which 7 ms to minimize.
SMT process timed out in 45682ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 197 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 1843/1843 places, 6519/6519 transitions.
RANDOM walk for 40000 steps (215 resets) in 1365 ms. (29 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 93285 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 3
Probabilistic random walk after 93285 steps, saw 26152 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
[2024-05-20 23:59:45] [INFO ] Invariant cache hit.
[2024-05-20 23:59:45] [INFO ] State equation strengthened by 6394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 23:59:45] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-05-20 23:59:45] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 23:59:47] [INFO ] Deduced a trap composed of 48 places in 1389 ms of which 10 ms to minimize.
[2024-05-20 23:59:47] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2024-05-20 23:59:47] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-05-20 23:59:47] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 6519/8360 variables, 1841/1889 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8360 variables, 6394/8283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8360 variables, 0/8283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/8362 variables, 2/8285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8362 variables, 0/8285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/8362 variables, 0/8285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8362/8362 variables, and 8285 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6913 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1843/1843 constraints, ReadFeed: 6394/6394 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 23:59:54] [INFO ] Deduced a trap composed of 54 places in 1434 ms of which 11 ms to minimize.
[2024-05-20 23:59:55] [INFO ] Deduced a trap composed of 52 places in 1388 ms of which 10 ms to minimize.
[2024-05-20 23:59:56] [INFO ] Deduced a trap composed of 49 places in 1377 ms of which 11 ms to minimize.
[2024-05-20 23:59:58] [INFO ] Deduced a trap composed of 68 places in 1391 ms of which 11 ms to minimize.
[2024-05-20 23:59:59] [INFO ] Deduced a trap composed of 55 places in 1333 ms of which 10 ms to minimize.
[2024-05-21 00:00:01] [INFO ] Deduced a trap composed of 57 places in 1335 ms of which 10 ms to minimize.
[2024-05-21 00:00:02] [INFO ] Deduced a trap composed of 50 places in 1306 ms of which 10 ms to minimize.
[2024-05-21 00:00:03] [INFO ] Deduced a trap composed of 69 places in 1291 ms of which 10 ms to minimize.
[2024-05-21 00:00:05] [INFO ] Deduced a trap composed of 50 places in 1324 ms of which 10 ms to minimize.
[2024-05-21 00:00:06] [INFO ] Deduced a trap composed of 55 places in 1308 ms of which 11 ms to minimize.
[2024-05-21 00:00:07] [INFO ] Deduced a trap composed of 48 places in 1271 ms of which 10 ms to minimize.
[2024-05-21 00:00:09] [INFO ] Deduced a trap composed of 47 places in 1259 ms of which 10 ms to minimize.
[2024-05-21 00:00:10] [INFO ] Deduced a trap composed of 45 places in 1238 ms of which 10 ms to minimize.
[2024-05-21 00:00:11] [INFO ] Deduced a trap composed of 53 places in 1228 ms of which 10 ms to minimize.
[2024-05-21 00:00:12] [INFO ] Deduced a trap composed of 66 places in 1271 ms of which 10 ms to minimize.
[2024-05-21 00:00:14] [INFO ] Deduced a trap composed of 53 places in 1199 ms of which 10 ms to minimize.
[2024-05-21 00:00:15] [INFO ] Deduced a trap composed of 52 places in 1216 ms of which 10 ms to minimize.
[2024-05-21 00:00:16] [INFO ] Deduced a trap composed of 48 places in 1180 ms of which 10 ms to minimize.
[2024-05-21 00:00:17] [INFO ] Deduced a trap composed of 50 places in 1137 ms of which 10 ms to minimize.
[2024-05-21 00:00:18] [INFO ] Deduced a trap composed of 68 places in 1166 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 00:00:19] [INFO ] Deduced a trap composed of 52 places in 1043 ms of which 8 ms to minimize.
[2024-05-21 00:00:21] [INFO ] Deduced a trap composed of 64 places in 1053 ms of which 9 ms to minimize.
[2024-05-21 00:00:22] [INFO ] Deduced a trap composed of 49 places in 1063 ms of which 8 ms to minimize.
[2024-05-21 00:00:23] [INFO ] Deduced a trap composed of 48 places in 1035 ms of which 9 ms to minimize.
[2024-05-21 00:00:24] [INFO ] Deduced a trap composed of 50 places in 1018 ms of which 9 ms to minimize.
[2024-05-21 00:00:25] [INFO ] Deduced a trap composed of 47 places in 1034 ms of which 9 ms to minimize.
[2024-05-21 00:00:26] [INFO ] Deduced a trap composed of 58 places in 1028 ms of which 8 ms to minimize.
[2024-05-21 00:00:27] [INFO ] Deduced a trap composed of 48 places in 1013 ms of which 8 ms to minimize.
[2024-05-21 00:00:28] [INFO ] Deduced a trap composed of 48 places in 971 ms of which 9 ms to minimize.
[2024-05-21 00:00:29] [INFO ] Deduced a trap composed of 58 places in 1007 ms of which 9 ms to minimize.
[2024-05-21 00:00:30] [INFO ] Deduced a trap composed of 48 places in 959 ms of which 9 ms to minimize.
[2024-05-21 00:00:31] [INFO ] Deduced a trap composed of 58 places in 1025 ms of which 9 ms to minimize.
[2024-05-21 00:00:32] [INFO ] Deduced a trap composed of 47 places in 969 ms of which 8 ms to minimize.
[2024-05-21 00:00:33] [INFO ] Deduced a trap composed of 49 places in 958 ms of which 9 ms to minimize.
[2024-05-21 00:00:34] [INFO ] Deduced a trap composed of 50 places in 955 ms of which 9 ms to minimize.
[2024-05-21 00:00:35] [INFO ] Deduced a trap composed of 61 places in 989 ms of which 9 ms to minimize.
[2024-05-21 00:00:36] [INFO ] Deduced a trap composed of 53 places in 971 ms of which 8 ms to minimize.
[2024-05-21 00:00:37] [INFO ] Deduced a trap composed of 56 places in 928 ms of which 8 ms to minimize.
[2024-05-21 00:00:38] [INFO ] Deduced a trap composed of 66 places in 933 ms of which 9 ms to minimize.
[2024-05-21 00:00:39] [INFO ] Deduced a trap composed of 47 places in 875 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1841 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 00:00:40] [INFO ] Deduced a trap composed of 74 places in 852 ms of which 8 ms to minimize.
[2024-05-21 00:00:41] [INFO ] Deduced a trap composed of 54 places in 846 ms of which 8 ms to minimize.
[2024-05-21 00:00:41] [INFO ] Deduced a trap composed of 56 places in 841 ms of which 7 ms to minimize.
[2024-05-21 00:00:42] [INFO ] Deduced a trap composed of 65 places in 850 ms of which 8 ms to minimize.
[2024-05-21 00:00:43] [INFO ] Deduced a trap composed of 60 places in 852 ms of which 8 ms to minimize.
[2024-05-21 00:00:44] [INFO ] Deduced a trap composed of 61 places in 841 ms of which 8 ms to minimize.
[2024-05-21 00:00:45] [INFO ] Deduced a trap composed of 56 places in 827 ms of which 7 ms to minimize.
[2024-05-21 00:00:46] [INFO ] Deduced a trap composed of 61 places in 845 ms of which 8 ms to minimize.
[2024-05-21 00:00:47] [INFO ] Deduced a trap composed of 62 places in 846 ms of which 8 ms to minimize.
[2024-05-21 00:00:47] [INFO ] Deduced a trap composed of 66 places in 813 ms of which 8 ms to minimize.
[2024-05-21 00:00:48] [INFO ] Deduced a trap composed of 60 places in 860 ms of which 8 ms to minimize.
[2024-05-21 00:00:49] [INFO ] Deduced a trap composed of 70 places in 844 ms of which 8 ms to minimize.
[2024-05-21 00:00:50] [INFO ] Deduced a trap composed of 65 places in 839 ms of which 7 ms to minimize.
[2024-05-21 00:00:51] [INFO ] Deduced a trap composed of 56 places in 848 ms of which 8 ms to minimize.
[2024-05-21 00:00:52] [INFO ] Deduced a trap composed of 46 places in 817 ms of which 8 ms to minimize.
[2024-05-21 00:00:53] [INFO ] Deduced a trap composed of 60 places in 788 ms of which 8 ms to minimize.
[2024-05-21 00:00:53] [INFO ] Deduced a trap composed of 53 places in 764 ms of which 7 ms to minimize.
[2024-05-21 00:00:54] [INFO ] Deduced a trap composed of 68 places in 800 ms of which 7 ms to minimize.
[2024-05-21 00:00:55] [INFO ] Deduced a trap composed of 69 places in 803 ms of which 7 ms to minimize.
[2024-05-21 00:00:56] [INFO ] Deduced a trap composed of 59 places in 783 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1841 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 00:00:57] [INFO ] Deduced a trap composed of 65 places in 829 ms of which 7 ms to minimize.
[2024-05-21 00:00:58] [INFO ] Deduced a trap composed of 53 places in 861 ms of which 8 ms to minimize.
[2024-05-21 00:00:59] [INFO ] Deduced a trap composed of 58 places in 914 ms of which 9 ms to minimize.
[2024-05-21 00:01:00] [INFO ] Deduced a trap composed of 55 places in 876 ms of which 7 ms to minimize.
[2024-05-21 00:01:00] [INFO ] Deduced a trap composed of 58 places in 867 ms of which 8 ms to minimize.
[2024-05-21 00:01:01] [INFO ] Deduced a trap composed of 48 places in 900 ms of which 8 ms to minimize.
[2024-05-21 00:01:02] [INFO ] Deduced a trap composed of 76 places in 873 ms of which 8 ms to minimize.
[2024-05-21 00:01:03] [INFO ] Deduced a trap composed of 56 places in 834 ms of which 7 ms to minimize.
[2024-05-21 00:01:04] [INFO ] Deduced a trap composed of 58 places in 875 ms of which 7 ms to minimize.
[2024-05-21 00:01:05] [INFO ] Deduced a trap composed of 47 places in 824 ms of which 7 ms to minimize.
[2024-05-21 00:01:06] [INFO ] Deduced a trap composed of 53 places in 839 ms of which 7 ms to minimize.
[2024-05-21 00:01:07] [INFO ] Deduced a trap composed of 55 places in 833 ms of which 8 ms to minimize.
[2024-05-21 00:01:07] [INFO ] Deduced a trap composed of 54 places in 844 ms of which 8 ms to minimize.
SMT process timed out in 82763ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 206 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 207 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2024-05-21 00:01:08] [INFO ] Invariant cache hit.
[2024-05-21 00:01:10] [INFO ] Implicit Places using invariants in 1926 ms returned []
[2024-05-21 00:01:10] [INFO ] Invariant cache hit.
[2024-05-21 00:01:11] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-21 00:01:42] [INFO ] Performed 631/1843 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-21 00:02:12] [INFO ] Performed 1584/1843 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-21 00:02:20] [INFO ] Implicit Places using invariants and state equation in 69681 ms returned []
Implicit Place search using SMT with State Equation took 71607 ms to find 0 implicit places.
[2024-05-21 00:02:20] [INFO ] Redundant transitions in 484 ms returned []
Running 6479 sub problems to find dead transitions.
[2024-05-21 00:02:20] [INFO ] Invariant cache hit.
[2024-05-21 00:02:20] [INFO ] State equation strengthened by 6394 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1842 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6479 unsolved
SMT process timed out in 36174ms, After SMT, problems are : Problem set: 0 solved, 6479 unsolved
Search for dead transitions found 0 dead transitions in 36224ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108535 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) p4), (X (NOT p2)), (X (NOT (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4))))), (X (NOT p3)), (X p4), (X (NOT (AND p1 (NOT p2) (NOT p4)))), (X (NOT (AND p1 (NOT p2) p3 (NOT p4)))), (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4)))), (X (NOT (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4))))), (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4))), (X (OR p1 p2 (NOT p3) p4)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4)))))), (X (X (NOT p3))), (X (X p4)), (X (X (NOT (AND p1 (NOT p2) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4))))), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4)))))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4)))), (X (X (OR p1 p2 (NOT p3) p4))), (X (X (NOT p1))), (G (OR (NOT p1) p2 (NOT p3) p4)), (G (OR p1 p2 (NOT p3) p4)), (G (OR p1 p2 (NOT p3) p4))]
False Knowledge obtained : [(F (NOT p4)), (F p1), (F p2), (F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4)))), (F (NOT (OR p1 p2 p3 p4))), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (OR (NOT p1) p3 p4) (OR (NOT p2) p3 p4))))]
Knowledge based reduction with 32 factoid took 492 ms. Reduced automaton from 3 states, 13 edges and 4 AP (stutter insensitive) to 3 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Product exploration explored 100000 steps with 33205 reset in 1216 ms.
Product exploration explored 100000 steps with 33453 reset in 1176 ms.
Built C files in :
/tmp/ltsmin16219146953913960211
[2024-05-21 00:03:00] [INFO ] Too many transitions (6521) to apply POR reductions. Disabling POR matrices.
[2024-05-21 00:03:00] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16219146953913960211
Running compilation step : cd /tmp/ltsmin16219146953913960211;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16219146953913960211;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16219146953913960211;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Applied a total of 0 rules in 182 ms. Remains 1845 /1845 variables (removed 0) and now considering 6521/6521 (removed 0) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-21 00:03:03] [INFO ] Computed 42 invariants in 129 ms
[2024-05-21 00:03:04] [INFO ] Implicit Places using invariants in 1278 ms returned []
[2024-05-21 00:03:04] [INFO ] Invariant cache hit.
[2024-05-21 00:03:05] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-21 00:03:21] [INFO ] Implicit Places using invariants and state equation in 16700 ms returned []
Implicit Place search using SMT with State Equation took 17982 ms to find 0 implicit places.
[2024-05-21 00:03:21] [INFO ] Redundant transitions in 453 ms returned []
Running 6481 sub problems to find dead transitions.
[2024-05-21 00:03:21] [INFO ] Invariant cache hit.
[2024-05-21 00:03:21] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 35163ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 35211ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53844 ms. Remains : 1845/1845 places, 6521/6521 transitions.
Built C files in :
/tmp/ltsmin17026177902120208471
[2024-05-21 00:03:56] [INFO ] Too many transitions (6521) to apply POR reductions. Disabling POR matrices.
[2024-05-21 00:03:57] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17026177902120208471
Running compilation step : cd /tmp/ltsmin17026177902120208471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17026177902120208471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17026177902120208471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-21 00:04:00] [INFO ] Flatten gal took : 104 ms
[2024-05-21 00:04:00] [INFO ] Flatten gal took : 108 ms
[2024-05-21 00:04:00] [INFO ] Time to serialize gal into /tmp/LTL2223225954878493061.gal : 19 ms
[2024-05-21 00:04:00] [INFO ] Time to serialize properties into /tmp/LTL5350750945735177414.prop : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2223225954878493061.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17990500291679023513.hoa' '-atoms' '/tmp/LTL5350750945735177414.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5350750945735177414.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17990500291679023513.hoa
Detected timeout of ITS tools.
[2024-05-21 00:04:15] [INFO ] Flatten gal took : 108 ms
[2024-05-21 00:04:15] [INFO ] Flatten gal took : 112 ms
[2024-05-21 00:04:15] [INFO ] Time to serialize gal into /tmp/LTL2866097666284556304.gal : 22 ms
[2024-05-21 00:04:15] [INFO ] Time to serialize properties into /tmp/LTL16443935795412993736.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2866097666284556304.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16443935795412993736.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G((("((Node24requestsent29<1)||(Node8GiveAnswer17<1))")||(("((Node19IsInserted>=1)&&(Node10requestsent19>=1))")U("(Node24requests...415
Formula 0 simplified : GF((!"((Node24requestsent29<1)||(Node8GiveAnswer17<1))" & (!"((Node19IsInserted>=1)&&(Node10requestsent19>=1))" R !"(Node24requestse...342
Detected timeout of ITS tools.
[2024-05-21 00:04:30] [INFO ] Flatten gal took : 107 ms
[2024-05-21 00:04:30] [INFO ] Applying decomposition
[2024-05-21 00:04:31] [INFO ] Flatten gal took : 113 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16030056430634831371.txt' '-o' '/tmp/graph16030056430634831371.bin' '-w' '/tmp/graph16030056430634831371.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16030056430634831371.bin' '-l' '-1' '-v' '-w' '/tmp/graph16030056430634831371.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:04:31] [INFO ] Decomposing Gal with order
[2024-05-21 00:04:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:04:31] [INFO ] Removed a total of 4805 redundant transitions.
[2024-05-21 00:04:31] [INFO ] Flatten gal took : 357 ms
[2024-05-21 00:04:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 3121 labels/synchronizations in 199 ms.
[2024-05-21 00:04:31] [INFO ] Time to serialize gal into /tmp/LTL6626241926456928087.gal : 28 ms
[2024-05-21 00:04:31] [INFO ] Time to serialize properties into /tmp/LTL3037270866995786975.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6626241926456928087.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3037270866995786975.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G((("((u25.Node24requestsent29<1)||(u18.Node8GiveAnswer17<1))")||(("((u20.Node19IsInserted>=1)&&(u11.Node10requestsent19>=1))")U(...467
Formula 0 simplified : GF((!"((u25.Node24requestsent29<1)||(u18.Node8GiveAnswer17<1))" & (!"((u20.Node19IsInserted>=1)&&(u11.Node10requestsent19>=1))" R !"...386
Detected timeout of ITS tools.
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-06 finished in 505790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||((X(p1)&&F(p2)) U (G(((X(p1)&&F(p2))||X(G(p1))))||(!p3&&((X(p1)&&F(p2))||X(G(p1))))))))))'
[2024-05-21 00:04:47] [INFO ] Flatten gal took : 167 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4213052702431689706
[2024-05-21 00:04:47] [INFO ] Too many transitions (9840) to apply POR reductions. Disabling POR matrices.
[2024-05-21 00:04:47] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4213052702431689706
Running compilation step : cd /tmp/ltsmin4213052702431689706;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 00:04:47] [INFO ] Applying decomposition
[2024-05-21 00:04:48] [INFO ] Flatten gal took : 201 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17648028031206648532.txt' '-o' '/tmp/graph17648028031206648532.bin' '-w' '/tmp/graph17648028031206648532.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17648028031206648532.bin' '-l' '-1' '-v' '-w' '/tmp/graph17648028031206648532.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:04:48] [INFO ] Decomposing Gal with order
[2024-05-21 00:04:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:04:48] [INFO ] Removed a total of 4812 redundant transitions.
[2024-05-21 00:04:49] [INFO ] Flatten gal took : 421 ms
[2024-05-21 00:04:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 4682 labels/synchronizations in 242 ms.
[2024-05-21 00:04:49] [INFO ] Time to serialize gal into /tmp/LTLFireability10762982956051299714.gal : 40 ms
[2024-05-21 00:04:49] [INFO ] Time to serialize properties into /tmp/LTLFireability9945871262117718945.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10762982956051299714.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9945871262117718945.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !(((G(F("((i7.u19.Node37GiveAnswer4>=1)||(i14.u35.Node3GiveAnswer8<1))")))U((X(("(i7.u19.Node37GiveAnswer4>=1)")U("(i28.u67.Node34Give...205
Formula 0 simplified : FG!"((i7.u19.Node37GiveAnswer4>=1)||(i14.u35.Node3GiveAnswer8<1))" R (X(!"(i7.u19.Node37GiveAnswer4>=1)" R !"(i28.u67.Node34GiveAnsw...195

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CANInsertWithFailure-PT-040, 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 r070-tall-171620505200124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-040.tgz
mv CANInsertWithFailure-PT-040 execution
cd execution
if [ "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 ;