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.r087-tall-171620521500087.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 gold2023
Input is CANInsertWithFailure-PT-060, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521500087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 23M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 188K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 09:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 09:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 22M 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-060-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716233730628

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-060
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-20 19:35:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 19:35:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 19:35:32] [INFO ] Load time of PNML (sax parser for PT used): 532 ms
[2024-05-20 19:35:32] [INFO ] Transformed 7924 places.
[2024-05-20 19:35:32] [INFO ] Transformed 21960 transitions.
[2024-05-20 19:35:32] [INFO ] Parsed PT model containing 7924 places and 21960 transitions and 58800 arcs in 690 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 7924 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7924/7924 places, 21960/21960 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7923 transition count 21960
Applied a total of 1 rules in 1720 ms. Remains 7923 /7924 variables (removed 1) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2024-05-20 19:35:37] [INFO ] Computed 62 invariants in 2530 ms
[2024-05-20 19:35:39] [INFO ] Implicit Places using invariants in 4101 ms returned []
Implicit Place search using SMT only with invariants took 4269 ms to find 0 implicit places.
[2024-05-20 19:35:39] [INFO ] Invariant cache hit.
[2024-05-20 19:35:40] [INFO ] Dead Transitions using invariants and state equation in 850 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7923/7924 places, 21960/21960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6846 ms. Remains : 7923/7924 places, 21960/21960 transitions.
Support contains 56 out of 7923 places after structural reductions.
[2024-05-20 19:35:41] [INFO ] Flatten gal took : 979 ms
[2024-05-20 19:35:41] [INFO ] Flatten gal took : 465 ms
[2024-05-20 19:35:43] [INFO ] Input system was already deterministic with 21960 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 665 ms. (steps per millisecond=15 ) properties (out of 31) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
[2024-05-20 19:35:43] [INFO ] Invariant cache hit.
[2024-05-20 19:35:47] [INFO ] [Real]Absence check using 60 positive place invariants in 70 ms returned sat
[2024-05-20 19:35:47] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 117 ms returned sat
[2024-05-20 19:35:47] [INFO ] After 3708ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2024-05-20 19:35:50] [INFO ] [Nat]Absence check using 60 positive place invariants in 69 ms returned sat
[2024-05-20 19:35:50] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 117 ms returned sat
[2024-05-20 19:36:12] [INFO ] After 19629ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2024-05-20 19:36:13] [INFO ] State equation strengthened by 7140 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 19:36:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 19:36:13] [INFO ] After 25337ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:23
Fused 23 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 69 ms.
Support contains 41 out of 7923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 415 transitions
Trivial Post-agglo rules discarded 415 transitions
Performed 415 trivial Post agglomeration. Transition count delta: 415
Iterating post reduction 0 with 415 rules applied. Total rules applied 415 place count 7923 transition count 21545
Reduce places removed 415 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 416 rules applied. Total rules applied 831 place count 7508 transition count 21544
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 832 place count 7507 transition count 21544
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 832 place count 7507 transition count 21542
Deduced a syphon composed of 2 places in 19 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 836 place count 7505 transition count 21542
Performed 3396 Post agglomeration using F-continuation condition.Transition count delta: 3396
Deduced a syphon composed of 3396 places in 8 ms
Reduce places removed 3396 places and 0 transitions.
Iterating global reduction 3 with 6792 rules applied. Total rules applied 7628 place count 4109 transition count 18146
Drop transitions removed 3283 transitions
Redundant transition composition rules discarded 3283 transitions
Iterating global reduction 3 with 3283 rules applied. Total rules applied 10911 place count 4109 transition count 14863
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 10912 place count 4109 transition count 14862
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10913 place count 4108 transition count 14862
Partial Free-agglomeration rule applied 3885 times.
Drop transitions removed 3885 transitions
Iterating global reduction 4 with 3885 rules applied. Total rules applied 14798 place count 4108 transition count 14862
Partial Free-agglomeration rule applied 124 times.
Drop transitions removed 124 transitions
Iterating global reduction 4 with 124 rules applied. Total rules applied 14922 place count 4108 transition count 14862
Applied a total of 14922 rules in 7709 ms. Remains 4108 /7923 variables (removed 3815) and now considering 14862/21960 (removed 7098) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7712 ms. Remains : 4108/7923 places, 14862/21960 transitions.
Incomplete random walk after 10000 steps, including 34 resets, run finished after 502 ms. (steps per millisecond=19 ) properties (out of 23) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 14862 rows 4108 cols
[2024-05-20 19:36:22] [INFO ] Computed 62 invariants in 676 ms
[2024-05-20 19:36:23] [INFO ] After 1234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-05-20 19:36:24] [INFO ] [Nat]Absence check using 60 positive place invariants in 39 ms returned sat
[2024-05-20 19:36:24] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 51 ms returned sat
[2024-05-20 19:36:38] [INFO ] After 12752ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2024-05-20 19:36:38] [INFO ] State equation strengthened by 14349 read => feed constraints.
[2024-05-20 19:36:48] [INFO ] After 10137ms SMT Verify possible using 14349 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2024-05-20 19:36:48] [INFO ] After 10139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-20 19:36:48] [INFO ] After 25087ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 2 properties in 102 ms.
Support contains 27 out of 4108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4108/4108 places, 14862/14862 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 9 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 4099 transition count 14853
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 25 place count 4099 transition count 14853
Applied a total of 25 rules in 2719 ms. Remains 4099 /4108 variables (removed 9) and now considering 14853/14862 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2722 ms. Remains : 4099/4108 places, 14853/14862 transitions.
Incomplete random walk after 10000 steps, including 34 resets, run finished after 500 ms. (steps per millisecond=20 ) properties (out of 14) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 14853 rows 4099 cols
[2024-05-20 19:36:52] [INFO ] Computed 62 invariants in 653 ms
[2024-05-20 19:36:53] [INFO ] After 835ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-20 19:36:54] [INFO ] [Nat]Absence check using 60 positive place invariants in 38 ms returned sat
[2024-05-20 19:36:54] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 53 ms returned sat
[2024-05-20 19:37:03] [INFO ] After 8890ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-20 19:37:03] [INFO ] State equation strengthened by 14433 read => feed constraints.
[2024-05-20 19:37:17] [INFO ] After 13578ms SMT Verify possible using 14433 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-05-20 19:37:18] [INFO ] After 14626ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-20 19:37:18] [INFO ] After 25099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 1 properties in 96 ms.
Support contains 18 out of 4099 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4099/4099 places, 14853/14853 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 4095 transition count 14849
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 13 place count 4095 transition count 14849
Applied a total of 13 rules in 2715 ms. Remains 4095 /4099 variables (removed 4) and now considering 14849/14853 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2716 ms. Remains : 4095/4099 places, 14849/14853 transitions.
Incomplete random walk after 10000 steps, including 34 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 14849 rows 4095 cols
[2024-05-20 19:37:22] [INFO ] Computed 62 invariants in 674 ms
[2024-05-20 19:37:23] [INFO ] After 922ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-20 19:37:24] [INFO ] [Nat]Absence check using 60 positive place invariants in 37 ms returned sat
[2024-05-20 19:37:24] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 48 ms returned sat
[2024-05-20 19:37:33] [INFO ] After 8289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-20 19:37:33] [INFO ] State equation strengthened by 14446 read => feed constraints.
[2024-05-20 19:37:44] [INFO ] After 11278ms SMT Verify possible using 14446 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-20 19:37:48] [INFO ] After 15504ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-20 19:37:48] [INFO ] After 25048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 164 ms.
Support contains 15 out of 4095 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4095/4095 places, 14849/14849 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 4093 transition count 14847
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 4093 transition count 14846
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 4092 transition count 14846
Applied a total of 6 rules in 2482 ms. Remains 4092 /4095 variables (removed 3) and now considering 14846/14849 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2482 ms. Remains : 4092/4095 places, 14846/14849 transitions.
Computed a total of 242 stabilizing places and 420 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1259 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2024-05-20 19:37:55] [INFO ] Computed 62 invariants in 2203 ms
[2024-05-20 19:37:56] [INFO ] Implicit Places using invariants in 3670 ms returned []
Implicit Place search using SMT only with invariants took 3672 ms to find 0 implicit places.
[2024-05-20 19:37:56] [INFO ] Invariant cache hit.
[2024-05-20 19:37:57] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5661 ms. Remains : 7923/7923 places, 21960/21960 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GT s4201 s907) (GT 2 s3931))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-00 finished in 5941 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||(p0&&X(p1)))))'
Support contains 2 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1207 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2024-05-20 19:37:58] [INFO ] Invariant cache hit.
[2024-05-20 19:37:59] [INFO ] Implicit Places using invariants in 738 ms returned []
Implicit Place search using SMT only with invariants took 758 ms to find 0 implicit places.
[2024-05-20 19:37:59] [INFO ] Invariant cache hit.
[2024-05-20 19:38:00] [INFO ] Dead Transitions using invariants and state equation in 702 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2692 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(LEQ 1 s309), p1:(LEQ 1 s1126)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 4463 steps with 2 reset in 113 ms.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-01 finished in 3094 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1173 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2024-05-20 19:38:02] [INFO ] Invariant cache hit.
[2024-05-20 19:38:02] [INFO ] Implicit Places using invariants in 810 ms returned []
Implicit Place search using SMT only with invariants took 834 ms to find 0 implicit places.
[2024-05-20 19:38:02] [INFO ] Invariant cache hit.
[2024-05-20 19:38:03] [INFO ] Dead Transitions using invariants and state equation in 730 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2752 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ s2278 s350) (LEQ s2240 s1857))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 5516 ms.
Product exploration explored 100000 steps with 50000 reset in 5356 ms.
Computed a total of 242 stabilizing places and 420 stable transitions
Computed a total of 242 stabilizing places and 420 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 33 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-02 finished in 13840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&G(F(((p1&&X(p2))||G(p2))))) U p3))'
Support contains 5 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1338 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2024-05-20 19:38:16] [INFO ] Invariant cache hit.
[2024-05-20 19:38:16] [INFO ] Implicit Places using invariants in 748 ms returned []
Implicit Place search using SMT only with invariants took 750 ms to find 0 implicit places.
[2024-05-20 19:38:16] [INFO ] Invariant cache hit.
[2024-05-20 19:38:17] [INFO ] Dead Transitions using invariants and state equation in 741 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2841 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 1133 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(LEQ 1 s6628), p0:(LEQ s5665 s3225), p2:(GT 2 s3418), p1:(GT 2 s7503)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 68 reset in 1281 ms.
Product exploration explored 100000 steps with 68 reset in 1365 ms.
Computed a total of 242 stabilizing places and 420 stable transitions
Computed a total of 242 stabilizing places and 420 stable transitions
Knowledge obtained : [(AND (NOT p3) p0 p2 p1), (X (AND p2 p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), true, (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 239 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 82761 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 82761 steps, saw 77867 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :2
Running SMT prover for 6 properties.
[2024-05-20 19:38:25] [INFO ] Invariant cache hit.
[2024-05-20 19:38:26] [INFO ] [Real]Absence check using 60 positive place invariants in 69 ms returned sat
[2024-05-20 19:38:26] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 115 ms returned sat
[2024-05-20 19:38:45] [INFO ] After 18512ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2024-05-20 19:38:45] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2024-05-20 19:38:50] [INFO ] After 4939ms SMT Verify possible using 7140 Read/Feed constraints in real domain returned unsat :0 sat :1 real:4
[2024-05-20 19:38:50] [INFO ] After 4940ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:4
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-20 19:38:50] [INFO ] After 25106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:4
[2024-05-20 19:38:51] [INFO ] [Nat]Absence check using 60 positive place invariants in 66 ms returned sat
[2024-05-20 19:38:51] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 113 ms returned sat
[2024-05-20 19:39:12] [INFO ] After 20084ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 19:39:15] [INFO ] After 3061ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-20 19:39:15] [INFO ] After 3062ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-20 19:39:15] [INFO ] After 25085ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 75 ms.
Support contains 5 out of 7923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3538 Post agglomeration using F-continuation condition.Transition count delta: 3538
Deduced a syphon composed of 3538 places in 5 ms
Reduce places removed 3538 places and 0 transitions.
Iterating global reduction 2 with 7076 rules applied. Total rules applied 7916 place count 3965 transition count 18002
Drop transitions removed 3420 transitions
Redundant transition composition rules discarded 3420 transitions
Iterating global reduction 2 with 3420 rules applied. Total rules applied 11336 place count 3965 transition count 14582
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11337 place count 3965 transition count 14581
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11338 place count 3964 transition count 14581
Partial Free-agglomeration rule applied 3658 times.
Drop transitions removed 3658 transitions
Iterating global reduction 3 with 3658 rules applied. Total rules applied 14996 place count 3964 transition count 14581
Applied a total of 14996 rules in 6241 ms. Remains 3964 /7923 variables (removed 3959) and now considering 14581/21960 (removed 7379) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6242 ms. Remains : 3964/7923 places, 14581/21960 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 583 ms. (steps per millisecond=17 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 54948 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 54948 steps, saw 29650 distinct states, run finished after 3003 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 14581 rows 3964 cols
[2024-05-20 19:39:26] [INFO ] Computed 62 invariants in 562 ms
[2024-05-20 19:39:27] [INFO ] [Real]Absence check using 60 positive place invariants in 37 ms returned sat
[2024-05-20 19:39:27] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 47 ms returned sat
[2024-05-20 19:39:33] [INFO ] After 7117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 19:39:34] [INFO ] [Nat]Absence check using 60 positive place invariants in 34 ms returned sat
[2024-05-20 19:39:34] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 46 ms returned sat
[2024-05-20 19:39:41] [INFO ] After 7450ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 19:39:42] [INFO ] State equation strengthened by 14393 read => feed constraints.
[2024-05-20 19:39:47] [INFO ] After 5502ms SMT Verify possible using 14393 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 19:39:51] [INFO ] After 9583ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2306 ms.
[2024-05-20 19:39:53] [INFO ] After 20510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 69 ms.
Support contains 5 out of 3964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14581/14581 transitions.
Applied a total of 0 rules in 880 ms. Remains 3964 /3964 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 880 ms. Remains : 3964/3964 places, 14581/14581 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14581/14581 transitions.
Applied a total of 0 rules in 902 ms. Remains 3964 /3964 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
[2024-05-20 19:39:55] [INFO ] Invariant cache hit.
[2024-05-20 19:39:58] [INFO ] Implicit Places using invariants in 3113 ms returned []
Implicit Place search using SMT only with invariants took 3132 ms to find 0 implicit places.
[2024-05-20 19:39:58] [INFO ] Invariant cache hit.
[2024-05-20 19:40:06] [INFO ] Dead Transitions using invariants and state equation in 7445 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11488 ms. Remains : 3964/3964 places, 14581/14581 transitions.
Knowledge obtained : [(AND (NOT p3) p0 p2 p1), (X (AND p2 p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), true, (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p3)))), (F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 18 factoid took 220 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 383 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 173 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
// Phase 1: matrix 21960 rows 7923 cols
[2024-05-20 19:40:09] [INFO ] Computed 62 invariants in 2210 ms
Could not prove EG (NOT p3)
Support contains 5 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1207 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2024-05-20 19:40:25] [INFO ] Invariant cache hit.
[2024-05-20 19:40:26] [INFO ] Implicit Places using invariants in 736 ms returned []
Implicit Place search using SMT only with invariants took 756 ms to find 0 implicit places.
[2024-05-20 19:40:26] [INFO ] Invariant cache hit.
[2024-05-20 19:40:27] [INFO ] Dead Transitions using invariants and state equation in 712 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2695 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Computed a total of 242 stabilizing places and 420 stable transitions
Computed a total of 242 stabilizing places and 420 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT (AND p1 (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (AND p0 (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p2))), true, (X (X (NOT (AND p1 (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 193 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 344 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-20 19:40:28] [INFO ] Invariant cache hit.
[2024-05-20 19:40:29] [INFO ] [Real]Absence check using 60 positive place invariants in 65 ms returned sat
[2024-05-20 19:40:30] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 113 ms returned sat
[2024-05-20 19:40:47] [INFO ] After 17499ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2024-05-20 19:40:47] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2024-05-20 19:40:53] [INFO ] After 5975ms SMT Verify possible using 7140 Read/Feed constraints in real domain returned unsat :0 sat :1 real:4
[2024-05-20 19:40:53] [INFO ] After 5976ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:4
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-20 19:40:53] [INFO ] After 25115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:4
[2024-05-20 19:40:55] [INFO ] [Nat]Absence check using 60 positive place invariants in 67 ms returned sat
[2024-05-20 19:40:55] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 112 ms returned sat
[2024-05-20 19:41:13] [INFO ] After 17696ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 19:41:18] [INFO ] After 5509ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 19:41:18] [INFO ] After 5509ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-20 19:41:18] [INFO ] After 25178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 5 out of 7923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3538 Post agglomeration using F-continuation condition.Transition count delta: 3538
Deduced a syphon composed of 3538 places in 5 ms
Reduce places removed 3538 places and 0 transitions.
Iterating global reduction 2 with 7076 rules applied. Total rules applied 7916 place count 3965 transition count 18002
Drop transitions removed 3420 transitions
Redundant transition composition rules discarded 3420 transitions
Iterating global reduction 2 with 3420 rules applied. Total rules applied 11336 place count 3965 transition count 14582
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11337 place count 3965 transition count 14581
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11338 place count 3964 transition count 14581
Partial Free-agglomeration rule applied 3658 times.
Drop transitions removed 3658 transitions
Iterating global reduction 3 with 3658 rules applied. Total rules applied 14996 place count 3964 transition count 14581
Applied a total of 14996 rules in 5794 ms. Remains 3964 /7923 variables (removed 3959) and now considering 14581/21960 (removed 7379) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5795 ms. Remains : 3964/7923 places, 14581/21960 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 56221 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 56221 steps, saw 29846 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 14581 rows 3964 cols
[2024-05-20 19:41:28] [INFO ] Computed 62 invariants in 591 ms
[2024-05-20 19:41:29] [INFO ] [Real]Absence check using 60 positive place invariants in 35 ms returned sat
[2024-05-20 19:41:29] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 45 ms returned sat
[2024-05-20 19:41:36] [INFO ] After 7634ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 19:41:37] [INFO ] [Nat]Absence check using 60 positive place invariants in 39 ms returned sat
[2024-05-20 19:41:37] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 49 ms returned sat
[2024-05-20 19:41:45] [INFO ] After 8055ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 19:41:45] [INFO ] State equation strengthened by 14393 read => feed constraints.
[2024-05-20 19:41:51] [INFO ] After 6241ms SMT Verify possible using 14393 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 19:41:55] [INFO ] After 9456ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2135 ms.
[2024-05-20 19:41:57] [INFO ] After 20778ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 52 ms.
Support contains 5 out of 3964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14581/14581 transitions.
Applied a total of 0 rules in 888 ms. Remains 3964 /3964 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 888 ms. Remains : 3964/3964 places, 14581/14581 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14581/14581 transitions.
Applied a total of 0 rules in 854 ms. Remains 3964 /3964 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
[2024-05-20 19:41:59] [INFO ] Invariant cache hit.
[2024-05-20 19:42:02] [INFO ] Implicit Places using invariants in 3201 ms returned []
Implicit Place search using SMT only with invariants took 3217 ms to find 0 implicit places.
[2024-05-20 19:42:02] [INFO ] Invariant cache hit.
[2024-05-20 19:42:08] [INFO ] Dead Transitions using invariants and state equation in 6276 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10380 ms. Remains : 3964/3964 places, 14581/14581 transitions.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT (AND p1 (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (AND p0 (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p2))), true, (X (X (NOT (AND p1 (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p3)))), (F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 18 factoid took 412 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
// Phase 1: matrix 21960 rows 7923 cols
[2024-05-20 19:42:11] [INFO ] Computed 62 invariants in 2254 ms
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 170 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 69 reset in 1259 ms.
Product exploration explored 100000 steps with 69 reset in 1311 ms.
Built C files in :
/tmp/ltsmin16775825914590939280
[2024-05-20 19:42:29] [INFO ] Built C files in 243ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16775825914590939280
Running compilation step : cd /tmp/ltsmin16775825914590939280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16775825914590939280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16775825914590939280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1138 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2024-05-20 19:42:34] [INFO ] Invariant cache hit.
[2024-05-20 19:42:34] [INFO ] Implicit Places using invariants in 743 ms returned []
Implicit Place search using SMT only with invariants took 757 ms to find 0 implicit places.
[2024-05-20 19:42:34] [INFO ] Invariant cache hit.
[2024-05-20 19:42:35] [INFO ] Dead Transitions using invariants and state equation in 705 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2602 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Built C files in :
/tmp/ltsmin16423968765028313835
[2024-05-20 19:42:35] [INFO ] Built C files in 158ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16423968765028313835
Running compilation step : cd /tmp/ltsmin16423968765028313835;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16423968765028313835;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16423968765028313835;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 19:42:40] [INFO ] Flatten gal took : 463 ms
[2024-05-20 19:42:40] [INFO ] Flatten gal took : 419 ms
[2024-05-20 19:42:41] [INFO ] Time to serialize gal into /tmp/LTL4314581968534215749.gal : 492 ms
[2024-05-20 19:42:41] [INFO ] Time to serialize properties into /tmp/LTL7259564280571138695.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4314581968534215749.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4756602071766699277.hoa' '-atoms' '/tmp/LTL7259564280571138695.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7259564280571138695.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4756602071766699277.hoa
Detected timeout of ITS tools.
[2024-05-20 19:42:56] [INFO ] Flatten gal took : 378 ms
[2024-05-20 19:42:57] [INFO ] Flatten gal took : 388 ms
[2024-05-20 19:42:58] [INFO ] Time to serialize gal into /tmp/LTL17466192396848910745.gal : 994 ms
[2024-05-20 19:42:58] [INFO ] Time to serialize properties into /tmp/LTL4888368990781367659.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17466192396848910745.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4888368990781367659.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((("(Node40requestsent52<=Node20requestsent11)")&&(G(F((G("(Node21GiveAnswer49<2)"))||(("(Node56requestsent26<2)")&&(X("(Node21GiveA...202
Formula 0 simplified : (!"(Node40requestsent52<=Node20requestsent11)" | G(F!"(Node21GiveAnswer49<2)" & FG(!"(Node56requestsent26<2)" | X!"(Node21GiveAnswer...192
Detected timeout of ITS tools.
[2024-05-20 19:43:13] [INFO ] Flatten gal took : 400 ms
[2024-05-20 19:43:13] [INFO ] Applying decomposition
[2024-05-20 19:43:14] [INFO ] Flatten gal took : 419 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1347989435132896212.txt' '-o' '/tmp/graph1347989435132896212.bin' '-w' '/tmp/graph1347989435132896212.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1347989435132896212.bin' '-l' '-1' '-v' '-w' '/tmp/graph1347989435132896212.weights' '-q' '0' '-e' '0.001'
[2024-05-20 19:43:15] [INFO ] Decomposing Gal with order
[2024-05-20 19:43:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 19:43:18] [INFO ] Removed a total of 10838 redundant transitions.
[2024-05-20 19:43:20] [INFO ] Flatten gal took : 4287 ms
[2024-05-20 19:43:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 6987 labels/synchronizations in 1243 ms.
[2024-05-20 19:43:25] [INFO ] Time to serialize gal into /tmp/LTL16847639121160991514.gal : 168 ms
[2024-05-20 19:43:25] [INFO ] Time to serialize properties into /tmp/LTL6615738225782507757.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16847639121160991514.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6615738225782507757.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((("(gu240.Node40requestsent52<=gu240.Node20requestsent11)")&&(G(F((G("(gi0.gi1.gi58.gu198.Node21GiveAnswer49<2)"))||(("(gi0.gi1.gi5...288
Formula 0 simplified : (!"(gu240.Node40requestsent52<=gu240.Node20requestsent11)" | G(F!"(gi0.gi1.gi58.gu198.Node21GiveAnswer49<2)" & FG(!"(gi0.gi1.gi58.gu...278
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4940243310628400200
[2024-05-20 19:43:40] [INFO ] Built C files in 152ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4940243310628400200
Running compilation step : cd /tmp/ltsmin4940243310628400200;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4940243310628400200;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4940243310628400200;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-03 finished in 328535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1154 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2024-05-20 19:43:44] [INFO ] Invariant cache hit.
[2024-05-20 19:43:45] [INFO ] Implicit Places using invariants in 819 ms returned []
Implicit Place search using SMT only with invariants took 822 ms to find 0 implicit places.
[2024-05-20 19:43:45] [INFO ] Invariant cache hit.
[2024-05-20 19:43:46] [INFO ] Dead Transitions using invariants and state equation in 814 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2799 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 264 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s4446 s654)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 583 steps with 0 reset in 18 ms.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-04 finished in 3139 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3540 Post agglomeration using F-continuation condition.Transition count delta: 3540
Deduced a syphon composed of 3540 places in 6 ms
Reduce places removed 3540 places and 0 transitions.
Iterating global reduction 2 with 7080 rules applied. Total rules applied 7920 place count 3963 transition count 18000
Drop transitions removed 3422 transitions
Redundant transition composition rules discarded 3422 transitions
Iterating global reduction 2 with 3422 rules applied. Total rules applied 11342 place count 3963 transition count 14578
Applied a total of 11342 rules in 4518 ms. Remains 3963 /7923 variables (removed 3960) and now considering 14578/21960 (removed 7382) transitions.
// Phase 1: matrix 14578 rows 3963 cols
[2024-05-20 19:43:51] [INFO ] Computed 62 invariants in 975 ms
[2024-05-20 19:43:53] [INFO ] Implicit Places using invariants in 2211 ms returned []
Implicit Place search using SMT only with invariants took 2212 ms to find 0 implicit places.
[2024-05-20 19:43:53] [INFO ] Invariant cache hit.
[2024-05-20 19:44:00] [INFO ] Dead Transitions using invariants and state equation in 7186 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3963/7923 places, 14578/21960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13922 ms. Remains : 3963/7923 places, 14578/21960 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s3253)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 332 reset in 1565 ms.
Product exploration explored 100000 steps with 336 reset in 1615 ms.
Computed a total of 183 stabilizing places and 300 stable transitions
Computed a total of 183 stabilizing places and 300 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 32 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 64910 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64910 steps, saw 34014 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 19:44:06] [INFO ] Invariant cache hit.
[2024-05-20 19:44:07] [INFO ] [Real]Absence check using 60 positive place invariants in 41 ms returned sat
[2024-05-20 19:44:07] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 53 ms returned sat
[2024-05-20 19:44:12] [INFO ] After 5039ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 19:44:12] [INFO ] State equation strengthened by 10738 read => feed constraints.
[2024-05-20 19:44:13] [INFO ] After 1245ms SMT Verify possible using 10738 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:44:13] [INFO ] After 6944ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:44:14] [INFO ] [Nat]Absence check using 60 positive place invariants in 40 ms returned sat
[2024-05-20 19:44:14] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 51 ms returned sat
[2024-05-20 19:44:18] [INFO ] After 4463ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 19:44:19] [INFO ] After 985ms SMT Verify possible using 10738 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 19:44:20] [INFO ] After 1479ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 334 ms.
[2024-05-20 19:44:20] [INFO ] After 6839ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 3963 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3963/3963 places, 14578/14578 transitions.
Applied a total of 0 rules in 782 ms. Remains 3963 /3963 variables (removed 0) and now considering 14578/14578 (removed 0) transitions.
[2024-05-20 19:44:21] [INFO ] Invariant cache hit.
[2024-05-20 19:44:23] [INFO ] Implicit Places using invariants in 1293 ms returned []
Implicit Place search using SMT only with invariants took 1304 ms to find 0 implicit places.
[2024-05-20 19:44:23] [INFO ] Invariant cache hit.
[2024-05-20 19:44:30] [INFO ] Dead Transitions using invariants and state equation in 7141 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9241 ms. Remains : 3963/3963 places, 14578/14578 transitions.
Computed a total of 183 stabilizing places and 300 stable transitions
Computed a total of 183 stabilizing places and 300 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 64337 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64337 steps, saw 33947 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 19:44:33] [INFO ] Invariant cache hit.
[2024-05-20 19:44:34] [INFO ] [Real]Absence check using 60 positive place invariants in 35 ms returned sat
[2024-05-20 19:44:34] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 46 ms returned sat
[2024-05-20 19:44:38] [INFO ] After 4233ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 19:44:38] [INFO ] State equation strengthened by 10738 read => feed constraints.
[2024-05-20 19:44:39] [INFO ] After 1086ms SMT Verify possible using 10738 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:44:39] [INFO ] After 5908ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:44:40] [INFO ] [Nat]Absence check using 60 positive place invariants in 42 ms returned sat
[2024-05-20 19:44:40] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 53 ms returned sat
[2024-05-20 19:44:45] [INFO ] After 5343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 19:44:46] [INFO ] After 1057ms SMT Verify possible using 10738 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 19:44:47] [INFO ] After 1569ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 342 ms.
[2024-05-20 19:44:47] [INFO ] After 7808ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 334 reset in 2038 ms.
Product exploration explored 100000 steps with 335 reset in 2067 ms.
Built C files in :
/tmp/ltsmin4575044245425144974
[2024-05-20 19:44:51] [INFO ] Too many transitions (14578) to apply POR reductions. Disabling POR matrices.
[2024-05-20 19:44:51] [INFO ] Built C files in 97ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4575044245425144974
Running compilation step : cd /tmp/ltsmin4575044245425144974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4575044245425144974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4575044245425144974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 3963 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3963/3963 places, 14578/14578 transitions.
Applied a total of 0 rules in 813 ms. Remains 3963 /3963 variables (removed 0) and now considering 14578/14578 (removed 0) transitions.
[2024-05-20 19:44:55] [INFO ] Invariant cache hit.
[2024-05-20 19:44:56] [INFO ] Implicit Places using invariants in 1229 ms returned []
Implicit Place search using SMT only with invariants took 1230 ms to find 0 implicit places.
[2024-05-20 19:44:56] [INFO ] Invariant cache hit.
[2024-05-20 19:45:03] [INFO ] Dead Transitions using invariants and state equation in 6634 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8677 ms. Remains : 3963/3963 places, 14578/14578 transitions.
Built C files in :
/tmp/ltsmin16551723341592823879
[2024-05-20 19:45:03] [INFO ] Too many transitions (14578) to apply POR reductions. Disabling POR matrices.
[2024-05-20 19:45:03] [INFO ] Built C files in 93ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16551723341592823879
Running compilation step : cd /tmp/ltsmin16551723341592823879;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16551723341592823879;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16551723341592823879;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 19:45:07] [INFO ] Flatten gal took : 434 ms
[2024-05-20 19:45:07] [INFO ] Flatten gal took : 245 ms
[2024-05-20 19:45:07] [INFO ] Time to serialize gal into /tmp/LTL11192025270464787805.gal : 44 ms
[2024-05-20 19:45:07] [INFO ] Time to serialize properties into /tmp/LTL4554195882076761831.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11192025270464787805.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18056922983209129599.hoa' '-atoms' '/tmp/LTL4554195882076761831.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4554195882076761831.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18056922983209129599.hoa
Detected timeout of ITS tools.
[2024-05-20 19:45:23] [INFO ] Flatten gal took : 239 ms
[2024-05-20 19:45:23] [INFO ] Flatten gal took : 259 ms
[2024-05-20 19:45:23] [INFO ] Time to serialize gal into /tmp/LTL10870391690359214326.gal : 44 ms
[2024-05-20 19:45:23] [INFO ] Time to serialize properties into /tmp/LTL12754922967519112675.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10870391690359214326.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12754922967519112675.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(Node48requestsent10<1)"))))
Formula 0 simplified : FG!"(Node48requestsent10<1)"
Detected timeout of ITS tools.
[2024-05-20 19:45:38] [INFO ] Flatten gal took : 245 ms
[2024-05-20 19:45:38] [INFO ] Applying decomposition
[2024-05-20 19:45:39] [INFO ] Flatten gal took : 258 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12972215369378077518.txt' '-o' '/tmp/graph12972215369378077518.bin' '-w' '/tmp/graph12972215369378077518.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12972215369378077518.bin' '-l' '-1' '-v' '-w' '/tmp/graph12972215369378077518.weights' '-q' '0' '-e' '0.001'
[2024-05-20 19:45:39] [INFO ] Decomposing Gal with order
[2024-05-20 19:45:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 19:45:41] [INFO ] Removed a total of 10828 redundant transitions.
[2024-05-20 19:45:41] [INFO ] Flatten gal took : 1327 ms
[2024-05-20 19:45:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 7081 labels/synchronizations in 1007 ms.
[2024-05-20 19:45:42] [INFO ] Time to serialize gal into /tmp/LTL12349308790015780314.gal : 76 ms
[2024-05-20 19:45:42] [INFO ] Time to serialize properties into /tmp/LTL2064170398144883076.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12349308790015780314.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2064170398144883076.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(u49.Node48requestsent10<1)"))))
Formula 0 simplified : FG!"(u49.Node48requestsent10<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9627921574154896744
[2024-05-20 19:45:57] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9627921574154896744
Running compilation step : cd /tmp/ltsmin9627921574154896744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin9627921574154896744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin9627921574154896744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-05 finished in 134290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U (!p0&&F(p1)))))'
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1339 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2024-05-20 19:46:04] [INFO ] Computed 62 invariants in 2213 ms
[2024-05-20 19:46:05] [INFO ] Implicit Places using invariants in 3553 ms returned []
Implicit Place search using SMT only with invariants took 3555 ms to find 0 implicit places.
[2024-05-20 19:46:05] [INFO ] Invariant cache hit.
[2024-05-20 19:46:06] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5666 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p0), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s3398 s1921), p1:(GT s6989 s7838)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 68 reset in 1519 ms.
Product exploration explored 100000 steps with 70 reset in 1634 ms.
Computed a total of 242 stabilizing places and 420 stable transitions
Computed a total of 242 stabilizing places and 420 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 134 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 210 ms :[true, (OR (NOT p1) p0), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), false]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-20 19:46:10] [INFO ] Invariant cache hit.
[2024-05-20 19:46:11] [INFO ] After 844ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 19:46:12] [INFO ] [Nat]Absence check using 60 positive place invariants in 67 ms returned sat
[2024-05-20 19:46:12] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 114 ms returned sat
[2024-05-20 19:46:29] [INFO ] After 17253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 19:46:29] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2024-05-20 19:46:34] [INFO ] After 4853ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 19:46:36] [INFO ] After 6346ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 233 ms.
[2024-05-20 19:46:36] [INFO ] After 25066ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3538 Post agglomeration using F-continuation condition.Transition count delta: 3538
Deduced a syphon composed of 3538 places in 6 ms
Reduce places removed 3538 places and 0 transitions.
Iterating global reduction 2 with 7076 rules applied. Total rules applied 7916 place count 3965 transition count 18002
Drop transitions removed 3421 transitions
Redundant transition composition rules discarded 3421 transitions
Iterating global reduction 2 with 3421 rules applied. Total rules applied 11337 place count 3965 transition count 14581
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11338 place count 3965 transition count 14580
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11339 place count 3964 transition count 14580
Partial Free-agglomeration rule applied 3659 times.
Drop transitions removed 3659 transitions
Iterating global reduction 3 with 3659 rules applied. Total rules applied 14998 place count 3964 transition count 14580
Applied a total of 14998 rules in 6219 ms. Remains 3964 /7923 variables (removed 3959) and now considering 14580/21960 (removed 7380) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6219 ms. Remains : 3964/7923 places, 14580/21960 transitions.
Incomplete random walk after 10000 steps, including 35 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 57952 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57952 steps, saw 30089 distinct states, run finished after 3002 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 14580 rows 3964 cols
[2024-05-20 19:46:46] [INFO ] Computed 62 invariants in 562 ms
[2024-05-20 19:46:46] [INFO ] After 458ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 19:46:47] [INFO ] [Nat]Absence check using 60 positive place invariants in 35 ms returned sat
[2024-05-20 19:46:47] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 47 ms returned sat
[2024-05-20 19:46:55] [INFO ] After 7804ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 19:46:55] [INFO ] State equation strengthened by 14393 read => feed constraints.
[2024-05-20 19:46:59] [INFO ] After 4148ms SMT Verify possible using 14393 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 19:47:00] [INFO ] After 5350ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 856 ms.
[2024-05-20 19:47:01] [INFO ] After 14795ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 3964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14580/14580 transitions.
Applied a total of 0 rules in 864 ms. Remains 3964 /3964 variables (removed 0) and now considering 14580/14580 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 865 ms. Remains : 3964/3964 places, 14580/14580 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14580/14580 transitions.
Applied a total of 0 rules in 884 ms. Remains 3964 /3964 variables (removed 0) and now considering 14580/14580 (removed 0) transitions.
[2024-05-20 19:47:03] [INFO ] Invariant cache hit.
[2024-05-20 19:47:06] [INFO ] Implicit Places using invariants in 3042 ms returned []
Implicit Place search using SMT only with invariants took 3043 ms to find 0 implicit places.
[2024-05-20 19:47:06] [INFO ] Invariant cache hit.
[2024-05-20 19:47:13] [INFO ] Dead Transitions using invariants and state equation in 6709 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10641 ms. Remains : 3964/3964 places, 14580/14580 transitions.
Graph (trivial) has 14205 edges and 3964 vertex of which 3716 / 3964 are part of one of the 2 SCC in 10 ms
Free SCC test removed 3714 places
Drop transitions removed 10670 transitions
Ensure Unique test removed 3649 transitions
Reduce isomorphic transitions removed 14319 transitions.
Graph (complete) has 623 edges and 250 vertex of which 69 are kept as prefixes of interest. Removing 181 places using SCC suffix rule.0 ms
Discarding 181 places :
Also discarding 59 output transitions
Drop transitions removed 59 transitions
Drop transitions removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Iterating post reduction 0 with 121 rules applied. Total rules applied 123 place count 69 transition count 81
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 182 place count 10 transition count 22
Iterating global reduction 1 with 59 rules applied. Total rules applied 241 place count 10 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 243 place count 9 transition count 21
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 246 place count 9 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 247 place count 9 transition count 17
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 249 place count 8 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 250 place count 7 transition count 15
Applied a total of 250 rules in 71 ms. Remains 7 /3964 variables (removed 3957) and now considering 15/14580 (removed 14565) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 15 rows 7 cols
[2024-05-20 19:47:13] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 19:47:13] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 19:47:13] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 19:47:13] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-20 19:47:13] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 119 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 230 ms :[true, (OR (NOT p1) p0), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 206 ms :[true, (OR (NOT p1) p0), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), false]
// Phase 1: matrix 21960 rows 7923 cols
[2024-05-20 19:47:16] [INFO ] Computed 62 invariants in 2212 ms
Could not prove EG true
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3538 Post agglomeration using F-continuation condition.Transition count delta: 3538
Deduced a syphon composed of 3538 places in 7 ms
Reduce places removed 3538 places and 0 transitions.
Iterating global reduction 2 with 7076 rules applied. Total rules applied 7916 place count 3965 transition count 18002
Drop transitions removed 3421 transitions
Redundant transition composition rules discarded 3421 transitions
Iterating global reduction 2 with 3421 rules applied. Total rules applied 11337 place count 3965 transition count 14581
Applied a total of 11337 rules in 4854 ms. Remains 3965 /7923 variables (removed 3958) and now considering 14581/21960 (removed 7379) transitions.
// Phase 1: matrix 14581 rows 3965 cols
[2024-05-20 19:47:37] [INFO ] Computed 62 invariants in 900 ms
[2024-05-20 19:47:40] [INFO ] Implicit Places using invariants in 4603 ms returned []
Implicit Place search using SMT only with invariants took 4617 ms to find 0 implicit places.
[2024-05-20 19:47:40] [INFO ] Invariant cache hit.
[2024-05-20 19:47:47] [INFO ] Dead Transitions using invariants and state equation in 6197 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3965/7923 places, 14581/21960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15677 ms. Remains : 3965/7923 places, 14581/21960 transitions.
Computed a total of 183 stabilizing places and 300 stable transitions
Computed a total of 183 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 94 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[true, (OR (NOT p1) p0), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), false]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-20 19:47:47] [INFO ] Invariant cache hit.
[2024-05-20 19:47:48] [INFO ] After 486ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 19:47:48] [INFO ] [Nat]Absence check using 60 positive place invariants in 37 ms returned sat
[2024-05-20 19:47:48] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 46 ms returned sat
[2024-05-20 19:47:55] [INFO ] After 5885ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 19:47:55] [INFO ] State equation strengthened by 10735 read => feed constraints.
[2024-05-20 19:48:01] [INFO ] After 6064ms SMT Verify possible using 10735 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 19:48:02] [INFO ] After 7785ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1032 ms.
[2024-05-20 19:48:03] [INFO ] After 15490ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 8 ms.
Support contains 4 out of 3965 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3965/3965 places, 14581/14581 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3965 transition count 14580
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3964 transition count 14580
Partial Free-agglomeration rule applied 3659 times.
Drop transitions removed 3659 transitions
Iterating global reduction 1 with 3659 rules applied. Total rules applied 3661 place count 3964 transition count 14580
Applied a total of 3661 rules in 2607 ms. Remains 3964 /3965 variables (removed 1) and now considering 14580/14581 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2609 ms. Remains : 3964/3965 places, 14580/14581 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 62173 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62173 steps, saw 30668 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 14580 rows 3964 cols
[2024-05-20 19:48:10] [INFO ] Computed 62 invariants in 551 ms
[2024-05-20 19:48:10] [INFO ] After 363ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:48:11] [INFO ] [Nat]Absence check using 60 positive place invariants in 34 ms returned sat
[2024-05-20 19:48:11] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 44 ms returned sat
[2024-05-20 19:48:18] [INFO ] After 7414ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 19:48:18] [INFO ] State equation strengthened by 14393 read => feed constraints.
[2024-05-20 19:48:22] [INFO ] After 3607ms SMT Verify possible using 14393 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 19:48:23] [INFO ] After 4332ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 419 ms.
[2024-05-20 19:48:23] [INFO ] After 12754ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 3964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14580/14580 transitions.
Applied a total of 0 rules in 881 ms. Remains 3964 /3964 variables (removed 0) and now considering 14580/14580 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 881 ms. Remains : 3964/3964 places, 14580/14580 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14580/14580 transitions.
Applied a total of 0 rules in 757 ms. Remains 3964 /3964 variables (removed 0) and now considering 14580/14580 (removed 0) transitions.
[2024-05-20 19:48:25] [INFO ] Invariant cache hit.
[2024-05-20 19:48:28] [INFO ] Implicit Places using invariants in 3167 ms returned []
Implicit Place search using SMT only with invariants took 3169 ms to find 0 implicit places.
[2024-05-20 19:48:28] [INFO ] Invariant cache hit.
[2024-05-20 19:48:34] [INFO ] Dead Transitions using invariants and state equation in 6153 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10086 ms. Remains : 3964/3964 places, 14580/14580 transitions.
Graph (trivial) has 14205 edges and 3964 vertex of which 3716 / 3964 are part of one of the 2 SCC in 2 ms
Free SCC test removed 3714 places
Drop transitions removed 10670 transitions
Ensure Unique test removed 3649 transitions
Reduce isomorphic transitions removed 14319 transitions.
Graph (complete) has 623 edges and 250 vertex of which 69 are kept as prefixes of interest. Removing 181 places using SCC suffix rule.1 ms
Discarding 181 places :
Also discarding 59 output transitions
Drop transitions removed 59 transitions
Drop transitions removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Iterating post reduction 0 with 121 rules applied. Total rules applied 123 place count 69 transition count 81
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 182 place count 10 transition count 22
Iterating global reduction 1 with 59 rules applied. Total rules applied 241 place count 10 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 243 place count 9 transition count 21
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 246 place count 9 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 247 place count 9 transition count 17
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 249 place count 8 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 250 place count 7 transition count 15
Applied a total of 250 rules in 32 ms. Remains 7 /3964 variables (removed 3957) and now considering 15/14580 (removed 14565) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 15 rows 7 cols
[2024-05-20 19:48:34] [INFO ] Computed 0 invariants in 1 ms
[2024-05-20 19:48:34] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:48:34] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 19:48:34] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-20 19:48:34] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 301 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 272 ms :[true, (OR (NOT p1) p0), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 254 ms :[true, (OR (NOT p1) p0), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), false]
// Phase 1: matrix 14581 rows 3965 cols
[2024-05-20 19:48:36] [INFO ] Computed 62 invariants in 968 ms
Proved EG true
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) (NOT p0))), (F (NOT p0)), true]
Knowledge based reduction with 9 factoid took 228 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 226 ms :[true, (OR (NOT p1) p0), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 254 ms :[true, (OR (NOT p1) p0), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), false]
Product exploration explored 100000 steps with 329 reset in 1577 ms.
Product exploration explored 100000 steps with 330 reset in 1644 ms.
Built C files in :
/tmp/ltsmin14107588943780231790
[2024-05-20 19:48:50] [INFO ] Too many transitions (14581) to apply POR reductions. Disabling POR matrices.
[2024-05-20 19:48:50] [INFO ] Built C files in 99ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14107588943780231790
Running compilation step : cd /tmp/ltsmin14107588943780231790;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14107588943780231790;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14107588943780231790;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 3965 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3965/3965 places, 14581/14581 transitions.
Applied a total of 0 rules in 662 ms. Remains 3965 /3965 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
[2024-05-20 19:48:53] [INFO ] Invariant cache hit.
[2024-05-20 19:48:55] [INFO ] Implicit Places using invariants in 1255 ms returned []
Implicit Place search using SMT only with invariants took 1257 ms to find 0 implicit places.
[2024-05-20 19:48:55] [INFO ] Invariant cache hit.
[2024-05-20 19:49:01] [INFO ] Dead Transitions using invariants and state equation in 6786 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8712 ms. Remains : 3965/3965 places, 14581/14581 transitions.
Built C files in :
/tmp/ltsmin5472844356370718620
[2024-05-20 19:49:01] [INFO ] Too many transitions (14581) to apply POR reductions. Disabling POR matrices.
[2024-05-20 19:49:02] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5472844356370718620
Running compilation step : cd /tmp/ltsmin5472844356370718620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5472844356370718620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5472844356370718620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 19:49:05] [INFO ] Flatten gal took : 248 ms
[2024-05-20 19:49:05] [INFO ] Flatten gal took : 265 ms
[2024-05-20 19:49:05] [INFO ] Time to serialize gal into /tmp/LTL7491991172937732503.gal : 45 ms
[2024-05-20 19:49:05] [INFO ] Time to serialize properties into /tmp/LTL4890107673210868067.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7491991172937732503.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16510342344061516521.hoa' '-atoms' '/tmp/LTL4890107673210868067.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4890107673210868067.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16510342344061516521.hoa
Detected timeout of ITS tools.
[2024-05-20 19:49:21] [INFO ] Flatten gal took : 250 ms
[2024-05-20 19:49:21] [INFO ] Flatten gal took : 259 ms
[2024-05-20 19:49:21] [INFO ] Time to serialize gal into /tmp/LTL18247437107412925929.gal : 44 ms
[2024-05-20 19:49:21] [INFO ] Time to serialize properties into /tmp/LTL2747715072252493518.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18247437107412925929.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2747715072252493518.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F(G("(Node21GiveAnswer39<=Node9requestsent8)")))U(("(Node21GiveAnswer39>Node9requestsent8)")&&(F("(Node52requestsent5>Node59Give...171
Formula 0 simplified : X(GF!"(Node21GiveAnswer39<=Node9requestsent8)" R (!"(Node21GiveAnswer39>Node9requestsent8)" | G!"(Node52requestsent5>Node59GiveAnswe...162
Detected timeout of ITS tools.
[2024-05-20 19:49:36] [INFO ] Flatten gal took : 248 ms
[2024-05-20 19:49:36] [INFO ] Applying decomposition
[2024-05-20 19:49:37] [INFO ] Flatten gal took : 272 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13886497962385139681.txt' '-o' '/tmp/graph13886497962385139681.bin' '-w' '/tmp/graph13886497962385139681.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13886497962385139681.bin' '-l' '-1' '-v' '-w' '/tmp/graph13886497962385139681.weights' '-q' '0' '-e' '0.001'
[2024-05-20 19:49:37] [INFO ] Decomposing Gal with order
[2024-05-20 19:49:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 19:49:38] [INFO ] Removed a total of 10825 redundant transitions.
[2024-05-20 19:49:39] [INFO ] Flatten gal took : 1193 ms
[2024-05-20 19:49:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 7083 labels/synchronizations in 930 ms.
[2024-05-20 19:49:40] [INFO ] Time to serialize gal into /tmp/LTL12431047088114143691.gal : 54 ms
[2024-05-20 19:49:40] [INFO ] Time to serialize properties into /tmp/LTL1449360647111935326.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12431047088114143691.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1449360647111935326.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F(G("(gu61.Node21GiveAnswer39<=gu61.Node9requestsent8)")))U(("(gu61.Node21GiveAnswer39>gu61.Node9requestsent8)")&&(F("(gu62.Node...201
Formula 0 simplified : X(GF!"(gu61.Node21GiveAnswer39<=gu61.Node9requestsent8)" R (!"(gu61.Node21GiveAnswer39>gu61.Node9requestsent8)" | G!"(gu62.Node52req...192
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10325821459957973189
[2024-05-20 19:49:55] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10325821459957973189
Running compilation step : cd /tmp/ltsmin10325821459957973189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10325821459957973189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10325821459957973189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-06 finished in 238298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&(F(p1)||X(p0)))))'
Support contains 7 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1025 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2024-05-20 19:50:02] [INFO ] Computed 62 invariants in 2248 ms
[2024-05-20 19:50:03] [INFO ] Implicit Places using invariants in 3554 ms returned []
Implicit Place search using SMT only with invariants took 3555 ms to find 0 implicit places.
[2024-05-20 19:50:03] [INFO ] Invariant cache hit.
[2024-05-20 19:50:04] [INFO ] Dead Transitions using invariants and state equation in 770 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5352 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (LEQ s2506 s5166) (LEQ s1666 s725) (LEQ 3 s2836)), p0:(LEQ s28 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 137 reset in 1278 ms.
Product exploration explored 100000 steps with 136 reset in 1320 ms.
Computed a total of 242 stabilizing places and 420 stable transitions
Computed a total of 242 stabilizing places and 420 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 858 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=71 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 2 out of 7923 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 416 transitions
Trivial Post-agglo rules discarded 416 transitions
Performed 416 trivial Post agglomeration. Transition count delta: 416
Iterating post reduction 0 with 416 rules applied. Total rules applied 416 place count 7923 transition count 21544
Reduce places removed 416 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 417 rules applied. Total rules applied 833 place count 7507 transition count 21543
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 834 place count 7506 transition count 21543
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 834 place count 7506 transition count 21542
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 836 place count 7505 transition count 21542
Performed 3475 Post agglomeration using F-continuation condition.Transition count delta: 3475
Deduced a syphon composed of 3475 places in 9 ms
Reduce places removed 3475 places and 0 transitions.
Iterating global reduction 3 with 6950 rules applied. Total rules applied 7786 place count 4030 transition count 18067
Drop transitions removed 3360 transitions
Redundant transition composition rules discarded 3360 transitions
Iterating global reduction 3 with 3360 rules applied. Total rules applied 11146 place count 4030 transition count 14707
Partial Post-agglomeration rule applied 118 times.
Drop transitions removed 118 transitions
Iterating global reduction 3 with 118 rules applied. Total rules applied 11264 place count 4030 transition count 14707
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 11322 place count 3972 transition count 14649
Iterating global reduction 3 with 58 rules applied. Total rules applied 11380 place count 3972 transition count 14649
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 3 with 58 rules applied. Total rules applied 11438 place count 3972 transition count 14591
Applied a total of 11438 rules in 5721 ms. Remains 3972 /7923 variables (removed 3951) and now considering 14591/21960 (removed 7369) transitions.
// Phase 1: matrix 14591 rows 3972 cols
[2024-05-20 19:50:14] [INFO ] Computed 62 invariants in 929 ms
[2024-05-20 19:50:15] [INFO ] Implicit Places using invariants in 2193 ms returned []
Implicit Place search using SMT only with invariants took 2195 ms to find 0 implicit places.
[2024-05-20 19:50:15] [INFO ] Invariant cache hit.
[2024-05-20 19:50:22] [INFO ] Dead Transitions using invariants and state equation in 7102 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3972/7923 places, 14591/21960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15022 ms. Remains : 3972/7923 places, 14591/21960 transitions.
Computed a total of 178 stabilizing places and 298 stable transitions
Computed a total of 178 stabilizing places and 298 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 530 steps, including 1 resets, run visited all 1 properties in 12 ms. (steps per millisecond=44 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 323 reset in 1561 ms.
Stack based approach found an accepted trace after 6115 steps with 19 reset with depth 298 and stack size 298 in 121 ms.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-07 finished in 25826 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||((p1||X(G(p2))) U (p0&&(p1||X(G(p2)))))))))'
Support contains 2 out of 7923 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3535 Post agglomeration using F-continuation condition.Transition count delta: 3535
Deduced a syphon composed of 3535 places in 9 ms
Reduce places removed 3535 places and 0 transitions.
Iterating global reduction 2 with 7070 rules applied. Total rules applied 7910 place count 3968 transition count 18005
Drop transitions removed 3417 transitions
Redundant transition composition rules discarded 3417 transitions
Iterating global reduction 2 with 3417 rules applied. Total rules applied 11327 place count 3968 transition count 14588
Applied a total of 11327 rules in 3617 ms. Remains 3968 /7923 variables (removed 3955) and now considering 14588/21960 (removed 7372) transitions.
// Phase 1: matrix 14588 rows 3968 cols
[2024-05-20 19:50:29] [INFO ] Computed 62 invariants in 976 ms
[2024-05-20 19:50:30] [INFO ] Implicit Places using invariants in 2251 ms returned []
Implicit Place search using SMT only with invariants took 2251 ms to find 0 implicit places.
[2024-05-20 19:50:30] [INFO ] Invariant cache hit.
[2024-05-20 19:50:37] [INFO ] Dead Transitions using invariants and state equation in 6395 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3968/7923 places, 14588/21960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12267 ms. Remains : 3968/7923 places, 14588/21960 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s3868 s3904)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 308 steps with 0 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-08 finished in 12422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0&&G(p1)))||F(p2))))'
Support contains 5 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1029 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2024-05-20 19:50:40] [INFO ] Computed 62 invariants in 2214 ms
[2024-05-20 19:50:41] [INFO ] Implicit Places using invariants in 2918 ms returned []
Implicit Place search using SMT only with invariants took 2919 ms to find 0 implicit places.
[2024-05-20 19:50:41] [INFO ] Invariant cache hit.
[2024-05-20 19:50:41] [INFO ] Dead Transitions using invariants and state equation in 736 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4685 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(LEQ s5426 s3569), p0:(GT s7855 s1672), p1:(OR (LEQ s7855 s1672) (LEQ 1 s4468))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3214 ms.
Product exploration explored 100000 steps with 50000 reset in 3247 ms.
Computed a total of 242 stabilizing places and 420 stable transitions
Computed a total of 242 stabilizing places and 420 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND (NOT p2) p0 p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-09 finished in 11480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 3 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1014 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2024-05-20 19:50:49] [INFO ] Invariant cache hit.
[2024-05-20 19:50:50] [INFO ] Implicit Places using invariants in 803 ms returned []
Implicit Place search using SMT only with invariants took 806 ms to find 0 implicit places.
[2024-05-20 19:50:50] [INFO ] Invariant cache hit.
[2024-05-20 19:50:51] [INFO ] Dead Transitions using invariants and state equation in 801 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2623 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LEQ s1841 s4069), p0:(LEQ 1 s5539)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 68 reset in 1652 ms.
Product exploration explored 100000 steps with 71 reset in 1306 ms.
Computed a total of 242 stabilizing places and 420 stable transitions
Computed a total of 242 stabilizing places and 420 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 83269 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 83269 steps, saw 78007 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :3
Running SMT prover for 1 properties.
[2024-05-20 19:50:58] [INFO ] Invariant cache hit.
[2024-05-20 19:50:59] [INFO ] After 848ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:50:59] [INFO ] [Nat]Absence check using 60 positive place invariants in 75 ms returned sat
[2024-05-20 19:51:00] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 119 ms returned sat
[2024-05-20 19:51:17] [INFO ] After 17248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 19:51:17] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2024-05-20 19:51:24] [INFO ] After 6645ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-20 19:51:24] [INFO ] After 25067ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 19 ms.
Support contains 3 out of 7923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3540 Post agglomeration using F-continuation condition.Transition count delta: 3540
Deduced a syphon composed of 3540 places in 6 ms
Reduce places removed 3540 places and 0 transitions.
Iterating global reduction 2 with 7080 rules applied. Total rules applied 7920 place count 3963 transition count 18000
Drop transitions removed 3422 transitions
Redundant transition composition rules discarded 3422 transitions
Iterating global reduction 2 with 3422 rules applied. Total rules applied 11342 place count 3963 transition count 14578
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11343 place count 3963 transition count 14577
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11344 place count 3962 transition count 14577
Partial Free-agglomeration rule applied 3658 times.
Drop transitions removed 3658 transitions
Iterating global reduction 3 with 3658 rules applied. Total rules applied 15002 place count 3962 transition count 14577
Applied a total of 15002 rules in 5043 ms. Remains 3962 /7923 variables (removed 3961) and now considering 14577/21960 (removed 7383) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5043 ms. Remains : 3962/7923 places, 14577/21960 transitions.
Incomplete random walk after 10000 steps, including 35 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 62084 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62084 steps, saw 30657 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 14577 rows 3962 cols
[2024-05-20 19:51:33] [INFO ] Computed 62 invariants in 626 ms
[2024-05-20 19:51:33] [INFO ] After 375ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:51:33] [INFO ] [Nat]Absence check using 60 positive place invariants in 36 ms returned sat
[2024-05-20 19:51:33] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 47 ms returned sat
[2024-05-20 19:51:40] [INFO ] After 6654ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 19:51:40] [INFO ] State equation strengthened by 14395 read => feed constraints.
[2024-05-20 19:51:43] [INFO ] After 3050ms SMT Verify possible using 14395 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 19:51:44] [INFO ] After 3709ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 381 ms.
[2024-05-20 19:51:44] [INFO ] After 11376ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14577/14577 transitions.
Applied a total of 0 rules in 748 ms. Remains 3962 /3962 variables (removed 0) and now considering 14577/14577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 748 ms. Remains : 3962/3962 places, 14577/14577 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14577/14577 transitions.
Applied a total of 0 rules in 744 ms. Remains 3962 /3962 variables (removed 0) and now considering 14577/14577 (removed 0) transitions.
[2024-05-20 19:51:46] [INFO ] Invariant cache hit.
[2024-05-20 19:51:49] [INFO ] Implicit Places using invariants in 3290 ms returned []
Implicit Place search using SMT only with invariants took 3290 ms to find 0 implicit places.
[2024-05-20 19:51:49] [INFO ] Invariant cache hit.
[2024-05-20 19:51:56] [INFO ] Dead Transitions using invariants and state equation in 6987 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11024 ms. Remains : 3962/3962 places, 14577/14577 transitions.
Graph (trivial) has 14206 edges and 3962 vertex of which 3716 / 3962 are part of one of the 2 SCC in 3 ms
Free SCC test removed 3714 places
Drop transitions removed 10670 transitions
Ensure Unique test removed 3652 transitions
Reduce isomorphic transitions removed 14322 transitions.
Graph (complete) has 617 edges and 248 vertex of which 67 are kept as prefixes of interest. Removing 181 places using SCC suffix rule.0 ms
Discarding 181 places :
Also discarding 59 output transitions
Drop transitions removed 59 transitions
Drop transitions removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 122 rules applied. Total rules applied 124 place count 67 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 125 place count 66 transition count 74
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 183 place count 8 transition count 16
Iterating global reduction 2 with 58 rules applied. Total rules applied 241 place count 8 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 243 place count 8 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 244 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 246 place count 7 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 247 place count 6 transition count 11
Applied a total of 247 rules in 27 ms. Remains 6 /3962 variables (removed 3956) and now considering 11/14577 (removed 14566) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 6 cols
[2024-05-20 19:51:56] [INFO ] Computed 0 invariants in 1 ms
[2024-05-20 19:51:56] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:51:56] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 19:51:56] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-20 19:51:56] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 3 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3540 Post agglomeration using F-continuation condition.Transition count delta: 3540
Deduced a syphon composed of 3540 places in 6 ms
Reduce places removed 3540 places and 0 transitions.
Iterating global reduction 2 with 7080 rules applied. Total rules applied 7920 place count 3963 transition count 18000
Drop transitions removed 3422 transitions
Redundant transition composition rules discarded 3422 transitions
Iterating global reduction 2 with 3422 rules applied. Total rules applied 11342 place count 3963 transition count 14578
Applied a total of 11342 rules in 3602 ms. Remains 3963 /7923 variables (removed 3960) and now considering 14578/21960 (removed 7382) transitions.
// Phase 1: matrix 14578 rows 3963 cols
[2024-05-20 19:52:01] [INFO ] Computed 62 invariants in 994 ms
[2024-05-20 19:52:02] [INFO ] Implicit Places using invariants in 2219 ms returned []
Implicit Place search using SMT only with invariants took 2220 ms to find 0 implicit places.
[2024-05-20 19:52:03] [INFO ] Invariant cache hit.
[2024-05-20 19:52:09] [INFO ] Dead Transitions using invariants and state equation in 6979 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3963/7923 places, 14578/21960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12802 ms. Remains : 3963/7923 places, 14578/21960 transitions.
Computed a total of 183 stabilizing places and 300 stable transitions
Computed a total of 183 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 94 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 32 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-20 19:52:10] [INFO ] Invariant cache hit.
[2024-05-20 19:52:11] [INFO ] [Real]Absence check using 60 positive place invariants in 35 ms returned sat
[2024-05-20 19:52:11] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 47 ms returned sat
[2024-05-20 19:52:20] [INFO ] After 9714ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 19:52:20] [INFO ] [Nat]Absence check using 60 positive place invariants in 38 ms returned sat
[2024-05-20 19:52:20] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 50 ms returned sat
[2024-05-20 19:52:27] [INFO ] After 6280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 19:52:27] [INFO ] State equation strengthened by 10738 read => feed constraints.
[2024-05-20 19:52:34] [INFO ] After 7231ms SMT Verify possible using 10738 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 19:52:35] [INFO ] After 8351ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 715 ms.
[2024-05-20 19:52:36] [INFO ] After 16073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 6 ms.
Support contains 3 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14578/14578 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3963 transition count 14577
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3962 transition count 14577
Partial Free-agglomeration rule applied 3658 times.
Drop transitions removed 3658 transitions
Iterating global reduction 1 with 3658 rules applied. Total rules applied 3660 place count 3962 transition count 14577
Applied a total of 3660 rules in 2050 ms. Remains 3962 /3963 variables (removed 1) and now considering 14577/14578 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2050 ms. Remains : 3962/3963 places, 14577/14578 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 61600 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61600 steps, saw 30576 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 14577 rows 3962 cols
[2024-05-20 19:52:42] [INFO ] Computed 62 invariants in 598 ms
[2024-05-20 19:52:42] [INFO ] After 430ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:52:43] [INFO ] [Nat]Absence check using 60 positive place invariants in 37 ms returned sat
[2024-05-20 19:52:43] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 47 ms returned sat
[2024-05-20 19:52:49] [INFO ] After 6602ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 19:52:49] [INFO ] State equation strengthened by 14395 read => feed constraints.
[2024-05-20 19:52:52] [INFO ] After 3003ms SMT Verify possible using 14395 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 19:52:53] [INFO ] After 3679ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 393 ms.
[2024-05-20 19:52:54] [INFO ] After 11308ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14577/14577 transitions.
Applied a total of 0 rules in 758 ms. Remains 3962 /3962 variables (removed 0) and now considering 14577/14577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 758 ms. Remains : 3962/3962 places, 14577/14577 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14577/14577 transitions.
Applied a total of 0 rules in 759 ms. Remains 3962 /3962 variables (removed 0) and now considering 14577/14577 (removed 0) transitions.
[2024-05-20 19:52:55] [INFO ] Invariant cache hit.
[2024-05-20 19:52:58] [INFO ] Implicit Places using invariants in 3196 ms returned []
Implicit Place search using SMT only with invariants took 3197 ms to find 0 implicit places.
[2024-05-20 19:52:58] [INFO ] Invariant cache hit.
[2024-05-20 19:53:05] [INFO ] Dead Transitions using invariants and state equation in 6923 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10882 ms. Remains : 3962/3962 places, 14577/14577 transitions.
Graph (trivial) has 14206 edges and 3962 vertex of which 3716 / 3962 are part of one of the 2 SCC in 2 ms
Free SCC test removed 3714 places
Drop transitions removed 10670 transitions
Ensure Unique test removed 3652 transitions
Reduce isomorphic transitions removed 14322 transitions.
Graph (complete) has 617 edges and 248 vertex of which 67 are kept as prefixes of interest. Removing 181 places using SCC suffix rule.1 ms
Discarding 181 places :
Also discarding 59 output transitions
Drop transitions removed 59 transitions
Drop transitions removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 122 rules applied. Total rules applied 124 place count 67 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 125 place count 66 transition count 74
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 183 place count 8 transition count 16
Iterating global reduction 2 with 58 rules applied. Total rules applied 241 place count 8 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 243 place count 8 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 244 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 246 place count 7 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 247 place count 6 transition count 11
Applied a total of 247 rules in 26 ms. Remains 6 /3962 variables (removed 3956) and now considering 11/14577 (removed 14566) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 6 cols
[2024-05-20 19:53:05] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 19:53:05] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:53:05] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 19:53:05] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-20 19:53:05] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 327 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 336 reset in 1587 ms.
Product exploration explored 100000 steps with 333 reset in 1645 ms.
Built C files in :
/tmp/ltsmin16950928357222934298
[2024-05-20 19:53:09] [INFO ] Too many transitions (14578) to apply POR reductions. Disabling POR matrices.
[2024-05-20 19:53:09] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16950928357222934298
Running compilation step : cd /tmp/ltsmin16950928357222934298;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16950928357222934298;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16950928357222934298;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 3963 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3963/3963 places, 14578/14578 transitions.
Applied a total of 0 rules in 652 ms. Remains 3963 /3963 variables (removed 0) and now considering 14578/14578 (removed 0) transitions.
// Phase 1: matrix 14578 rows 3963 cols
[2024-05-20 19:53:14] [INFO ] Computed 62 invariants in 947 ms
[2024-05-20 19:53:15] [INFO ] Implicit Places using invariants in 2128 ms returned []
Implicit Place search using SMT only with invariants took 2149 ms to find 0 implicit places.
[2024-05-20 19:53:15] [INFO ] Invariant cache hit.
[2024-05-20 19:53:22] [INFO ] Dead Transitions using invariants and state equation in 6390 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9201 ms. Remains : 3963/3963 places, 14578/14578 transitions.
Built C files in :
/tmp/ltsmin5957015000333437171
[2024-05-20 19:53:22] [INFO ] Too many transitions (14578) to apply POR reductions. Disabling POR matrices.
[2024-05-20 19:53:22] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5957015000333437171
Running compilation step : cd /tmp/ltsmin5957015000333437171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5957015000333437171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5957015000333437171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 19:53:25] [INFO ] Flatten gal took : 247 ms
[2024-05-20 19:53:26] [INFO ] Flatten gal took : 258 ms
[2024-05-20 19:53:26] [INFO ] Time to serialize gal into /tmp/LTL18194596665348184285.gal : 45 ms
[2024-05-20 19:53:26] [INFO ] Time to serialize properties into /tmp/LTL12178983851858176262.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18194596665348184285.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5217671650266666559.hoa' '-atoms' '/tmp/LTL12178983851858176262.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12178983851858176262.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5217671650266666559.hoa
Detected timeout of ITS tools.
[2024-05-20 19:53:41] [INFO ] Flatten gal took : 246 ms
[2024-05-20 19:53:41] [INFO ] Flatten gal took : 260 ms
[2024-05-20 19:53:41] [INFO ] Time to serialize gal into /tmp/LTL18304028784536271873.gal : 50 ms
[2024-05-20 19:53:41] [INFO ] Time to serialize properties into /tmp/LTL15758136781555190702.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18304028784536271873.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15758136781555190702.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F(("(Node39requestsent48>=1)")||(G("(Node8requestsent28<=Node27requestsent20)"))))))
Formula 0 simplified : XG(!"(Node39requestsent48>=1)" & F!"(Node8requestsent28<=Node27requestsent20)")
Detected timeout of ITS tools.
[2024-05-20 19:53:57] [INFO ] Flatten gal took : 246 ms
[2024-05-20 19:53:57] [INFO ] Applying decomposition
[2024-05-20 19:53:57] [INFO ] Flatten gal took : 253 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15463856979368815038.txt' '-o' '/tmp/graph15463856979368815038.bin' '-w' '/tmp/graph15463856979368815038.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15463856979368815038.bin' '-l' '-1' '-v' '-w' '/tmp/graph15463856979368815038.weights' '-q' '0' '-e' '0.001'
[2024-05-20 19:53:57] [INFO ] Decomposing Gal with order
[2024-05-20 19:53:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 19:53:59] [INFO ] Removed a total of 10833 redundant transitions.
[2024-05-20 19:53:59] [INFO ] Flatten gal took : 1104 ms
[2024-05-20 19:54:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 7081 labels/synchronizations in 935 ms.
[2024-05-20 19:54:00] [INFO ] Time to serialize gal into /tmp/LTL16172952600732999359.gal : 52 ms
[2024-05-20 19:54:00] [INFO ] Time to serialize properties into /tmp/LTL2995658838914809811.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16172952600732999359.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2995658838914809811.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(("(gi0.gu40.Node39requestsent48>=1)")||(G("(gu61.Node8requestsent28<=gu61.Node27requestsent20)"))))))
Formula 0 simplified : XG(!"(gi0.gu40.Node39requestsent48>=1)" & F!"(gu61.Node8requestsent28<=gu61.Node27requestsent20)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13130798974655527614
[2024-05-20 19:54:16] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13130798974655527614
Running compilation step : cd /tmp/ltsmin13130798974655527614;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13130798974655527614;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13130798974655527614;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-10 finished in 210411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F((p1||G(p2))))))'
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3538 Post agglomeration using F-continuation condition.Transition count delta: 3538
Deduced a syphon composed of 3538 places in 8 ms
Reduce places removed 3538 places and 0 transitions.
Iterating global reduction 2 with 7076 rules applied. Total rules applied 7916 place count 3965 transition count 18002
Drop transitions removed 3420 transitions
Redundant transition composition rules discarded 3420 transitions
Iterating global reduction 2 with 3420 rules applied. Total rules applied 11336 place count 3965 transition count 14582
Applied a total of 11336 rules in 3778 ms. Remains 3965 /7923 variables (removed 3958) and now considering 14582/21960 (removed 7378) transitions.
// Phase 1: matrix 14582 rows 3965 cols
[2024-05-20 19:54:23] [INFO ] Computed 62 invariants in 952 ms
[2024-05-20 19:54:25] [INFO ] Implicit Places using invariants in 2231 ms returned []
Implicit Place search using SMT only with invariants took 2231 ms to find 0 implicit places.
[2024-05-20 19:54:25] [INFO ] Invariant cache hit.
[2024-05-20 19:54:31] [INFO ] Dead Transitions using invariants and state equation in 6800 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3965/7923 places, 14582/21960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12812 ms. Remains : 3965/7923 places, 14582/21960 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s3396 s658), p2:(GT 2 s708), p1:(GT 3 s1270)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 331 reset in 1587 ms.
Product exploration explored 100000 steps with 329 reset in 1622 ms.
Computed a total of 183 stabilizing places and 300 stable transitions
Computed a total of 183 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND p2 (NOT p1)))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 112 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 32 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 61110 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61110 steps, saw 33510 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-20 19:54:38] [INFO ] Invariant cache hit.
[2024-05-20 19:54:39] [INFO ] [Real]Absence check using 60 positive place invariants in 47 ms returned sat
[2024-05-20 19:54:39] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 49 ms returned sat
[2024-05-20 19:54:45] [INFO ] After 5751ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-20 19:54:45] [INFO ] State equation strengthened by 10736 read => feed constraints.
[2024-05-20 19:54:46] [INFO ] After 1617ms SMT Verify possible using 10736 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 19:54:46] [INFO ] After 8049ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 19:54:47] [INFO ] [Nat]Absence check using 60 positive place invariants in 38 ms returned sat
[2024-05-20 19:54:47] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 49 ms returned sat
[2024-05-20 19:54:53] [INFO ] After 5835ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 19:54:58] [INFO ] After 4751ms SMT Verify possible using 10736 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 19:54:59] [INFO ] After 5944ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 787 ms.
[2024-05-20 19:55:00] [INFO ] After 13168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 3965 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3965/3965 places, 14582/14582 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3965 transition count 14581
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3964 transition count 14581
Partial Free-agglomeration rule applied 3661 times.
Drop transitions removed 3661 transitions
Iterating global reduction 1 with 3661 rules applied. Total rules applied 3663 place count 3964 transition count 14581
Applied a total of 3663 rules in 2205 ms. Remains 3964 /3965 variables (removed 1) and now considering 14581/14582 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2206 ms. Remains : 3964/3965 places, 14581/14582 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 58442 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 58442 steps, saw 30175 distinct states, run finished after 3002 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 14581 rows 3964 cols
[2024-05-20 19:55:06] [INFO ] Computed 62 invariants in 565 ms
[2024-05-20 19:55:06] [INFO ] [Real]Absence check using 60 positive place invariants in 42 ms returned sat
[2024-05-20 19:55:06] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 50 ms returned sat
[2024-05-20 19:55:13] [INFO ] After 6407ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-20 19:55:13] [INFO ] State equation strengthened by 14396 read => feed constraints.
[2024-05-20 19:55:17] [INFO ] After 4180ms SMT Verify possible using 14396 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 19:55:17] [INFO ] After 11293ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 19:55:18] [INFO ] [Nat]Absence check using 60 positive place invariants in 38 ms returned sat
[2024-05-20 19:55:18] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 46 ms returned sat
[2024-05-20 19:55:25] [INFO ] After 7079ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 19:55:30] [INFO ] After 5059ms SMT Verify possible using 14396 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 19:55:31] [INFO ] After 6555ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 930 ms.
[2024-05-20 19:55:32] [INFO ] After 15183ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 3964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14581/14581 transitions.
Applied a total of 0 rules in 766 ms. Remains 3964 /3964 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 766 ms. Remains : 3964/3964 places, 14581/14581 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14581/14581 transitions.
Applied a total of 0 rules in 743 ms. Remains 3964 /3964 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
[2024-05-20 19:55:34] [INFO ] Invariant cache hit.
[2024-05-20 19:55:37] [INFO ] Implicit Places using invariants in 3371 ms returned []
Implicit Place search using SMT only with invariants took 3373 ms to find 0 implicit places.
[2024-05-20 19:55:37] [INFO ] Invariant cache hit.
[2024-05-20 19:55:44] [INFO ] Dead Transitions using invariants and state equation in 7187 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11305 ms. Remains : 3964/3964 places, 14581/14581 transitions.
Graph (trivial) has 14214 edges and 3964 vertex of which 3719 / 3964 are part of one of the 2 SCC in 2 ms
Free SCC test removed 3717 places
Drop transitions removed 10677 transitions
Ensure Unique test removed 3652 transitions
Reduce isomorphic transitions removed 14329 transitions.
Graph (complete) has 614 edges and 247 vertex of which 66 are kept as prefixes of interest. Removing 181 places using SCC suffix rule.0 ms
Discarding 181 places :
Also discarding 59 output transitions
Drop transitions removed 59 transitions
Drop transitions removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 122 rules applied. Total rules applied 124 place count 66 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 125 place count 65 transition count 71
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 183 place count 7 transition count 13
Iterating global reduction 2 with 58 rules applied. Total rules applied 241 place count 7 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 243 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 244 place count 7 transition count 10
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 246 place count 6 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 247 place count 5 transition count 8
Applied a total of 247 rules in 28 ms. Remains 5 /3964 variables (removed 3959) and now considering 8/14581 (removed 14573) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 5 cols
[2024-05-20 19:55:44] [INFO ] Computed 0 invariants in 1 ms
[2024-05-20 19:55:44] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 19:55:44] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 19:55:44] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-20 19:55:44] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND p2 (NOT p1)))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 106 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 3965 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 3965/3965 places, 14582/14582 transitions.
Applied a total of 0 rules in 665 ms. Remains 3965 /3965 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
// Phase 1: matrix 14582 rows 3965 cols
[2024-05-20 19:55:46] [INFO ] Computed 62 invariants in 903 ms
[2024-05-20 19:55:47] [INFO ] Implicit Places using invariants in 2126 ms returned []
Implicit Place search using SMT only with invariants took 2126 ms to find 0 implicit places.
[2024-05-20 19:55:47] [INFO ] Invariant cache hit.
[2024-05-20 19:55:55] [INFO ] Dead Transitions using invariants and state equation in 7257 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10050 ms. Remains : 3965/3965 places, 14582/14582 transitions.
Computed a total of 183 stabilizing places and 300 stable transitions
Computed a total of 183 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 60819 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 60819 steps, saw 33476 distinct states, run finished after 3004 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-20 19:55:58] [INFO ] Invariant cache hit.
[2024-05-20 19:55:59] [INFO ] [Real]Absence check using 60 positive place invariants in 41 ms returned sat
[2024-05-20 19:55:59] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 48 ms returned sat
[2024-05-20 19:56:05] [INFO ] After 5651ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-20 19:56:05] [INFO ] State equation strengthened by 10736 read => feed constraints.
[2024-05-20 19:56:06] [INFO ] After 1703ms SMT Verify possible using 10736 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 19:56:06] [INFO ] After 8048ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 19:56:07] [INFO ] [Nat]Absence check using 60 positive place invariants in 41 ms returned sat
[2024-05-20 19:56:07] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 49 ms returned sat
[2024-05-20 19:56:13] [INFO ] After 6027ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 19:56:18] [INFO ] After 4819ms SMT Verify possible using 10736 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 19:56:19] [INFO ] After 6008ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 768 ms.
[2024-05-20 19:56:20] [INFO ] After 13424ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 3965 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3965/3965 places, 14582/14582 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3965 transition count 14581
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3964 transition count 14581
Partial Free-agglomeration rule applied 3661 times.
Drop transitions removed 3661 transitions
Iterating global reduction 1 with 3661 rules applied. Total rules applied 3663 place count 3964 transition count 14581
Applied a total of 3663 rules in 2035 ms. Remains 3964 /3965 variables (removed 1) and now considering 14581/14582 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2035 ms. Remains : 3964/3965 places, 14581/14582 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 56830 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 56830 steps, saw 29945 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 14581 rows 3964 cols
[2024-05-20 19:56:26] [INFO ] Computed 62 invariants in 582 ms
[2024-05-20 19:56:26] [INFO ] [Real]Absence check using 60 positive place invariants in 39 ms returned sat
[2024-05-20 19:56:26] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 48 ms returned sat
[2024-05-20 19:56:33] [INFO ] After 6590ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-20 19:56:33] [INFO ] State equation strengthened by 14396 read => feed constraints.
[2024-05-20 19:56:37] [INFO ] After 4285ms SMT Verify possible using 14396 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 19:56:37] [INFO ] After 11589ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 19:56:38] [INFO ] [Nat]Absence check using 60 positive place invariants in 36 ms returned sat
[2024-05-20 19:56:38] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 45 ms returned sat
[2024-05-20 19:56:45] [INFO ] After 6488ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 19:56:49] [INFO ] After 4682ms SMT Verify possible using 14396 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 19:56:51] [INFO ] After 6086ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 754 ms.
[2024-05-20 19:56:51] [INFO ] After 13963ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 3964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14581/14581 transitions.
Applied a total of 0 rules in 762 ms. Remains 3964 /3964 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 762 ms. Remains : 3964/3964 places, 14581/14581 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14581/14581 transitions.
Applied a total of 0 rules in 738 ms. Remains 3964 /3964 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
[2024-05-20 19:56:53] [INFO ] Invariant cache hit.
[2024-05-20 19:56:56] [INFO ] Implicit Places using invariants in 3297 ms returned []
Implicit Place search using SMT only with invariants took 3298 ms to find 0 implicit places.
[2024-05-20 19:56:56] [INFO ] Invariant cache hit.
[2024-05-20 19:57:03] [INFO ] Dead Transitions using invariants and state equation in 6916 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10960 ms. Remains : 3964/3964 places, 14581/14581 transitions.
Graph (trivial) has 14214 edges and 3964 vertex of which 3719 / 3964 are part of one of the 2 SCC in 3 ms
Free SCC test removed 3717 places
Drop transitions removed 10677 transitions
Ensure Unique test removed 3652 transitions
Reduce isomorphic transitions removed 14329 transitions.
Graph (complete) has 614 edges and 247 vertex of which 66 are kept as prefixes of interest. Removing 181 places using SCC suffix rule.1 ms
Discarding 181 places :
Also discarding 59 output transitions
Drop transitions removed 59 transitions
Drop transitions removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 122 rules applied. Total rules applied 124 place count 66 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 125 place count 65 transition count 71
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 183 place count 7 transition count 13
Iterating global reduction 2 with 58 rules applied. Total rules applied 241 place count 7 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 243 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 244 place count 7 transition count 10
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 246 place count 6 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 247 place count 5 transition count 8
Applied a total of 247 rules in 30 ms. Remains 5 /3964 variables (removed 3959) and now considering 8/14581 (removed 14573) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 5 cols
[2024-05-20 19:57:03] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 19:57:03] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 19:57:03] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 19:57:03] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-20 19:57:03] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 79 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 329 reset in 1642 ms.
Product exploration explored 100000 steps with 331 reset in 1689 ms.
Built C files in :
/tmp/ltsmin15432051375733513558
[2024-05-20 19:57:07] [INFO ] Too many transitions (14582) to apply POR reductions. Disabling POR matrices.
[2024-05-20 19:57:07] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15432051375733513558
Running compilation step : cd /tmp/ltsmin15432051375733513558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15432051375733513558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15432051375733513558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 3965 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3965/3965 places, 14582/14582 transitions.
Applied a total of 0 rules in 663 ms. Remains 3965 /3965 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
// Phase 1: matrix 14582 rows 3965 cols
[2024-05-20 19:57:12] [INFO ] Computed 62 invariants in 884 ms
[2024-05-20 19:57:13] [INFO ] Implicit Places using invariants in 2149 ms returned []
Implicit Place search using SMT only with invariants took 2149 ms to find 0 implicit places.
[2024-05-20 19:57:13] [INFO ] Invariant cache hit.
[2024-05-20 19:57:20] [INFO ] Dead Transitions using invariants and state equation in 6964 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9779 ms. Remains : 3965/3965 places, 14582/14582 transitions.
Built C files in :
/tmp/ltsmin6423702165017095122
[2024-05-20 19:57:20] [INFO ] Too many transitions (14582) to apply POR reductions. Disabling POR matrices.
[2024-05-20 19:57:20] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6423702165017095122
Running compilation step : cd /tmp/ltsmin6423702165017095122;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin6423702165017095122;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin6423702165017095122;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 19:57:23] [INFO ] Flatten gal took : 256 ms
[2024-05-20 19:57:24] [INFO ] Flatten gal took : 253 ms
[2024-05-20 19:57:24] [INFO ] Time to serialize gal into /tmp/LTL3149904781557143107.gal : 44 ms
[2024-05-20 19:57:24] [INFO ] Time to serialize properties into /tmp/LTL4523901111336058062.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3149904781557143107.gal' '-t' 'CGAL' '-hoa' '/tmp/aut197378336195951307.hoa' '-atoms' '/tmp/LTL4523901111336058062.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL4523901111336058062.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut197378336195951307.hoa
Detected timeout of ITS tools.
[2024-05-20 19:57:39] [INFO ] Flatten gal took : 318 ms
[2024-05-20 19:57:40] [INFO ] Flatten gal took : 252 ms
[2024-05-20 19:57:40] [INFO ] Time to serialize gal into /tmp/LTL8213376507824801874.gal : 48 ms
[2024-05-20 19:57:40] [INFO ] Time to serialize properties into /tmp/LTL16441281999919901624.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8213376507824801874.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16441281999919901624.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(Node50requestsent31<=Node4requestsent56)"))&&(G(F(("(Node15GiveAnswer5<3)")||(G("(Node5GiveAnswer45<2)")))))))
Formula 0 simplified : G!"(Node50requestsent31<=Node4requestsent56)" | G(F!"(Node5GiveAnswer45<2)" & FG!"(Node15GiveAnswer5<3)")
Detected timeout of ITS tools.
[2024-05-20 19:57:55] [INFO ] Flatten gal took : 269 ms
[2024-05-20 19:57:55] [INFO ] Applying decomposition
[2024-05-20 19:57:55] [INFO ] Flatten gal took : 299 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1808514278529051012.txt' '-o' '/tmp/graph1808514278529051012.bin' '-w' '/tmp/graph1808514278529051012.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1808514278529051012.bin' '-l' '-1' '-v' '-w' '/tmp/graph1808514278529051012.weights' '-q' '0' '-e' '0.001'
[2024-05-20 19:57:56] [INFO ] Decomposing Gal with order
[2024-05-20 19:57:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 19:57:57] [INFO ] Removed a total of 10830 redundant transitions.
[2024-05-20 19:57:57] [INFO ] Flatten gal took : 1220 ms
[2024-05-20 19:57:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 7081 labels/synchronizations in 1025 ms.
[2024-05-20 19:57:59] [INFO ] Time to serialize gal into /tmp/LTL10182814662148759157.gal : 58 ms
[2024-05-20 19:57:59] [INFO ] Time to serialize properties into /tmp/LTL5916889757458830248.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10182814662148759157.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5916889757458830248.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(gu61.Node50requestsent31<=gu61.Node4requestsent56)"))&&(G(F(("(gi0.gu6.Node15GiveAnswer5<3)")||(G("(gi0.gu46.Node5GiveAnswer45...166
Formula 0 simplified : G!"(gu61.Node50requestsent31<=gu61.Node4requestsent56)" | G(F!"(gi0.gu46.Node5GiveAnswer45<2)" & FG!"(gi0.gu6.Node15GiveAnswer5<3)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16287928263711230470
[2024-05-20 19:58:14] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16287928263711230470
Running compilation step : cd /tmp/ltsmin16287928263711230470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16287928263711230470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16287928263711230470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-11 finished in 238725 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G((F(p1)&&F(G(p2))))))))'
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1012 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2024-05-20 19:58:21] [INFO ] Computed 62 invariants in 2203 ms
[2024-05-20 19:58:21] [INFO ] Implicit Places using invariants in 2973 ms returned []
Implicit Place search using SMT only with invariants took 2976 ms to find 0 implicit places.
[2024-05-20 19:58:21] [INFO ] Invariant cache hit.
[2024-05-20 19:58:22] [INFO ] Dead Transitions using invariants and state equation in 755 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4749 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 342 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GT s2442 s812), p2:(GT 1 s3630), p0:(OR (LEQ 1 s6952) (LEQ s2442 s812))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1744 steps with 0 reset in 21 ms.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-12 finished in 5188 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 7923 transition count 21542
Reduce places removed 418 places and 0 transitions.
Iterating post reduction 1 with 418 rules applied. Total rules applied 836 place count 7505 transition count 21542
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 836 place count 7505 transition count 21541
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 838 place count 7504 transition count 21541
Performed 3537 Post agglomeration using F-continuation condition.Transition count delta: 3537
Deduced a syphon composed of 3537 places in 8 ms
Reduce places removed 3537 places and 0 transitions.
Iterating global reduction 2 with 7074 rules applied. Total rules applied 7912 place count 3967 transition count 18004
Drop transitions removed 3420 transitions
Redundant transition composition rules discarded 3420 transitions
Iterating global reduction 2 with 3420 rules applied. Total rules applied 11332 place count 3967 transition count 14584
Applied a total of 11332 rules in 3748 ms. Remains 3967 /7923 variables (removed 3956) and now considering 14584/21960 (removed 7376) transitions.
// Phase 1: matrix 14584 rows 3967 cols
[2024-05-20 19:58:27] [INFO ] Computed 62 invariants in 941 ms
[2024-05-20 19:58:28] [INFO ] Implicit Places using invariants in 2168 ms returned []
Implicit Place search using SMT only with invariants took 2169 ms to find 0 implicit places.
[2024-05-20 19:58:28] [INFO ] Invariant cache hit.
[2024-05-20 19:58:35] [INFO ] Dead Transitions using invariants and state equation in 7018 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3967/7923 places, 14584/21960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12940 ms. Remains : 3967/7923 places, 14584/21960 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s2495 s2847), p0:(LEQ s342 s1812)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 326 reset in 1829 ms.
Product exploration explored 100000 steps with 326 reset in 1906 ms.
Computed a total of 180 stabilizing places and 299 stable transitions
Computed a total of 180 stabilizing places and 299 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 32 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 19:58:40] [INFO ] Invariant cache hit.
[2024-05-20 19:58:40] [INFO ] After 419ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:58:41] [INFO ] [Nat]Absence check using 60 positive place invariants in 37 ms returned sat
[2024-05-20 19:58:41] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 49 ms returned sat
[2024-05-20 19:58:49] [INFO ] After 8505ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 19:58:49] [INFO ] State equation strengthened by 10735 read => feed constraints.
[2024-05-20 19:58:53] [INFO ] After 3962ms SMT Verify possible using 10735 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 19:58:54] [INFO ] After 4542ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 501 ms.
[2024-05-20 19:58:54] [INFO ] After 14146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 3967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14584/14584 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3967 transition count 14583
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3966 transition count 14583
Partial Free-agglomeration rule applied 3661 times.
Drop transitions removed 3661 transitions
Iterating global reduction 1 with 3661 rules applied. Total rules applied 3663 place count 3966 transition count 14583
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 1 with 60 rules applied. Total rules applied 3723 place count 3966 transition count 14583
Applied a total of 3723 rules in 2866 ms. Remains 3966 /3967 variables (removed 1) and now considering 14583/14584 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2866 ms. Remains : 3966/3967 places, 14583/14584 transitions.
Finished random walk after 5913 steps, including 21 resets, run visited all 1 properties in 115 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 139 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 3967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3967/3967 places, 14584/14584 transitions.
Applied a total of 0 rules in 629 ms. Remains 3967 /3967 variables (removed 0) and now considering 14584/14584 (removed 0) transitions.
[2024-05-20 19:58:58] [INFO ] Invariant cache hit.
[2024-05-20 19:59:00] [INFO ] Implicit Places using invariants in 1281 ms returned []
Implicit Place search using SMT only with invariants took 1288 ms to find 0 implicit places.
[2024-05-20 19:59:00] [INFO ] Invariant cache hit.
[2024-05-20 19:59:07] [INFO ] Dead Transitions using invariants and state equation in 6973 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8895 ms. Remains : 3967/3967 places, 14584/14584 transitions.
Computed a total of 180 stabilizing places and 299 stable transitions
Computed a total of 180 stabilizing places and 299 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 19:59:07] [INFO ] Invariant cache hit.
[2024-05-20 19:59:07] [INFO ] After 416ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:59:08] [INFO ] [Nat]Absence check using 60 positive place invariants in 37 ms returned sat
[2024-05-20 19:59:08] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 49 ms returned sat
[2024-05-20 19:59:17] [INFO ] After 9324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 19:59:17] [INFO ] State equation strengthened by 10735 read => feed constraints.
[2024-05-20 19:59:21] [INFO ] After 4111ms SMT Verify possible using 10735 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 19:59:22] [INFO ] After 4659ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 472 ms.
[2024-05-20 19:59:22] [INFO ] After 15073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 3967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3967/3967 places, 14584/14584 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3967 transition count 14583
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3966 transition count 14583
Partial Free-agglomeration rule applied 3661 times.
Drop transitions removed 3661 transitions
Iterating global reduction 1 with 3661 rules applied. Total rules applied 3663 place count 3966 transition count 14583
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 1 with 60 rules applied. Total rules applied 3723 place count 3966 transition count 14583
Applied a total of 3723 rules in 2878 ms. Remains 3966 /3967 variables (removed 1) and now considering 14583/14584 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2879 ms. Remains : 3966/3967 places, 14583/14584 transitions.
Incomplete random walk after 10000 steps, including 35 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 62649 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62649 steps, saw 31109 distinct states, run finished after 3002 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 14583 rows 3966 cols
[2024-05-20 19:59:29] [INFO ] Computed 62 invariants in 549 ms
[2024-05-20 19:59:30] [INFO ] After 422ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:59:30] [INFO ] [Nat]Absence check using 60 positive place invariants in 38 ms returned sat
[2024-05-20 19:59:30] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 48 ms returned sat
[2024-05-20 19:59:40] [INFO ] After 10158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 19:59:40] [INFO ] State equation strengthened by 14334 read => feed constraints.
[2024-05-20 19:59:49] [INFO ] After 8576ms SMT Verify possible using 14334 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 19:59:50] [INFO ] After 9578ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1123 ms.
[2024-05-20 19:59:51] [INFO ] After 21499ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 3966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3966/3966 places, 14583/14583 transitions.
Applied a total of 0 rules in 761 ms. Remains 3966 /3966 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 761 ms. Remains : 3966/3966 places, 14583/14583 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3966/3966 places, 14583/14583 transitions.
Applied a total of 0 rules in 755 ms. Remains 3966 /3966 variables (removed 0) and now considering 14583/14583 (removed 0) transitions.
[2024-05-20 19:59:53] [INFO ] Invariant cache hit.
[2024-05-20 19:59:56] [INFO ] Implicit Places using invariants in 3203 ms returned []
Implicit Place search using SMT only with invariants took 3204 ms to find 0 implicit places.
[2024-05-20 19:59:56] [INFO ] Invariant cache hit.
[2024-05-20 20:00:02] [INFO ] Dead Transitions using invariants and state equation in 6592 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10556 ms. Remains : 3966/3966 places, 14583/14583 transitions.
Graph (trivial) has 14152 edges and 3966 vertex of which 3657 / 3966 are part of one of the 2 SCC in 3 ms
Free SCC test removed 3655 places
Drop transitions removed 10439 transitions
Ensure Unique test removed 3648 transitions
Reduce isomorphic transitions removed 14087 transitions.
Graph (complete) has 860 edges and 311 vertex of which 131 are kept as prefixes of interest. Removing 180 places using SCC suffix rule.0 ms
Discarding 180 places :
Also discarding 58 output transitions
Drop transitions removed 58 transitions
Drop transitions removed 180 transitions
Reduce isomorphic transitions removed 180 transitions.
Iterating post reduction 0 with 180 rules applied. Total rules applied 182 place count 131 transition count 258
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 182 place count 131 transition count 257
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 184 place count 130 transition count 257
Discarding 115 places :
Symmetric choice reduction at 1 with 115 rule applications. Total rules 299 place count 15 transition count 85
Iterating global reduction 1 with 115 rules applied. Total rules applied 414 place count 15 transition count 85
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 471 place count 15 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 473 place count 14 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 475 place count 13 transition count 26
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 477 place count 13 transition count 24
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 478 place count 13 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 479 place count 12 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 480 place count 11 transition count 22
Applied a total of 480 rules in 42 ms. Remains 11 /3966 variables (removed 3955) and now considering 22/14583 (removed 14561) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 22 rows 11 cols
[2024-05-20 20:00:02] [INFO ] Computed 1 invariants in 0 ms
[2024-05-20 20:00:02] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:00:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 20:00:02] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 20:00:02] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-20 20:00:02] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 328 reset in 1653 ms.
Product exploration explored 100000 steps with 327 reset in 1680 ms.
Built C files in :
/tmp/ltsmin10375553467386667561
[2024-05-20 20:00:06] [INFO ] Too many transitions (14584) to apply POR reductions. Disabling POR matrices.
[2024-05-20 20:00:06] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10375553467386667561
Running compilation step : cd /tmp/ltsmin10375553467386667561;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10375553467386667561;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10375553467386667561;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 3967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3967/3967 places, 14584/14584 transitions.
Applied a total of 0 rules in 840 ms. Remains 3967 /3967 variables (removed 0) and now considering 14584/14584 (removed 0) transitions.
// Phase 1: matrix 14584 rows 3967 cols
[2024-05-20 20:00:11] [INFO ] Computed 62 invariants in 997 ms
[2024-05-20 20:00:12] [INFO ] Implicit Places using invariants in 2237 ms returned []
Implicit Place search using SMT only with invariants took 2238 ms to find 0 implicit places.
[2024-05-20 20:00:12] [INFO ] Invariant cache hit.
[2024-05-20 20:00:20] [INFO ] Dead Transitions using invariants and state equation in 7259 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10340 ms. Remains : 3967/3967 places, 14584/14584 transitions.
Built C files in :
/tmp/ltsmin2645963326163202685
[2024-05-20 20:00:20] [INFO ] Too many transitions (14584) to apply POR reductions. Disabling POR matrices.
[2024-05-20 20:00:20] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2645963326163202685
Running compilation step : cd /tmp/ltsmin2645963326163202685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2645963326163202685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2645963326163202685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 20:00:23] [INFO ] Flatten gal took : 275 ms
[2024-05-20 20:00:24] [INFO ] Flatten gal took : 287 ms
[2024-05-20 20:00:24] [INFO ] Time to serialize gal into /tmp/LTL8682060735350110882.gal : 51 ms
[2024-05-20 20:00:24] [INFO ] Time to serialize properties into /tmp/LTL15970102174794879059.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8682060735350110882.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17120308267405666301.hoa' '-atoms' '/tmp/LTL15970102174794879059.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15970102174794879059.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17120308267405666301.hoa
Detected timeout of ITS tools.
[2024-05-20 20:00:39] [INFO ] Flatten gal took : 283 ms
[2024-05-20 20:00:39] [INFO ] Flatten gal took : 284 ms
[2024-05-20 20:00:39] [INFO ] Time to serialize gal into /tmp/LTL4407900936533038816.gal : 48 ms
[2024-05-20 20:00:39] [INFO ] Time to serialize properties into /tmp/LTL6348029777123777073.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4407900936533038816.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6348029777123777073.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("(Node56JoinMsg<=Node24GiveAnswer6)")||(G("(Node35requestsent29<=Node41GiveAnswer20)"))))))
Formula 0 simplified : G(F!"(Node35requestsent29<=Node41GiveAnswer20)" & FG!"(Node56JoinMsg<=Node24GiveAnswer6)")
Detected timeout of ITS tools.
[2024-05-20 20:00:55] [INFO ] Flatten gal took : 283 ms
[2024-05-20 20:00:55] [INFO ] Applying decomposition
[2024-05-20 20:00:55] [INFO ] Flatten gal took : 297 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14550443927090123335.txt' '-o' '/tmp/graph14550443927090123335.bin' '-w' '/tmp/graph14550443927090123335.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14550443927090123335.bin' '-l' '-1' '-v' '-w' '/tmp/graph14550443927090123335.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:00:56] [INFO ] Decomposing Gal with order
[2024-05-20 20:00:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:00:57] [INFO ] Removed a total of 10807 redundant transitions.
[2024-05-20 20:00:57] [INFO ] Flatten gal took : 1213 ms
[2024-05-20 20:00:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 7083 labels/synchronizations in 980 ms.
[2024-05-20 20:00:59] [INFO ] Time to serialize gal into /tmp/LTL7407454780457177430.gal : 57 ms
[2024-05-20 20:00:59] [INFO ] Time to serialize properties into /tmp/LTL3996595945598970498.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7407454780457177430.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3996595945598970498.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("(gu59.Node56JoinMsg<=gu59.Node24GiveAnswer6)")||(G("(gu63.Node35requestsent29<=gu63.Node41GiveAnswer20)"))))))
Formula 0 simplified : G(F!"(gu63.Node35requestsent29<=gu63.Node41GiveAnswer20)" & FG!"(gu59.Node56JoinMsg<=gu59.Node24GiveAnswer6)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin473581368351481522
[2024-05-20 20:01:14] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin473581368351481522
Running compilation step : cd /tmp/ltsmin473581368351481522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin473581368351481522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin473581368351481522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-14 finished in 174663 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1159 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2024-05-20 20:01:21] [INFO ] Computed 62 invariants in 2348 ms
[2024-05-20 20:01:22] [INFO ] Implicit Places using invariants in 3724 ms returned []
Implicit Place search using SMT only with invariants took 3725 ms to find 0 implicit places.
[2024-05-20 20:01:22] [INFO ] Invariant cache hit.
[2024-05-20 20:01:23] [INFO ] Dead Transitions using invariants and state equation in 710 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5594 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s3587 s4074)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-15 finished in 5742 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&G(F(((p1&&X(p2))||G(p2))))) U p3))'
Found a Shortening insensitive property : CANInsertWithFailure-PT-060-LTLCardinality-03
Stuttering acceptance computed with spot in 161 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
Support contains 5 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3538 Post agglomeration using F-continuation condition.Transition count delta: 3538
Deduced a syphon composed of 3538 places in 5 ms
Reduce places removed 3538 places and 0 transitions.
Iterating global reduction 2 with 7076 rules applied. Total rules applied 7916 place count 3965 transition count 18002
Drop transitions removed 3420 transitions
Redundant transition composition rules discarded 3420 transitions
Iterating global reduction 2 with 3420 rules applied. Total rules applied 11336 place count 3965 transition count 14582
Applied a total of 11336 rules in 3978 ms. Remains 3965 /7923 variables (removed 3958) and now considering 14582/21960 (removed 7378) transitions.
// Phase 1: matrix 14582 rows 3965 cols
[2024-05-20 20:01:28] [INFO ] Computed 62 invariants in 939 ms
[2024-05-20 20:01:29] [INFO ] Implicit Places using invariants in 2141 ms returned []
Implicit Place search using SMT only with invariants took 2142 ms to find 0 implicit places.
[2024-05-20 20:01:29] [INFO ] Invariant cache hit.
[2024-05-20 20:01:36] [INFO ] Dead Transitions using invariants and state equation in 6853 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3965/7923 places, 14582/21960 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 12981 ms. Remains : 3965/7923 places, 14582/21960 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(LEQ 1 s3306), p0:(LEQ s2815 s1574), p2:(GT 2 s1672), p1:(GT 2 s3751)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 328 reset in 1748 ms.
Product exploration explored 100000 steps with 329 reset in 1737 ms.
Computed a total of 183 stabilizing places and 300 stable transitions
Computed a total of 183 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND (NOT p3) p0 p2 p1), (X (AND p2 p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), true, (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 135 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-20 20:01:41] [INFO ] Invariant cache hit.
[2024-05-20 20:01:41] [INFO ] After 683ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-20 20:01:42] [INFO ] [Nat]Absence check using 60 positive place invariants in 38 ms returned sat
[2024-05-20 20:01:42] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 49 ms returned sat
[2024-05-20 20:01:51] [INFO ] After 8438ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-20 20:01:51] [INFO ] State equation strengthened by 10736 read => feed constraints.
[2024-05-20 20:01:59] [INFO ] After 8423ms SMT Verify possible using 10736 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-20 20:02:05] [INFO ] After 14383ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1018 ms.
[2024-05-20 20:02:06] [INFO ] After 25052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 1 properties in 69 ms.
Support contains 5 out of 3965 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3965/3965 places, 14582/14582 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3965 transition count 14581
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3964 transition count 14581
Partial Free-agglomeration rule applied 3658 times.
Drop transitions removed 3658 transitions
Iterating global reduction 1 with 3658 rules applied. Total rules applied 3660 place count 3964 transition count 14581
Applied a total of 3660 rules in 2653 ms. Remains 3964 /3965 variables (removed 1) and now considering 14581/14582 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2653 ms. Remains : 3964/3965 places, 14581/14582 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 444 ms. (steps per millisecond=22 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 54771 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 54771 steps, saw 29580 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 14581 rows 3964 cols
[2024-05-20 20:02:13] [INFO ] Computed 62 invariants in 596 ms
[2024-05-20 20:02:14] [INFO ] [Real]Absence check using 60 positive place invariants in 36 ms returned sat
[2024-05-20 20:02:14] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 48 ms returned sat
[2024-05-20 20:02:21] [INFO ] After 7617ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 20:02:22] [INFO ] [Nat]Absence check using 60 positive place invariants in 37 ms returned sat
[2024-05-20 20:02:22] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 48 ms returned sat
[2024-05-20 20:02:30] [INFO ] After 8011ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 20:02:30] [INFO ] State equation strengthened by 14393 read => feed constraints.
[2024-05-20 20:02:36] [INFO ] After 5998ms SMT Verify possible using 14393 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 20:02:40] [INFO ] After 10409ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2825 ms.
[2024-05-20 20:02:43] [INFO ] After 22366ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 51 ms.
Support contains 5 out of 3964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14581/14581 transitions.
Applied a total of 0 rules in 885 ms. Remains 3964 /3964 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 885 ms. Remains : 3964/3964 places, 14581/14581 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14581/14581 transitions.
Applied a total of 0 rules in 884 ms. Remains 3964 /3964 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
[2024-05-20 20:02:45] [INFO ] Invariant cache hit.
[2024-05-20 20:02:48] [INFO ] Implicit Places using invariants in 3279 ms returned []
Implicit Place search using SMT only with invariants took 3280 ms to find 0 implicit places.
[2024-05-20 20:02:48] [INFO ] Invariant cache hit.
[2024-05-20 20:02:56] [INFO ] Dead Transitions using invariants and state equation in 7145 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11311 ms. Remains : 3964/3964 places, 14581/14581 transitions.
Graph (trivial) has 14202 edges and 3964 vertex of which 3716 / 3964 are part of one of the 2 SCC in 3 ms
Free SCC test removed 3714 places
Drop transitions removed 10668 transitions
Ensure Unique test removed 3652 transitions
Reduce isomorphic transitions removed 14320 transitions.
Graph (complete) has 623 edges and 250 vertex of which 69 are kept as prefixes of interest. Removing 181 places using SCC suffix rule.0 ms
Discarding 181 places :
Also discarding 59 output transitions
Drop transitions removed 59 transitions
Drop transitions removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 122 rules applied. Total rules applied 124 place count 69 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 125 place count 68 transition count 80
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 183 place count 10 transition count 22
Iterating global reduction 2 with 58 rules applied. Total rules applied 241 place count 10 transition count 22
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 243 place count 10 transition count 20
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 244 place count 10 transition count 19
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 246 place count 9 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 247 place count 8 transition count 17
Applied a total of 247 rules in 30 ms. Remains 8 /3964 variables (removed 3956) and now considering 17/14581 (removed 14564) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 17 rows 8 cols
[2024-05-20 20:02:56] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 20:02:56] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 20:02:56] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 20:02:56] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-20 20:02:56] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND (NOT p3) p0 p2 p1), (X (AND p2 p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), true, (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p3)))), (F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 18 factoid took 173 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 178 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
// Phase 1: matrix 14582 rows 3965 cols
[2024-05-20 20:02:57] [INFO ] Computed 62 invariants in 987 ms
Proved EG (NOT p3)
Knowledge obtained : [(AND (NOT p3) p0 p2 p1), (X (AND p2 p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), true, (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p3)))), (F (AND (NOT p0) (NOT p3))), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p3))
Knowledge based reduction with 18 factoid took 248 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-03 finished in 104138 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U (!p0&&F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Found a Shortening insensitive property : CANInsertWithFailure-PT-060-LTLCardinality-10
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3540 Post agglomeration using F-continuation condition.Transition count delta: 3540
Deduced a syphon composed of 3540 places in 10 ms
Reduce places removed 3540 places and 0 transitions.
Iterating global reduction 2 with 7080 rules applied. Total rules applied 7920 place count 3963 transition count 18000
Drop transitions removed 3422 transitions
Redundant transition composition rules discarded 3422 transitions
Iterating global reduction 2 with 3422 rules applied. Total rules applied 11342 place count 3963 transition count 14578
Applied a total of 11342 rules in 3732 ms. Remains 3963 /7923 variables (removed 3960) and now considering 14578/21960 (removed 7382) transitions.
// Phase 1: matrix 14578 rows 3963 cols
[2024-05-20 20:03:12] [INFO ] Computed 62 invariants in 1000 ms
[2024-05-20 20:03:13] [INFO ] Implicit Places using invariants in 2245 ms returned []
Implicit Place search using SMT only with invariants took 2245 ms to find 0 implicit places.
[2024-05-20 20:03:13] [INFO ] Invariant cache hit.
[2024-05-20 20:03:21] [INFO ] Dead Transitions using invariants and state equation in 7072 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3963/7923 places, 14578/21960 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 13052 ms. Remains : 3963/7923 places, 14578/21960 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LEQ s870 s2003), p0:(LEQ 1 s2750)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 330 reset in 1688 ms.
Product exploration explored 100000 steps with 335 reset in 1763 ms.
Computed a total of 183 stabilizing places and 300 stable transitions
Computed a total of 183 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-20 20:03:25] [INFO ] Invariant cache hit.
[2024-05-20 20:03:25] [INFO ] After 470ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 20:03:26] [INFO ] [Nat]Absence check using 60 positive place invariants in 38 ms returned sat
[2024-05-20 20:03:26] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 49 ms returned sat
[2024-05-20 20:03:32] [INFO ] After 6219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 20:03:32] [INFO ] State equation strengthened by 10738 read => feed constraints.
[2024-05-20 20:03:39] [INFO ] After 7412ms SMT Verify possible using 10738 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 20:03:41] [INFO ] After 8780ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 886 ms.
[2024-05-20 20:03:42] [INFO ] After 16590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14578/14578 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3963 transition count 14577
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3962 transition count 14577
Partial Free-agglomeration rule applied 3658 times.
Drop transitions removed 3658 transitions
Iterating global reduction 1 with 3658 rules applied. Total rules applied 3660 place count 3962 transition count 14577
Applied a total of 3660 rules in 2440 ms. Remains 3962 /3963 variables (removed 1) and now considering 14577/14578 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2440 ms. Remains : 3962/3963 places, 14577/14578 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 14577 rows 3962 cols
[2024-05-20 20:03:45] [INFO ] Computed 62 invariants in 599 ms
[2024-05-20 20:03:46] [INFO ] After 419ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:03:46] [INFO ] [Nat]Absence check using 60 positive place invariants in 40 ms returned sat
[2024-05-20 20:03:46] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 45 ms returned sat
[2024-05-20 20:03:53] [INFO ] After 7012ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 20:03:53] [INFO ] State equation strengthened by 14395 read => feed constraints.
[2024-05-20 20:03:56] [INFO ] After 3067ms SMT Verify possible using 14395 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:03:57] [INFO ] After 3717ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 374 ms.
[2024-05-20 20:03:57] [INFO ] After 11766ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14577/14577 transitions.
Applied a total of 0 rules in 825 ms. Remains 3962 /3962 variables (removed 0) and now considering 14577/14577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 825 ms. Remains : 3962/3962 places, 14577/14577 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 60229 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 60229 steps, saw 30415 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 20:04:01] [INFO ] Invariant cache hit.
[2024-05-20 20:04:02] [INFO ] After 382ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:04:02] [INFO ] [Nat]Absence check using 60 positive place invariants in 40 ms returned sat
[2024-05-20 20:04:02] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 50 ms returned sat
[2024-05-20 20:04:09] [INFO ] After 6306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 20:04:09] [INFO ] State equation strengthened by 14395 read => feed constraints.
[2024-05-20 20:04:12] [INFO ] After 3406ms SMT Verify possible using 14395 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:04:13] [INFO ] After 4059ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 458 ms.
[2024-05-20 20:04:13] [INFO ] After 11456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14577/14577 transitions.
Applied a total of 0 rules in 867 ms. Remains 3962 /3962 variables (removed 0) and now considering 14577/14577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 867 ms. Remains : 3962/3962 places, 14577/14577 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14577/14577 transitions.
Applied a total of 0 rules in 873 ms. Remains 3962 /3962 variables (removed 0) and now considering 14577/14577 (removed 0) transitions.
[2024-05-20 20:04:15] [INFO ] Invariant cache hit.
[2024-05-20 20:04:18] [INFO ] Implicit Places using invariants in 3366 ms returned []
Implicit Place search using SMT only with invariants took 3366 ms to find 0 implicit places.
[2024-05-20 20:04:18] [INFO ] Invariant cache hit.
[2024-05-20 20:04:25] [INFO ] Dead Transitions using invariants and state equation in 6647 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10888 ms. Remains : 3962/3962 places, 14577/14577 transitions.
Graph (trivial) has 14206 edges and 3962 vertex of which 3716 / 3962 are part of one of the 2 SCC in 2 ms
Free SCC test removed 3714 places
Drop transitions removed 10670 transitions
Ensure Unique test removed 3652 transitions
Reduce isomorphic transitions removed 14322 transitions.
Graph (complete) has 617 edges and 248 vertex of which 67 are kept as prefixes of interest. Removing 181 places using SCC suffix rule.0 ms
Discarding 181 places :
Also discarding 59 output transitions
Drop transitions removed 59 transitions
Drop transitions removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 122 rules applied. Total rules applied 124 place count 67 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 125 place count 66 transition count 74
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 183 place count 8 transition count 16
Iterating global reduction 2 with 58 rules applied. Total rules applied 241 place count 8 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 243 place count 8 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 244 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 246 place count 7 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 247 place count 6 transition count 11
Applied a total of 247 rules in 30 ms. Remains 6 /3962 variables (removed 3956) and now considering 11/14577 (removed 14566) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 6 cols
[2024-05-20 20:04:25] [INFO ] Computed 0 invariants in 1 ms
[2024-05-20 20:04:25] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:04:25] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 20:04:25] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-20 20:04:25] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 175 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 3 out of 3963 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3963/3963 places, 14578/14578 transitions.
Applied a total of 0 rules in 720 ms. Remains 3963 /3963 variables (removed 0) and now considering 14578/14578 (removed 0) transitions.
// Phase 1: matrix 14578 rows 3963 cols
[2024-05-20 20:04:27] [INFO ] Computed 62 invariants in 954 ms
[2024-05-20 20:04:29] [INFO ] Implicit Places using invariants in 2238 ms returned []
Implicit Place search using SMT only with invariants took 2239 ms to find 0 implicit places.
[2024-05-20 20:04:29] [INFO ] Invariant cache hit.
[2024-05-20 20:04:35] [INFO ] Dead Transitions using invariants and state equation in 6937 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9899 ms. Remains : 3963/3963 places, 14578/14578 transitions.
Computed a total of 183 stabilizing places and 300 stable transitions
Computed a total of 183 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 94 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-20 20:04:36] [INFO ] Invariant cache hit.
[2024-05-20 20:04:37] [INFO ] After 458ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 20:04:37] [INFO ] [Nat]Absence check using 60 positive place invariants in 38 ms returned sat
[2024-05-20 20:04:37] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 49 ms returned sat
[2024-05-20 20:04:44] [INFO ] After 6281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 20:04:44] [INFO ] State equation strengthened by 10738 read => feed constraints.
[2024-05-20 20:04:51] [INFO ] After 7162ms SMT Verify possible using 10738 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 20:04:52] [INFO ] After 8465ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 824 ms.
[2024-05-20 20:04:53] [INFO ] After 16269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14578/14578 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3963 transition count 14577
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3962 transition count 14577
Partial Free-agglomeration rule applied 3658 times.
Drop transitions removed 3658 transitions
Iterating global reduction 1 with 3658 rules applied. Total rules applied 3660 place count 3962 transition count 14577
Applied a total of 3660 rules in 2427 ms. Remains 3962 /3963 variables (removed 1) and now considering 14577/14578 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2427 ms. Remains : 3962/3963 places, 14577/14578 transitions.
Incomplete random walk after 10000 steps, including 37 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 14577 rows 3962 cols
[2024-05-20 20:04:56] [INFO ] Computed 62 invariants in 596 ms
[2024-05-20 20:04:57] [INFO ] After 413ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:04:57] [INFO ] [Nat]Absence check using 60 positive place invariants in 39 ms returned sat
[2024-05-20 20:04:57] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 49 ms returned sat
[2024-05-20 20:05:04] [INFO ] After 7040ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 20:05:04] [INFO ] State equation strengthened by 14395 read => feed constraints.
[2024-05-20 20:05:07] [INFO ] After 3096ms SMT Verify possible using 14395 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:05:08] [INFO ] After 3773ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 388 ms.
[2024-05-20 20:05:08] [INFO ] After 11848ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14577/14577 transitions.
Applied a total of 0 rules in 827 ms. Remains 3962 /3962 variables (removed 0) and now considering 14577/14577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 827 ms. Remains : 3962/3962 places, 14577/14577 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 61192 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61192 steps, saw 30532 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 20:05:13] [INFO ] Invariant cache hit.
[2024-05-20 20:05:13] [INFO ] After 398ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:05:13] [INFO ] [Nat]Absence check using 60 positive place invariants in 38 ms returned sat
[2024-05-20 20:05:13] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 49 ms returned sat
[2024-05-20 20:05:19] [INFO ] After 6022ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 20:05:20] [INFO ] State equation strengthened by 14395 read => feed constraints.
[2024-05-20 20:05:23] [INFO ] After 3383ms SMT Verify possible using 14395 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:05:24] [INFO ] After 4004ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 425 ms.
[2024-05-20 20:05:24] [INFO ] After 11101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14577/14577 transitions.
Applied a total of 0 rules in 855 ms. Remains 3962 /3962 variables (removed 0) and now considering 14577/14577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 855 ms. Remains : 3962/3962 places, 14577/14577 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14577/14577 transitions.
Applied a total of 0 rules in 893 ms. Remains 3962 /3962 variables (removed 0) and now considering 14577/14577 (removed 0) transitions.
[2024-05-20 20:05:26] [INFO ] Invariant cache hit.
[2024-05-20 20:05:29] [INFO ] Implicit Places using invariants in 3281 ms returned []
Implicit Place search using SMT only with invariants took 3282 ms to find 0 implicit places.
[2024-05-20 20:05:29] [INFO ] Invariant cache hit.
[2024-05-20 20:05:36] [INFO ] Dead Transitions using invariants and state equation in 7046 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11226 ms. Remains : 3962/3962 places, 14577/14577 transitions.
Graph (trivial) has 14206 edges and 3962 vertex of which 3716 / 3962 are part of one of the 2 SCC in 3 ms
Free SCC test removed 3714 places
Drop transitions removed 10670 transitions
Ensure Unique test removed 3652 transitions
Reduce isomorphic transitions removed 14322 transitions.
Graph (complete) has 617 edges and 248 vertex of which 67 are kept as prefixes of interest. Removing 181 places using SCC suffix rule.0 ms
Discarding 181 places :
Also discarding 59 output transitions
Drop transitions removed 59 transitions
Drop transitions removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 122 rules applied. Total rules applied 124 place count 67 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 125 place count 66 transition count 74
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 183 place count 8 transition count 16
Iterating global reduction 2 with 58 rules applied. Total rules applied 241 place count 8 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 243 place count 8 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 244 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 246 place count 7 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 247 place count 6 transition count 11
Applied a total of 247 rules in 30 ms. Remains 6 /3962 variables (removed 3956) and now considering 11/14577 (removed 14566) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 6 cols
[2024-05-20 20:05:36] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 20:05:36] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:05:36] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 20:05:36] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-20 20:05:36] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 188 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 338 reset in 1673 ms.
Product exploration explored 100000 steps with 332 reset in 1750 ms.
Built C files in :
/tmp/ltsmin6976224330190679957
[2024-05-20 20:05:40] [INFO ] Too many transitions (14578) to apply POR reductions. Disabling POR matrices.
[2024-05-20 20:05:40] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6976224330190679957
Running compilation step : cd /tmp/ltsmin6976224330190679957;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin6976224330190679957;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin6976224330190679957;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 3963 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3963/3963 places, 14578/14578 transitions.
Applied a total of 0 rules in 769 ms. Remains 3963 /3963 variables (removed 0) and now considering 14578/14578 (removed 0) transitions.
// Phase 1: matrix 14578 rows 3963 cols
[2024-05-20 20:05:45] [INFO ] Computed 62 invariants in 962 ms
[2024-05-20 20:05:46] [INFO ] Implicit Places using invariants in 2169 ms returned []
Implicit Place search using SMT only with invariants took 2170 ms to find 0 implicit places.
[2024-05-20 20:05:46] [INFO ] Invariant cache hit.
[2024-05-20 20:05:53] [INFO ] Dead Transitions using invariants and state equation in 7057 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9998 ms. Remains : 3963/3963 places, 14578/14578 transitions.
Built C files in :
/tmp/ltsmin9435225662850798248
[2024-05-20 20:05:53] [INFO ] Too many transitions (14578) to apply POR reductions. Disabling POR matrices.
[2024-05-20 20:05:54] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9435225662850798248
Running compilation step : cd /tmp/ltsmin9435225662850798248;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin9435225662850798248;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin9435225662850798248;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 20:05:57] [INFO ] Flatten gal took : 276 ms
[2024-05-20 20:05:57] [INFO ] Flatten gal took : 294 ms
[2024-05-20 20:05:57] [INFO ] Time to serialize gal into /tmp/LTL14558216773974531773.gal : 51 ms
[2024-05-20 20:05:57] [INFO ] Time to serialize properties into /tmp/LTL12903908466096929604.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14558216773974531773.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14969457253085435260.hoa' '-atoms' '/tmp/LTL12903908466096929604.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12903908466096929604.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14969457253085435260.hoa
Detected timeout of ITS tools.
[2024-05-20 20:06:13] [INFO ] Flatten gal took : 276 ms
[2024-05-20 20:06:13] [INFO ] Flatten gal took : 287 ms
[2024-05-20 20:06:13] [INFO ] Time to serialize gal into /tmp/LTL18284461663469321498.gal : 61 ms
[2024-05-20 20:06:13] [INFO ] Time to serialize properties into /tmp/LTL4504518938587389970.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18284461663469321498.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4504518938587389970.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(("(Node39requestsent48>=1)")||(G("(Node8requestsent28<=Node27requestsent20)"))))))
Formula 0 simplified : XG(!"(Node39requestsent48>=1)" & F!"(Node8requestsent28<=Node27requestsent20)")
Detected timeout of ITS tools.
[2024-05-20 20:06:29] [INFO ] Flatten gal took : 261 ms
[2024-05-20 20:06:29] [INFO ] Applying decomposition
[2024-05-20 20:06:29] [INFO ] Flatten gal took : 273 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5432565480509529514.txt' '-o' '/tmp/graph5432565480509529514.bin' '-w' '/tmp/graph5432565480509529514.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5432565480509529514.bin' '-l' '-1' '-v' '-w' '/tmp/graph5432565480509529514.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:06:30] [INFO ] Decomposing Gal with order
[2024-05-20 20:06:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:06:31] [INFO ] Removed a total of 10822 redundant transitions.
[2024-05-20 20:06:31] [INFO ] Flatten gal took : 1225 ms
[2024-05-20 20:06:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 7080 labels/synchronizations in 1020 ms.
[2024-05-20 20:06:33] [INFO ] Time to serialize gal into /tmp/LTL15348503088294775057.gal : 56 ms
[2024-05-20 20:06:33] [INFO ] Time to serialize properties into /tmp/LTL14919986275172297129.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15348503088294775057.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14919986275172297129.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F(("(gi0.gu40.Node39requestsent48>=1)")||(G("(gu62.Node8requestsent28<=gu62.Node27requestsent20)"))))))
Formula 0 simplified : XG(!"(gi0.gu40.Node39requestsent48>=1)" & F!"(gu62.Node8requestsent28<=gu62.Node27requestsent20)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin105861654051999888
[2024-05-20 20:06:48] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin105861654051999888
Running compilation step : cd /tmp/ltsmin105861654051999888;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin105861654051999888;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin105861654051999888;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-10 finished in 223745 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F((p1||G(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
[2024-05-20 20:06:52] [INFO ] Flatten gal took : 406 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6434680300619083866
[2024-05-20 20:06:52] [INFO ] Too many transitions (21960) to apply POR reductions. Disabling POR matrices.
[2024-05-20 20:06:52] [INFO ] Built C files in 147ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6434680300619083866
Running compilation step : cd /tmp/ltsmin6434680300619083866;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-20 20:06:52] [INFO ] Applying decomposition
[2024-05-20 20:06:52] [INFO ] Flatten gal took : 458 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph520890362477905239.txt' '-o' '/tmp/graph520890362477905239.bin' '-w' '/tmp/graph520890362477905239.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph520890362477905239.bin' '-l' '-1' '-v' '-w' '/tmp/graph520890362477905239.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:06:53] [INFO ] Decomposing Gal with order
[2024-05-20 20:06:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:06:55] [INFO ] Removed a total of 10851 redundant transitions.
[2024-05-20 20:06:55] [INFO ] Flatten gal took : 1340 ms
[2024-05-20 20:06:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 6954 labels/synchronizations in 1020 ms.
[2024-05-20 20:06:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality8762267467288985046.gal : 78 ms
[2024-05-20 20:06:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality16032807748779398887.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8762267467288985046.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16032807748779398887.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 6 LTL properties
Checking formula 0 : !(((("(gu242.Node40requestsent52<=gu242.Node20requestsent11)")&&(G(F((("(gi0.gi14.gu224.Node56requestsent26<2)")&&(X("(gi0.gi14.gu196....272
Formula 0 simplified : (!"(gu242.Node40requestsent52<=gu242.Node20requestsent11)" | G(F!"(gi0.gi14.gu196.Node21GiveAnswer49<2)" & FG(!"(gi0.gi14.gu224.Node...262
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/ltsmin6434680300619083866;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 120 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6434680300619083866;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 120 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
ITS-tools command line returned an error code 137
[2024-05-20 20:21:43] [INFO ] Flatten gal took : 533 ms
[2024-05-20 20:21:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality6146055135629405910.gal : 94 ms
[2024-05-20 20:21:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality6507622068922860127.ltl : 12 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6146055135629405910.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6507622068922860127.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 6 LTL properties
Checking formula 0 : !(((("(Node40requestsent52<=Node20requestsent11)")&&(G(F((("(Node56requestsent26<2)")&&(X("(Node21GiveAnswer49<2)")))||(G("(Node21Give...202
Formula 0 simplified : (!"(Node40requestsent52<=Node20requestsent11)" | G(F!"(Node21GiveAnswer49<2)" & FG(!"(Node56requestsent26<2)" | X!"(Node21GiveAnswer...192
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 297624 kB
After kill :
MemTotal: 16393216 kB
MemFree: 14600600 kB

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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-060"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is CANInsertWithFailure-PT-060, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r087-tall-171620521500087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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