Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690800779.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is CANInsertWithFailure-PT-100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690800779
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 61M
-rw-r--r-- 1 mcc users 8.8K Feb 26 00:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 00:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 00:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 00:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 00:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 00:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 00:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 00:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 60M Mar 5 18:22 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-100-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678384120185

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-100
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-09 17:48:42] [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]
[2023-03-09 17:48:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 17:48:43] [INFO ] Load time of PNML (sax parser for PT used): 1148 ms
[2023-03-09 17:48:43] [INFO ] Transformed 21204 places.
[2023-03-09 17:48:43] [INFO ] Transformed 60600 transitions.
[2023-03-09 17:48:43] [INFO ] Parsed PT model containing 21204 places and 60600 transitions and 162000 arcs in 1392 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 21204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21204/21204 places, 60600/60600 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21203 transition count 60600
Applied a total of 1 rules in 4575 ms. Remains 21203 /21204 variables (removed 1) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-09 17:49:13] [INFO ] Computed 102 place invariants in 24848 ms
[2023-03-09 17:49:15] [INFO ] Implicit Places using invariants in 26682 ms returned []
Implicit Place search using SMT only with invariants took 26716 ms to find 0 implicit places.
[2023-03-09 17:49:15] [INFO ] Invariant cache hit.
[2023-03-09 17:49:17] [INFO ] Dead Transitions using invariants and state equation in 2016 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21203/21204 places, 60600/60600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33319 ms. Remains : 21203/21204 places, 60600/60600 transitions.
Support contains 52 out of 21203 places after structural reductions.
[2023-03-09 17:49:19] [INFO ] Flatten gal took : 1689 ms
[2023-03-09 17:49:21] [INFO ] Flatten gal took : 1544 ms
[2023-03-09 17:49:23] [INFO ] Input system was already deterministic with 60600 transitions.
Support contains 50 out of 21203 places (down from 52) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 861 ms. (steps per millisecond=11 ) properties (out of 33) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) 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 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) 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 30) 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 30) 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 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) 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 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Interrupted probabilistic random walk after 88542 steps, run timeout after 3002 ms. (steps per millisecond=29 ) properties seen :{28=1}
Probabilistic random walk after 88542 steps, saw 87371 distinct states, run finished after 3004 ms. (steps per millisecond=29 ) properties seen :1
Running SMT prover for 29 properties.
[2023-03-09 17:49:28] [INFO ] Invariant cache hit.
[2023-03-09 17:49:40] [INFO ] [Real]Absence check using 100 positive place invariants in 272 ms returned sat
[2023-03-09 17:49:40] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 632 ms returned sat
[2023-03-09 17:49:41] [INFO ] After 13618ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:28
[2023-03-09 17:49:53] [INFO ] [Nat]Absence check using 100 positive place invariants in 272 ms returned sat
[2023-03-09 17:49:54] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 627 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-09 17:50:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 17:50:06] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:28
Fused 29 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 39 out of 21203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 697 transitions
Trivial Post-agglo rules discarded 697 transitions
Performed 697 trivial Post agglomeration. Transition count delta: 697
Iterating post reduction 0 with 697 rules applied. Total rules applied 697 place count 21203 transition count 59903
Reduce places removed 697 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 698 rules applied. Total rules applied 1395 place count 20506 transition count 59902
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1396 place count 20505 transition count 59902
Performed 9883 Post agglomeration using F-continuation condition.Transition count delta: 9883
Deduced a syphon composed of 9883 places in 31 ms
Reduce places removed 9883 places and 0 transitions.
Iterating global reduction 3 with 19766 rules applied. Total rules applied 21162 place count 10622 transition count 50019
Partial Free-agglomeration rule applied 10178 times.
Drop transitions removed 10178 transitions
Iterating global reduction 3 with 10178 rules applied. Total rules applied 31340 place count 10622 transition count 50019
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 3 with 100 rules applied. Total rules applied 31440 place count 10622 transition count 50019
Applied a total of 31440 rules in 28869 ms. Remains 10622 /21203 variables (removed 10581) and now considering 50019/60600 (removed 10581) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28874 ms. Remains : 10622/21203 places, 50019/60600 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 918 ms. (steps per millisecond=10 ) properties (out of 26) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) 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 19) 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 19) seen :0
Running SMT prover for 19 properties.
[2023-03-09 17:50:36] [INFO ] Flow matrix only has 49999 transitions (discarded 20 similar events)
// Phase 1: matrix 49999 rows 10622 cols
[2023-03-09 17:50:47] [INFO ] Computed 102 place invariants in 10239 ms
[2023-03-09 17:50:51] [INFO ] [Real]Absence check using 100 positive place invariants in 150 ms returned sat
[2023-03-09 17:50:52] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 224 ms returned sat
[2023-03-09 17:50:52] [INFO ] After 5471ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-09 17:50:57] [INFO ] [Nat]Absence check using 100 positive place invariants in 147 ms returned sat
[2023-03-09 17:50:57] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 219 ms returned sat
[2023-03-09 17:51:17] [INFO ] After 16502ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-09 17:51:18] [INFO ] State equation strengthened by 49424 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:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-09 17:51:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 17:51:18] [INFO ] After 25506ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:19
Fused 19 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 25 out of 10622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10622/10622 places, 50019/50019 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 15 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 10615 transition count 50012
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 22 place count 10615 transition count 50012
Applied a total of 22 rules in 15070 ms. Remains 10615 /10622 variables (removed 7) and now considering 50012/50019 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15070 ms. Remains : 10615/10622 places, 50012/50019 transitions.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 402 stabilizing places and 700 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9899 Post agglomeration using F-continuation condition.Transition count delta: 9899
Deduced a syphon composed of 9899 places in 33 ms
Reduce places removed 9899 places and 0 transitions.
Iterating global reduction 2 with 19798 rules applied. Total rules applied 21198 place count 10604 transition count 50001
Applied a total of 21198 rules in 13995 ms. Remains 10604 /21203 variables (removed 10599) and now considering 50001/60600 (removed 10599) transitions.
[2023-03-09 17:51:47] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
// Phase 1: matrix 40300 rows 10604 cols
[2023-03-09 17:51:57] [INFO ] Computed 102 place invariants in 10015 ms
[2023-03-09 17:51:58] [INFO ] Implicit Places using invariants in 10976 ms returned []
Implicit Place search using SMT only with invariants took 10978 ms to find 0 implicit places.
[2023-03-09 17:51:58] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2023-03-09 17:51:58] [INFO ] Invariant cache hit.
[2023-03-09 17:51:59] [INFO ] Dead Transitions using invariants and state equation in 971 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10604/21203 places, 50001/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25950 ms. Remains : 10604/21203 places, 50001/60600 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s3764)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 198 reset in 4171 ms.
Product exploration explored 100000 steps with 199 reset in 4123 ms.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 134 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 35 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 20 resets, run finished after 498 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 71506 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71506 steps, saw 65406 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 17:52:12] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2023-03-09 17:52:12] [INFO ] Invariant cache hit.
[2023-03-09 17:52:13] [INFO ] [Real]Absence check using 100 positive place invariants in 141 ms returned sat
[2023-03-09 17:52:13] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 224 ms returned sat
[2023-03-09 17:52:37] [INFO ] After 25027ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 10604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10604 transition count 50000
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10603 transition count 50000
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 1 with 10101 rules applied. Total rules applied 10103 place count 10603 transition count 50000
Applied a total of 10103 rules in 13984 ms. Remains 10603 /10604 variables (removed 1) and now considering 50000/50001 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13985 ms. Remains : 10603/10604 places, 50000/50001 transitions.
Finished random walk after 820 steps, including 1 resets, run visited all 1 properties in 53 ms. (steps per millisecond=15 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 166 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 1 out of 10604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 6316 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2023-03-09 17:52:57] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2023-03-09 17:52:57] [INFO ] Invariant cache hit.
[2023-03-09 17:52:58] [INFO ] Implicit Places using invariants in 1014 ms returned []
Implicit Place search using SMT only with invariants took 1018 ms to find 0 implicit places.
[2023-03-09 17:52:58] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2023-03-09 17:52:58] [INFO ] Invariant cache hit.
[2023-03-09 17:52:59] [INFO ] Dead Transitions using invariants and state equation in 995 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8332 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 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 27 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 74028 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74028 steps, saw 65789 distinct states, run finished after 3003 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 17:53:03] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2023-03-09 17:53:03] [INFO ] Invariant cache hit.
[2023-03-09 17:53:05] [INFO ] [Real]Absence check using 100 positive place invariants in 148 ms returned sat
[2023-03-09 17:53:05] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 226 ms returned sat
[2023-03-09 17:53:28] [INFO ] After 25016ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 10604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10604 transition count 50000
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10603 transition count 50000
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 1 with 10101 rules applied. Total rules applied 10103 place count 10603 transition count 50000
Applied a total of 10103 rules in 13407 ms. Remains 10603 /10604 variables (removed 1) and now considering 50000/50001 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13408 ms. Remains : 10603/10604 places, 50000/50001 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 477 ms. (steps per millisecond=20 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 100283 steps, run timeout after 3002 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100283 steps, saw 93495 distinct states, run finished after 3003 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 50000 rows 10603 cols
[2023-03-09 17:53:53] [INFO ] Computed 102 place invariants in 8145 ms
[2023-03-09 17:53:55] [INFO ] [Real]Absence check using 100 positive place invariants in 147 ms returned sat
[2023-03-09 17:53:55] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 175 ms returned sat
[2023-03-09 17:54:18] [INFO ] After 25029ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 10603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10603/10603 places, 50000/50000 transitions.
Applied a total of 0 rules in 5098 ms. Remains 10603 /10603 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5098 ms. Remains : 10603/10603 places, 50000/50000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10603/10603 places, 50000/50000 transitions.
Applied a total of 0 rules in 4756 ms. Remains 10603 /10603 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
[2023-03-09 17:54:28] [INFO ] Invariant cache hit.
[2023-03-09 17:54:29] [INFO ] Implicit Places using invariants in 918 ms returned []
Implicit Place search using SMT only with invariants took 919 ms to find 0 implicit places.
[2023-03-09 17:54:29] [INFO ] Invariant cache hit.
[2023-03-09 17:54:30] [INFO ] Dead Transitions using invariants and state equation in 981 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6668 ms. Remains : 10603/10603 places, 50000/50000 transitions.
Graph (trivial) has 49397 edges and 10603 vertex of which 10199 / 10603 are part of one of the 2 SCC in 15 ms
Free SCC test removed 10197 places
Drop transitions removed 39499 transitions
Ensure Unique test removed 10092 transitions
Reduce isomorphic transitions removed 49591 transitions.
Graph (complete) has 1011 edges and 406 vertex of which 105 are kept as prefixes of interest. Removing 301 places using SCC suffix rule.1 ms
Discarding 301 places :
Also discarding 99 output transitions
Drop transitions removed 99 transitions
Drop transitions removed 201 transitions
Reduce isomorphic transitions removed 201 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 202 rules applied. Total rules applied 204 place count 105 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 205 place count 104 transition count 108
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 303 place count 6 transition count 10
Iterating global reduction 2 with 98 rules applied. Total rules applied 401 place count 6 transition count 10
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 403 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 404 place count 6 transition count 7
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 406 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 407 place count 4 transition count 5
Applied a total of 407 rules in 237 ms. Remains 4 /10603 variables (removed 10599) and now considering 5/50000 (removed 49995) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2023-03-09 17:54:31] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 17:54:31] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 17:54:31] [INFO ] After 8ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-09 17:54:31] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 172 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0)]
Product exploration explored 100000 steps with 199 reset in 5021 ms.
Product exploration explored 100000 steps with 199 reset in 4918 ms.
Built C files in :
/tmp/ltsmin1183212507638867318
[2023-03-09 17:54:41] [INFO ] Too many transitions (50001) to apply POR reductions. Disabling POR matrices.
[2023-03-09 17:54:41] [INFO ] Built C files in 544ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1183212507638867318
Running compilation step : cd /tmp/ltsmin1183212507638867318;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1183212507638867318;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1183212507638867318;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 10604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 6534 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2023-03-09 17:54:51] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
// Phase 1: matrix 40300 rows 10604 cols
[2023-03-09 17:55:01] [INFO ] Computed 102 place invariants in 9703 ms
[2023-03-09 17:55:02] [INFO ] Implicit Places using invariants in 10874 ms returned []
Implicit Place search using SMT only with invariants took 10875 ms to find 0 implicit places.
[2023-03-09 17:55:02] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2023-03-09 17:55:02] [INFO ] Invariant cache hit.
[2023-03-09 17:55:03] [INFO ] Dead Transitions using invariants and state equation in 1113 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18529 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Built C files in :
/tmp/ltsmin8153879376397281488
[2023-03-09 17:55:03] [INFO ] Too many transitions (50001) to apply POR reductions. Disabling POR matrices.
[2023-03-09 17:55:04] [INFO ] Built C files in 456ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8153879376397281488
Running compilation step : cd /tmp/ltsmin8153879376397281488;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8153879376397281488;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8153879376397281488;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-09 17:55:09] [INFO ] Flatten gal took : 948 ms
[2023-03-09 17:55:10] [INFO ] Flatten gal took : 710 ms
[2023-03-09 17:55:10] [INFO ] Time to serialize gal into /tmp/LTL14603615960920452613.gal : 192 ms
[2023-03-09 17:55:10] [INFO ] Time to serialize properties into /tmp/LTL12856408269631352023.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14603615960920452613.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3314074510272141702.hoa' '-atoms' '/tmp/LTL12856408269631352023.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12856408269631352023.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3314074510272141702.hoa
Detected timeout of ITS tools.
[2023-03-09 17:55:27] [INFO ] Flatten gal took : 1000 ms
[2023-03-09 17:55:28] [INFO ] Flatten gal took : 766 ms
[2023-03-09 17:55:28] [INFO ] Time to serialize gal into /tmp/LTL12282261296913592951.gal : 133 ms
[2023-03-09 17:55:28] [INFO ] Time to serialize properties into /tmp/LTL13157913297417989739.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12282261296913592951.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13157913297417989739.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(Node31GiveAnswer61<1)"))))
Formula 0 simplified : GF!"(Node31GiveAnswer61<1)"
Detected timeout of ITS tools.
[2023-03-09 17:55:44] [INFO ] Flatten gal took : 894 ms
[2023-03-09 17:55:44] [INFO ] Applying decomposition
[2023-03-09 17:55:45] [INFO ] Flatten gal took : 758 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3725240094324794035.txt' '-o' '/tmp/graph3725240094324794035.bin' '-w' '/tmp/graph3725240094324794035.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3725240094324794035.bin' '-l' '-1' '-v' '-w' '/tmp/graph3725240094324794035.weights' '-q' '0' '-e' '0.001'
[2023-03-09 17:55:47] [INFO ] Decomposing Gal with order
[2023-03-09 17:55:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 17:55:55] [INFO ] Removed a total of 39772 redundant transitions.
[2023-03-09 17:55:56] [INFO ] Flatten gal took : 6686 ms
[2023-03-09 17:56:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 29502 labels/synchronizations in 12481 ms.
[2023-03-09 17:56:09] [INFO ] Time to serialize gal into /tmp/LTL7281909839330195623.gal : 218 ms
[2023-03-09 17:56:09] [INFO ] Time to serialize properties into /tmp/LTL13013774703295779408.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7281909839330195623.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13013774703295779408.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(u62.Node31GiveAnswer61<1)"))))
Formula 0 simplified : GF!"(u62.Node31GiveAnswer61<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17801406355385797358
[2023-03-09 17:56:25] [INFO ] Built C files in 378ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17801406355385797358
Running compilation step : cd /tmp/ltsmin17801406355385797358;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin17801406355385797358;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin17801406355385797358;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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-100-LTLCardinality-01 finished in 294726 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G((F(p1)&&F(p2)))))))'
Support contains 4 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 4573 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-09 17:56:52] [INFO ] Computed 102 place invariants in 19240 ms
[2023-03-09 17:56:54] [INFO ] Implicit Places using invariants in 21112 ms returned []
Implicit Place search using SMT only with invariants took 21113 ms to find 0 implicit places.
[2023-03-09 17:56:54] [INFO ] Invariant cache hit.
[2023-03-09 17:56:55] [INFO ] Dead Transitions using invariants and state equation in 1762 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27452 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ 2 s20212), p1:(LEQ s5790 s6935), p2:(LEQ 3 s19191)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-02 finished in 27961 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 3 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9898 Post agglomeration using F-continuation condition.Transition count delta: 9898
Deduced a syphon composed of 9898 places in 25 ms
Reduce places removed 9898 places and 0 transitions.
Iterating global reduction 2 with 19796 rules applied. Total rules applied 21196 place count 10605 transition count 50002
Applied a total of 21196 rules in 13637 ms. Remains 10605 /21203 variables (removed 10598) and now considering 50002/60600 (removed 10598) transitions.
[2023-03-09 17:57:09] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
[2023-03-09 17:57:18] [INFO ] Computed 102 place invariants in 8535 ms
[2023-03-09 17:57:19] [INFO ] Implicit Places using invariants in 9515 ms returned []
Implicit Place search using SMT only with invariants took 9517 ms to find 0 implicit places.
[2023-03-09 17:57:19] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-09 17:57:19] [INFO ] Invariant cache hit.
[2023-03-09 17:57:20] [INFO ] Dead Transitions using invariants and state equation in 1005 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10605/21203 places, 50002/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24163 ms. Remains : 10605/21203 places, 50002/60600 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-03 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:(GT 3 s3501), p0:(GT s3925 s10165)], 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 198 reset in 3518 ms.
Product exploration explored 100000 steps with 197 reset in 3699 ms.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 203 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 19 resets, run finished after 516 ms. (steps per millisecond=19 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 70953 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70953 steps, saw 65310 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 17:57:31] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-09 17:57:32] [INFO ] Invariant cache hit.
[2023-03-09 17:57:33] [INFO ] [Real]Absence check using 100 positive place invariants in 151 ms returned sat
[2023-03-09 17:57:33] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 179 ms returned sat
[2023-03-09 17:57:33] [INFO ] After 1691ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 17:57:35] [INFO ] [Nat]Absence check using 100 positive place invariants in 150 ms returned sat
[2023-03-09 17:57:35] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 222 ms returned sat
[2023-03-09 17:57:58] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 10605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10605 transition count 50001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10604 transition count 50001
Partial Free-agglomeration rule applied 10100 times.
Drop transitions removed 10100 transitions
Iterating global reduction 1 with 10100 rules applied. Total rules applied 10102 place count 10604 transition count 50001
Applied a total of 10102 rules in 15748 ms. Remains 10604 /10605 variables (removed 1) and now considering 50001/50002 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15749 ms. Remains : 10604/10605 places, 50001/50002 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 514 ms. (steps per millisecond=19 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 96928 steps, run timeout after 3002 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96928 steps, saw 92976 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 17:58:18] [INFO ] Flow matrix only has 50000 transitions (discarded 1 similar events)
// Phase 1: matrix 50000 rows 10604 cols
[2023-03-09 17:58:27] [INFO ] Computed 102 place invariants in 9802 ms
[2023-03-09 17:58:29] [INFO ] [Real]Absence check using 100 positive place invariants in 151 ms returned sat
[2023-03-09 17:58:29] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 227 ms returned sat
[2023-03-09 17:58:29] [INFO ] After 1742ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 17:58:31] [INFO ] [Nat]Absence check using 100 positive place invariants in 151 ms returned sat
[2023-03-09 17:58:31] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 228 ms returned sat
[2023-03-09 17:58:54] [INFO ] After 22788ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 17:58:55] [INFO ] State equation strengthened by 49694 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:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-09 17:58:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 17:58:55] [INFO ] After 25451ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 10604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 4886 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4886 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 4667 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2023-03-09 17:59:04] [INFO ] Flow matrix only has 50000 transitions (discarded 1 similar events)
[2023-03-09 17:59:04] [INFO ] Invariant cache hit.
[2023-03-09 17:59:05] [INFO ] Implicit Places using invariants in 802 ms returned []
Implicit Place search using SMT only with invariants took 803 ms to find 0 implicit places.
[2023-03-09 17:59:05] [INFO ] Flow matrix only has 50000 transitions (discarded 1 similar events)
[2023-03-09 17:59:05] [INFO ] Invariant cache hit.
[2023-03-09 17:59:06] [INFO ] Dead Transitions using invariants and state equation in 965 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6445 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Graph (trivial) has 49389 edges and 10604 vertex of which 10198 / 10604 are part of one of the 2 SCC in 12 ms
Free SCC test removed 10196 places
Drop transitions removed 39493 transitions
Ensure Unique test removed 10093 transitions
Reduce isomorphic transitions removed 49586 transitions.
Graph (complete) has 1017 edges and 408 vertex of which 107 are kept as prefixes of interest. Removing 301 places using SCC suffix rule.1 ms
Discarding 301 places :
Also discarding 99 output transitions
Drop transitions removed 99 transitions
Drop transitions removed 201 transitions
Reduce isomorphic transitions removed 201 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 202 rules applied. Total rules applied 204 place count 107 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 205 place count 106 transition count 114
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 303 place count 8 transition count 16
Iterating global reduction 2 with 98 rules applied. Total rules applied 401 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 403 place count 8 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 404 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 406 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 407 place count 6 transition count 11
Applied a total of 407 rules in 202 ms. Remains 6 /10604 variables (removed 10598) and now considering 11/50001 (removed 49990) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 11 rows 6 cols
[2023-03-09 17:59:06] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 17:59:06] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 17:59:06] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 17:59:06] [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 4 ms.
[2023-03-09 17:59:06] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 157 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 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 10605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Applied a total of 0 rules in 3883 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
[2023-03-09 17:59:11] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
[2023-03-09 17:59:19] [INFO ] Computed 102 place invariants in 8213 ms
[2023-03-09 17:59:20] [INFO ] Implicit Places using invariants in 9317 ms returned []
Implicit Place search using SMT only with invariants took 9318 ms to find 0 implicit places.
[2023-03-09 17:59:20] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-09 17:59:20] [INFO ] Invariant cache hit.
[2023-03-09 17:59:21] [INFO ] Dead Transitions using invariants and state equation in 1106 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14309 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 225 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 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 533 ms. (steps per millisecond=18 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 71679 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71679 steps, saw 65434 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 17:59:25] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-09 17:59:25] [INFO ] Invariant cache hit.
[2023-03-09 17:59:27] [INFO ] [Real]Absence check using 100 positive place invariants in 151 ms returned sat
[2023-03-09 17:59:27] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 268 ms returned sat
[2023-03-09 17:59:27] [INFO ] After 2108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 17:59:29] [INFO ] [Nat]Absence check using 100 positive place invariants in 150 ms returned sat
[2023-03-09 17:59:29] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 222 ms returned sat
[2023-03-09 17:59:52] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 10605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10605 transition count 50001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10604 transition count 50001
Partial Free-agglomeration rule applied 10100 times.
Drop transitions removed 10100 transitions
Iterating global reduction 1 with 10100 rules applied. Total rules applied 10102 place count 10604 transition count 50001
Applied a total of 10102 rules in 12357 ms. Remains 10604 /10605 variables (removed 1) and now considering 50001/50002 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12358 ms. Remains : 10604/10605 places, 50001/50002 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 499 ms. (steps per millisecond=20 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 97937 steps, run timeout after 3002 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97937 steps, saw 93153 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 18:00:08] [INFO ] Flow matrix only has 50000 transitions (discarded 1 similar events)
// Phase 1: matrix 50000 rows 10604 cols
[2023-03-09 18:00:16] [INFO ] Computed 102 place invariants in 8228 ms
[2023-03-09 18:00:18] [INFO ] [Real]Absence check using 100 positive place invariants in 147 ms returned sat
[2023-03-09 18:00:18] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 224 ms returned sat
[2023-03-09 18:00:18] [INFO ] After 1991ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 18:00:20] [INFO ] [Nat]Absence check using 100 positive place invariants in 100 ms returned sat
[2023-03-09 18:00:20] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 161 ms returned sat
[2023-03-09 18:00:43] [INFO ] After 23070ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 18:00:44] [INFO ] State equation strengthened by 49694 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:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-09 18:00:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 18:00:44] [INFO ] After 25694ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 10604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 4481 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4482 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 4453 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2023-03-09 18:00:53] [INFO ] Flow matrix only has 50000 transitions (discarded 1 similar events)
[2023-03-09 18:00:53] [INFO ] Invariant cache hit.
[2023-03-09 18:00:54] [INFO ] Implicit Places using invariants in 962 ms returned []
Implicit Place search using SMT only with invariants took 963 ms to find 0 implicit places.
[2023-03-09 18:00:54] [INFO ] Flow matrix only has 50000 transitions (discarded 1 similar events)
[2023-03-09 18:00:54] [INFO ] Invariant cache hit.
[2023-03-09 18:00:55] [INFO ] Dead Transitions using invariants and state equation in 1127 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6554 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Graph (trivial) has 49389 edges and 10604 vertex of which 10198 / 10604 are part of one of the 2 SCC in 12 ms
Free SCC test removed 10196 places
Drop transitions removed 39493 transitions
Ensure Unique test removed 10093 transitions
Reduce isomorphic transitions removed 49586 transitions.
Graph (complete) has 1017 edges and 408 vertex of which 107 are kept as prefixes of interest. Removing 301 places using SCC suffix rule.1 ms
Discarding 301 places :
Also discarding 99 output transitions
Drop transitions removed 99 transitions
Drop transitions removed 201 transitions
Reduce isomorphic transitions removed 201 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 202 rules applied. Total rules applied 204 place count 107 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 205 place count 106 transition count 114
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 303 place count 8 transition count 16
Iterating global reduction 2 with 98 rules applied. Total rules applied 401 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 403 place count 8 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 404 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 406 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 407 place count 6 transition count 11
Applied a total of 407 rules in 235 ms. Remains 6 /10604 variables (removed 10598) and now considering 11/50001 (removed 49990) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 11 rows 6 cols
[2023-03-09 18:00:55] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 18:00:56] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 18:00:56] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 18:00:56] [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 4 ms.
[2023-03-09 18:00:56] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 174 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 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 199 reset in 3449 ms.
Product exploration explored 100000 steps with 198 reset in 3397 ms.
Built C files in :
/tmp/ltsmin7826400499049074015
[2023-03-09 18:01:03] [INFO ] Too many transitions (50002) to apply POR reductions. Disabling POR matrices.
[2023-03-09 18:01:03] [INFO ] Built C files in 423ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7826400499049074015
Running compilation step : cd /tmp/ltsmin7826400499049074015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7826400499049074015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7826400499049074015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 10605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Applied a total of 0 rules in 3921 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
[2023-03-09 18:01:10] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
[2023-03-09 18:01:19] [INFO ] Computed 102 place invariants in 8798 ms
[2023-03-09 18:01:20] [INFO ] Implicit Places using invariants in 9962 ms returned []
Implicit Place search using SMT only with invariants took 9967 ms to find 0 implicit places.
[2023-03-09 18:01:20] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-09 18:01:20] [INFO ] Invariant cache hit.
[2023-03-09 18:01:21] [INFO ] Dead Transitions using invariants and state equation in 986 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14879 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Built C files in :
/tmp/ltsmin8973572095319058887
[2023-03-09 18:01:21] [INFO ] Too many transitions (50002) to apply POR reductions. Disabling POR matrices.
[2023-03-09 18:01:22] [INFO ] Built C files in 369ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8973572095319058887
Running compilation step : cd /tmp/ltsmin8973572095319058887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8973572095319058887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8973572095319058887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-09 18:01:27] [INFO ] Flatten gal took : 975 ms
[2023-03-09 18:01:27] [INFO ] Flatten gal took : 765 ms
[2023-03-09 18:01:28] [INFO ] Time to serialize gal into /tmp/LTL12825915716013367063.gal : 158 ms
[2023-03-09 18:01:28] [INFO ] Time to serialize properties into /tmp/LTL15246132476732792671.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12825915716013367063.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13490681511496017421.hoa' '-atoms' '/tmp/LTL15246132476732792671.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15246132476732792671.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13490681511496017421.hoa
Detected timeout of ITS tools.
[2023-03-09 18:01:44] [INFO ] Flatten gal took : 884 ms
[2023-03-09 18:01:45] [INFO ] Flatten gal took : 700 ms
[2023-03-09 18:01:45] [INFO ] Time to serialize gal into /tmp/LTL11083140313061698599.gal : 120 ms
[2023-03-09 18:01:45] [INFO ] Time to serialize properties into /tmp/LTL3328888778136235962.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11083140313061698599.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3328888778136235962.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(Node33GiveAnswer20>Node95requestsent60)")))||(G("(Node28GiveAnswer98<3)")))))
Formula 0 simplified : G(FG!"(Node33GiveAnswer20>Node95requestsent60)" & F!"(Node28GiveAnswer98<3)")
Detected timeout of ITS tools.
[2023-03-09 18:02:01] [INFO ] Flatten gal took : 919 ms
[2023-03-09 18:02:01] [INFO ] Applying decomposition
[2023-03-09 18:02:02] [INFO ] Flatten gal took : 730 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1294678835324873914.txt' '-o' '/tmp/graph1294678835324873914.bin' '-w' '/tmp/graph1294678835324873914.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1294678835324873914.bin' '-l' '-1' '-v' '-w' '/tmp/graph1294678835324873914.weights' '-q' '0' '-e' '0.001'
[2023-03-09 18:02:04] [INFO ] Decomposing Gal with order
[2023-03-09 18:02:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 18:02:11] [INFO ] Removed a total of 39751 redundant transitions.
[2023-03-09 18:02:12] [INFO ] Flatten gal took : 6036 ms
[2023-03-09 18:02:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 29499 labels/synchronizations in 12858 ms.
[2023-03-09 18:02:28] [INFO ] Time to serialize gal into /tmp/LTL3793881095701763689.gal : 177 ms
[2023-03-09 18:02:28] [INFO ] Time to serialize properties into /tmp/LTL4958593507632153580.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3793881095701763689.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4958593507632153580.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(gu101.Node33GiveAnswer20>gu101.Node95requestsent60)")))||(G("(gi0.gu99.Node28GiveAnswer98<3)")))))
Formula 0 simplified : G(FG!"(gu101.Node33GiveAnswer20>gu101.Node95requestsent60)" & F!"(gi0.gu99.Node28GiveAnswer98<3)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1279012501054387678
[2023-03-09 18:02:43] [INFO ] Built C files in 364ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1279012501054387678
Running compilation step : cd /tmp/ltsmin1279012501054387678;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1279012501054387678;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1279012501054387678;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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-100-LTLCardinality-03 finished in 350239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (p1||X(F((p1&&F(p2)))))))'
Support contains 4 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9898 Post agglomeration using F-continuation condition.Transition count delta: 9898
Deduced a syphon composed of 9898 places in 31 ms
Reduce places removed 9898 places and 0 transitions.
Iterating global reduction 2 with 19796 rules applied. Total rules applied 21196 place count 10605 transition count 50002
Applied a total of 21196 rules in 14940 ms. Remains 10605 /21203 variables (removed 10598) and now considering 50002/60600 (removed 10598) transitions.
[2023-03-09 18:03:01] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
[2023-03-09 18:03:10] [INFO ] Computed 102 place invariants in 8725 ms
[2023-03-09 18:03:11] [INFO ] Implicit Places using invariants in 10042 ms returned []
Implicit Place search using SMT only with invariants took 10044 ms to find 0 implicit places.
[2023-03-09 18:03:11] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-09 18:03:11] [INFO ] Invariant cache hit.
[2023-03-09 18:03:12] [INFO ] Dead Transitions using invariants and state equation in 1195 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10605/21203 places, 50002/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26191 ms. Remains : 10605/21203 places, 50002/60600 transitions.
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ 3 s2964), p2:(LEQ s9485 s5763), p1:(LEQ 3 s8585)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 467 steps with 0 reset in 36 ms.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-04 finished in 26664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(p1 U p2))))'
Support contains 6 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 5286 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-09 18:03:37] [INFO ] Computed 102 place invariants in 18846 ms
[2023-03-09 18:03:39] [INFO ] Implicit Places using invariants in 20958 ms returned []
Implicit Place search using SMT only with invariants took 20959 ms to find 0 implicit places.
[2023-03-09 18:03:39] [INFO ] Invariant cache hit.
[2023-03-09 18:03:41] [INFO ] Dead Transitions using invariants and state equation in 1980 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28234 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(GT s8491 s5011), p1:(LEQ s1561 s9306), p0:(LEQ s14748 s5353)], 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 2366 steps with 0 reset in 171 ms.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-05 finished in 28914 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X((X(G(p2))||F(p3)||p1)))))'
Support contains 4 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 4953 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
[2023-03-09 18:03:47] [INFO ] Invariant cache hit.
[2023-03-09 18:03:49] [INFO ] Implicit Places using invariants in 1963 ms returned []
Implicit Place search using SMT only with invariants took 1965 ms to find 0 implicit places.
[2023-03-09 18:03:49] [INFO ] Invariant cache hit.
[2023-03-09 18:03:51] [INFO ] Dead Transitions using invariants and state equation in 1993 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8916 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 s7406), p1:(OR (LEQ 3 s14294) (LEQ s18922 s14766)), p3:(LEQ s18922 s14766), p2:(LEQ 3 s14294)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 75120 steps with 24985 reset in 10001 ms.
Product exploration timeout after 90950 steps with 30490 reset in 10002 ms.
Computed a total of 402 stabilizing places and 700 stable transitions
Computed a total of 402 stabilizing places and 700 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 286 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 714 ms. (steps per millisecond=14 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) 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 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 45371 steps, run timeout after 3004 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 45371 steps, saw 44807 distinct states, run finished after 3006 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-09 18:04:16] [INFO ] Invariant cache hit.
[2023-03-09 18:04:20] [INFO ] [Real]Absence check using 100 positive place invariants in 268 ms returned sat
[2023-03-09 18:04:21] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 633 ms returned sat
[2023-03-09 18:04:21] [INFO ] After 5226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 18:04:25] [INFO ] [Nat]Absence check using 100 positive place invariants in 259 ms returned sat
[2023-03-09 18:04:26] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 655 ms returned sat
[2023-03-09 18:04:46] [INFO ] After 18913ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 18:04:47] [INFO ] State equation strengthened by 19900 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:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-09 18:04:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 18:04:47] [INFO ] After 25447ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 21203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9896 Post agglomeration using F-continuation condition.Transition count delta: 9896
Deduced a syphon composed of 9896 places in 53 ms
Reduce places removed 9896 places and 0 transitions.
Iterating global reduction 2 with 19792 rules applied. Total rules applied 21192 place count 10607 transition count 50004
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21193 place count 10607 transition count 50003
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21194 place count 10606 transition count 50003
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 3 with 10101 rules applied. Total rules applied 31295 place count 10606 transition count 50003
Applied a total of 31295 rules in 25513 ms. Remains 10606 /21203 variables (removed 10597) and now considering 50003/60600 (removed 10597) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25520 ms. Remains : 10606/21203 places, 50003/60600 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 740 ms. (steps per millisecond=13 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 93815 steps, run timeout after 3002 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93815 steps, saw 91787 distinct states, run finished after 3002 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 50003 rows 10606 cols
[2023-03-09 18:05:25] [INFO ] Computed 102 place invariants in 8382 ms
[2023-03-09 18:05:27] [INFO ] [Real]Absence check using 100 positive place invariants in 149 ms returned sat
[2023-03-09 18:05:27] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 231 ms returned sat
[2023-03-09 18:05:27] [INFO ] After 2423ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 18:05:29] [INFO ] [Nat]Absence check using 100 positive place invariants in 148 ms returned sat
[2023-03-09 18:05:29] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 228 ms returned sat
[2023-03-09 18:05:52] [INFO ] After 21763ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 18:05:53] [INFO ] State equation strengthened by 49692 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:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-09 18:05:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 18:05:53] [INFO ] After 25706ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 4867 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4868 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 4862 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
[2023-03-09 18:06:03] [INFO ] Invariant cache hit.
[2023-03-09 18:06:04] [INFO ] Implicit Places using invariants in 1004 ms returned []
Implicit Place search using SMT only with invariants took 1005 ms to find 0 implicit places.
[2023-03-09 18:06:04] [INFO ] Invariant cache hit.
[2023-03-09 18:06:05] [INFO ] Dead Transitions using invariants and state equation in 1041 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6920 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Knowledge obtained : [(AND (NOT p0) p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 236 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 6207 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-09 18:06:31] [INFO ] Computed 102 place invariants in 19840 ms
[2023-03-09 18:06:33] [INFO ] Implicit Places using invariants in 21705 ms returned []
Implicit Place search using SMT only with invariants took 21706 ms to find 0 implicit places.
[2023-03-09 18:06:33] [INFO ] Invariant cache hit.
[2023-03-09 18:06:35] [INFO ] Dead Transitions using invariants and state equation in 2002 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29921 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Computed a total of 402 stabilizing places and 700 stable transitions
Computed a total of 402 stabilizing places and 700 stable transitions
Knowledge obtained : [(AND (NOT p0) p3 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 238 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 599 ms. (steps per millisecond=16 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 94177 steps, run timeout after 3003 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94177 steps, saw 92918 distinct states, run finished after 3003 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-09 18:06:40] [INFO ] Invariant cache hit.
[2023-03-09 18:06:44] [INFO ] [Real]Absence check using 100 positive place invariants in 277 ms returned sat
[2023-03-09 18:06:45] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 663 ms returned sat
[2023-03-09 18:06:45] [INFO ] After 5213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 18:06:49] [INFO ] [Nat]Absence check using 100 positive place invariants in 279 ms returned sat
[2023-03-09 18:06:50] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 657 ms returned sat
[2023-03-09 18:07:10] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 21203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9896 Post agglomeration using F-continuation condition.Transition count delta: 9896
Deduced a syphon composed of 9896 places in 29 ms
Reduce places removed 9896 places and 0 transitions.
Iterating global reduction 2 with 19792 rules applied. Total rules applied 21192 place count 10607 transition count 50004
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21193 place count 10607 transition count 50003
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21194 place count 10606 transition count 50003
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 3 with 10101 rules applied. Total rules applied 31295 place count 10606 transition count 50003
Applied a total of 31295 rules in 23398 ms. Remains 10606 /21203 variables (removed 10597) and now considering 50003/60600 (removed 10597) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23399 ms. Remains : 10606/21203 places, 50003/60600 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 525 ms. (steps per millisecond=19 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) 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
Running SMT prover for 2 properties.
// Phase 1: matrix 50003 rows 10606 cols
[2023-03-09 18:07:42] [INFO ] Computed 102 place invariants in 8027 ms
[2023-03-09 18:07:44] [INFO ] [Real]Absence check using 100 positive place invariants in 148 ms returned sat
[2023-03-09 18:07:44] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 228 ms returned sat
[2023-03-09 18:07:44] [INFO ] After 1932ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 18:07:46] [INFO ] [Nat]Absence check using 100 positive place invariants in 133 ms returned sat
[2023-03-09 18:07:46] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 174 ms returned sat
[2023-03-09 18:08:09] [INFO ] After 23066ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 18:08:10] [INFO ] State equation strengthened by 49692 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:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-09 18:08:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 18:08:10] [INFO ] After 25424ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 4562 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4562 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 503 ms. (steps per millisecond=19 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 98436 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98436 steps, saw 93227 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 18:08:18] [INFO ] Invariant cache hit.
[2023-03-09 18:08:20] [INFO ] [Real]Absence check using 100 positive place invariants in 158 ms returned sat
[2023-03-09 18:08:20] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 193 ms returned sat
[2023-03-09 18:08:20] [INFO ] After 1895ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 18:08:21] [INFO ] [Nat]Absence check using 100 positive place invariants in 144 ms returned sat
[2023-03-09 18:08:22] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 258 ms returned sat
[2023-03-09 18:08:45] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 5444 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5445 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 4691 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
[2023-03-09 18:08:55] [INFO ] Invariant cache hit.
[2023-03-09 18:08:56] [INFO ] Implicit Places using invariants in 1103 ms returned []
Implicit Place search using SMT only with invariants took 1105 ms to find 0 implicit places.
[2023-03-09 18:08:56] [INFO ] Invariant cache hit.
[2023-03-09 18:08:57] [INFO ] Dead Transitions using invariants and state equation in 1231 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7036 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Knowledge obtained : [(AND (NOT p0) p3 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p3))), (F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p3) (NOT p1)))]
Knowledge based reduction with 4 factoid took 355 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration timeout after 88800 steps with 29564 reset in 10001 ms.
Product exploration timeout after 92310 steps with 30747 reset in 10001 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Performed 500 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 21203 transition count 60600
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 100 Pre rules applied. Total rules applied 500 place count 21203 transition count 60600
Deduced a syphon composed of 600 places in 32 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 600 place count 21203 transition count 60600
Discarding 200 places :
Symmetric choice reduction at 1 with 200 rule applications. Total rules 800 place count 21003 transition count 60400
Deduced a syphon composed of 400 places in 29 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 1000 place count 21003 transition count 60400
Performed 9996 Post agglomeration using F-continuation condition.Transition count delta: -19592
Deduced a syphon composed of 10396 places in 44 ms
Iterating global reduction 1 with 9996 rules applied. Total rules applied 10996 place count 21003 transition count 79992
Discarding 400 places :
Symmetric choice reduction at 1 with 400 rule applications. Total rules 11396 place count 20603 transition count 79592
Deduced a syphon composed of 9996 places in 26 ms
Iterating global reduction 1 with 400 rules applied. Total rules applied 11796 place count 20603 transition count 79592
Deduced a syphon composed of 9996 places in 16 ms
Applied a total of 11796 rules in 38407 ms. Remains 20603 /21203 variables (removed 600) and now considering 79592/60600 (removed -18992) transitions.
[2023-03-09 18:09:58] [INFO ] Flow matrix only has 69894 transitions (discarded 9698 similar events)
// Phase 1: matrix 69894 rows 20603 cols
[2023-03-09 18:10:20] [INFO ] Computed 102 place invariants in 22106 ms
[2023-03-09 18:10:22] [INFO ] Dead Transitions using invariants and state equation in 24083 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20603/21203 places, 79592/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62493 ms. Remains : 20603/21203 places, 79592/60600 transitions.
Built C files in :
/tmp/ltsmin4372136928413258413
[2023-03-09 18:10:22] [INFO ] Built C files in 374ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4372136928413258413
Running compilation step : cd /tmp/ltsmin4372136928413258413;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin4372136928413258413;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin4372136928413258413;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 5127 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-09 18:10:49] [INFO ] Computed 102 place invariants in 18381 ms
[2023-03-09 18:10:51] [INFO ] Implicit Places using invariants in 20508 ms returned []
Implicit Place search using SMT only with invariants took 20510 ms to find 0 implicit places.
[2023-03-09 18:10:51] [INFO ] Invariant cache hit.
[2023-03-09 18:10:53] [INFO ] Dead Transitions using invariants and state equation in 1775 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27417 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Built C files in :
/tmp/ltsmin3202450986662904078
[2023-03-09 18:10:53] [INFO ] Built C files in 437ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3202450986662904078
Running compilation step : cd /tmp/ltsmin3202450986662904078;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin3202450986662904078;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin3202450986662904078;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-09 18:10:58] [INFO ] Flatten gal took : 1261 ms
[2023-03-09 18:10:59] [INFO ] Flatten gal took : 1114 ms
[2023-03-09 18:11:00] [INFO ] Time to serialize gal into /tmp/LTL7063403250084300030.gal : 174 ms
[2023-03-09 18:11:00] [INFO ] Time to serialize properties into /tmp/LTL16046469434130266171.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7063403250084300030.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7962958473370994804.hoa' '-atoms' '/tmp/LTL16046469434130266171.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16046469434130266171.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7962958473370994804.hoa
Detected timeout of ITS tools.
[2023-03-09 18:11:17] [INFO ] Flatten gal took : 1147 ms
[2023-03-09 18:11:18] [INFO ] Flatten gal took : 1173 ms
[2023-03-09 18:11:18] [INFO ] Time to serialize gal into /tmp/LTL15781812424901378233.gal : 156 ms
[2023-03-09 18:11:18] [INFO ] Time to serialize properties into /tmp/LTL10008184324967169119.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15781812424901378233.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10008184324967169119.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F("(Node30GiveAnswer32>=2)"))||(X(("((Node65GiveAnswer10>=3)||(Node88GiveAnswer47<=Node67GiveAnswer48))")||((X(G("(Node65GiveAns...223
Formula 0 simplified : F(G!"(Node30GiveAnswer32>=2)" & X(!"((Node65GiveAnswer10>=3)||(Node88GiveAnswer47<=Node67GiveAnswer48))" & XF!"(Node65GiveAnswer10>=...207
Detected timeout of ITS tools.
[2023-03-09 18:11:34] [INFO ] Flatten gal took : 1139 ms
[2023-03-09 18:11:34] [INFO ] Applying decomposition
[2023-03-09 18:11:35] [INFO ] Flatten gal took : 984 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2243461993935866438.txt' '-o' '/tmp/graph2243461993935866438.bin' '-w' '/tmp/graph2243461993935866438.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2243461993935866438.bin' '-l' '-1' '-v' '-w' '/tmp/graph2243461993935866438.weights' '-q' '0' '-e' '0.001'
[2023-03-09 18:11:38] [INFO ] Decomposing Gal with order
[2023-03-09 18:11:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 18:11:45] [INFO ] Removed a total of 30047 redundant transitions.
[2023-03-09 18:11:46] [INFO ] Flatten gal took : 4258 ms
[2023-03-09 18:11:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 19608 labels/synchronizations in 6128 ms.
[2023-03-09 18:11:57] [INFO ] Time to serialize gal into /tmp/LTL7544655157482592090.gal : 253 ms
[2023-03-09 18:11:57] [INFO ] Time to serialize properties into /tmp/LTL7293390120584449625.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7544655157482592090.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7293390120584449625.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F("(gi0.gi82.gu131.Node30GiveAnswer32>=2)"))||(X(("((gi0.gi82.gu43.Node65GiveAnswer10>=3)||(gu400.Node88GiveAnswer47<=gu400.Node...290
Formula 0 simplified : F(G!"(gi0.gi82.gu131.Node30GiveAnswer32>=2)" & X(!"((gi0.gi82.gu43.Node65GiveAnswer10>=3)||(gu400.Node88GiveAnswer47<=gu400.Node67Gi...274
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10183659419732679192
[2023-03-09 18:12:12] [INFO ] Built C files in 284ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10183659419732679192
Running compilation step : cd /tmp/ltsmin10183659419732679192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin10183659419732679192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin10183659419732679192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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-100-LTLCardinality-07 finished in 513840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X((p0||F(G(p1)))))))))'
Support contains 3 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 6395 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
[2023-03-09 18:12:22] [INFO ] Invariant cache hit.
[2023-03-09 18:12:24] [INFO ] Implicit Places using invariants in 2092 ms returned []
Implicit Place search using SMT only with invariants took 2099 ms to find 0 implicit places.
[2023-03-09 18:12:24] [INFO ] Invariant cache hit.
[2023-03-09 18:12:26] [INFO ] Dead Transitions using invariants and state equation in 1640 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10138 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 364 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(LEQ 1 s11305), p1:(GT s7659 s1554)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2317 steps with 0 reset in 90 ms.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-09 finished in 10814 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p0) U p1)||X(G(!p0))||X(p2))))'
Support contains 3 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 5395 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
[2023-03-09 18:12:32] [INFO ] Invariant cache hit.
[2023-03-09 18:12:33] [INFO ] Implicit Places using invariants in 1681 ms returned []
Implicit Place search using SMT only with invariants took 1685 ms to find 0 implicit places.
[2023-03-09 18:12:33] [INFO ] Invariant cache hit.
[2023-03-09 18:12:35] [INFO ] Dead Transitions using invariants and state equation in 1761 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8845 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 305 ms :[true, (OR (NOT p0) (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), p0]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(LEQ 3 s15135), p1:(LEQ 2 s18032), p2:(LEQ 1 s9719)], 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 40 reset in 3076 ms.
Product exploration explored 100000 steps with 40 reset in 2977 ms.
Computed a total of 402 stabilizing places and 700 stable transitions
Computed a total of 402 stabilizing places and 700 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 227 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[true, p0, p0, p0, p0]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 171993 steps, run timeout after 3002 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 171993 steps, saw 169642 distinct states, run finished after 3002 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 18:12:46] [INFO ] Invariant cache hit.
[2023-03-09 18:12:48] [INFO ] [Real]Absence check using 100 positive place invariants in 248 ms returned sat
[2023-03-09 18:12:49] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 444 ms returned sat
[2023-03-09 18:13:11] [INFO ] After 25018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 21203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9900 Post agglomeration using F-continuation condition.Transition count delta: 9900
Deduced a syphon composed of 9900 places in 25 ms
Reduce places removed 9900 places and 0 transitions.
Iterating global reduction 2 with 19800 rules applied. Total rules applied 21200 place count 10603 transition count 50000
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21201 place count 10603 transition count 49999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21202 place count 10602 transition count 49999
Partial Free-agglomeration rule applied 10100 times.
Drop transitions removed 10100 transitions
Iterating global reduction 3 with 10100 rules applied. Total rules applied 31302 place count 10602 transition count 49999
Applied a total of 31302 rules in 29010 ms. Remains 10602 /21203 variables (removed 10601) and now considering 49999/60600 (removed 10601) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29010 ms. Remains : 10602/21203 places, 49999/60600 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 101447 steps, run timeout after 3002 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101447 steps, saw 93685 distinct states, run finished after 3002 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 18:13:43] [INFO ] Flow matrix only has 49998 transitions (discarded 1 similar events)
// Phase 1: matrix 49998 rows 10602 cols
[2023-03-09 18:13:52] [INFO ] Computed 102 place invariants in 8369 ms
[2023-03-09 18:13:53] [INFO ] [Real]Absence check using 100 positive place invariants in 115 ms returned sat
[2023-03-09 18:13:53] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 162 ms returned sat
[2023-03-09 18:14:17] [INFO ] After 25019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 10602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10602/10602 places, 49999/49999 transitions.
Applied a total of 0 rules in 7126 ms. Remains 10602 /10602 variables (removed 0) and now considering 49999/49999 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7127 ms. Remains : 10602/10602 places, 49999/49999 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10602/10602 places, 49999/49999 transitions.
Applied a total of 0 rules in 6953 ms. Remains 10602 /10602 variables (removed 0) and now considering 49999/49999 (removed 0) transitions.
[2023-03-09 18:14:31] [INFO ] Flow matrix only has 49998 transitions (discarded 1 similar events)
[2023-03-09 18:14:31] [INFO ] Invariant cache hit.
[2023-03-09 18:14:32] [INFO ] Implicit Places using invariants in 1108 ms returned []
Implicit Place search using SMT only with invariants took 1110 ms to find 0 implicit places.
[2023-03-09 18:14:32] [INFO ] Flow matrix only has 49998 transitions (discarded 1 similar events)
[2023-03-09 18:14:32] [INFO ] Invariant cache hit.
[2023-03-09 18:14:33] [INFO ] Dead Transitions using invariants and state equation in 959 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9032 ms. Remains : 10602/10602 places, 49999/49999 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 230 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[true, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 215 ms :[true, p0, p0, p0, p0]
Support contains 1 out of 21203 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 5978 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-09 18:14:57] [INFO ] Computed 102 place invariants in 17761 ms
[2023-03-09 18:15:00] [INFO ] Implicit Places using invariants in 19946 ms returned []
Implicit Place search using SMT only with invariants took 19949 ms to find 0 implicit places.
[2023-03-09 18:15:00] [INFO ] Invariant cache hit.
[2023-03-09 18:15:02] [INFO ] Dead Transitions using invariants and state equation in 2030 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27962 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Computed a total of 402 stabilizing places and 700 stable transitions
Computed a total of 402 stabilizing places and 700 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[true, p0, p0, p0, p0]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 153194 steps, run timeout after 3002 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153194 steps, saw 151116 distinct states, run finished after 3002 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 18:15:06] [INFO ] Invariant cache hit.
[2023-03-09 18:15:09] [INFO ] [Real]Absence check using 100 positive place invariants in 222 ms returned sat
[2023-03-09 18:15:09] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 482 ms returned sat
[2023-03-09 18:15:31] [INFO ] After 25027ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 21203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9900 Post agglomeration using F-continuation condition.Transition count delta: 9900
Deduced a syphon composed of 9900 places in 42 ms
Reduce places removed 9900 places and 0 transitions.
Iterating global reduction 2 with 19800 rules applied. Total rules applied 21200 place count 10603 transition count 50000
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21201 place count 10603 transition count 49999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21202 place count 10602 transition count 49999
Partial Free-agglomeration rule applied 10100 times.
Drop transitions removed 10100 transitions
Iterating global reduction 3 with 10100 rules applied. Total rules applied 31302 place count 10602 transition count 49999
Applied a total of 31302 rules in 31567 ms. Remains 10602 /21203 variables (removed 10601) and now considering 49999/60600 (removed 10601) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31568 ms. Remains : 10602/21203 places, 49999/60600 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 100411 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100411 steps, saw 93508 distinct states, run finished after 3002 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 18:16:06] [INFO ] Flow matrix only has 49998 transitions (discarded 1 similar events)
// Phase 1: matrix 49998 rows 10602 cols
[2023-03-09 18:16:15] [INFO ] Computed 102 place invariants in 8677 ms
[2023-03-09 18:16:16] [INFO ] [Real]Absence check using 100 positive place invariants in 159 ms returned sat
[2023-03-09 18:16:16] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 191 ms returned sat
[2023-03-09 18:16:40] [INFO ] After 25020ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 10602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10602/10602 places, 49999/49999 transitions.
Applied a total of 0 rules in 11037 ms. Remains 10602 /10602 variables (removed 0) and now considering 49999/49999 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11039 ms. Remains : 10602/10602 places, 49999/49999 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10602/10602 places, 49999/49999 transitions.
Applied a total of 0 rules in 6904 ms. Remains 10602 /10602 variables (removed 0) and now considering 49999/49999 (removed 0) transitions.
[2023-03-09 18:16:58] [INFO ] Flow matrix only has 49998 transitions (discarded 1 similar events)
[2023-03-09 18:16:58] [INFO ] Invariant cache hit.
[2023-03-09 18:16:59] [INFO ] Implicit Places using invariants in 1168 ms returned []
Implicit Place search using SMT only with invariants took 1170 ms to find 0 implicit places.
[2023-03-09 18:16:59] [INFO ] Flow matrix only has 49998 transitions (discarded 1 similar events)
[2023-03-09 18:16:59] [INFO ] Invariant cache hit.
[2023-03-09 18:17:00] [INFO ] Dead Transitions using invariants and state equation in 951 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9037 ms. Remains : 10602/10602 places, 49999/49999 transitions.
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[true, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 208 ms :[true, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 193 ms :[true, p0, p0, p0, p0]
Product exploration explored 100000 steps with 40 reset in 3269 ms.
Product exploration explored 100000 steps with 40 reset in 3307 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 225 ms :[true, p0, p0, p0, p0]
Support contains 1 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Performed 500 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 21203 transition count 60600
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 100 Pre rules applied. Total rules applied 500 place count 21203 transition count 60600
Deduced a syphon composed of 600 places in 30 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 600 place count 21203 transition count 60600
Discarding 200 places :
Symmetric choice reduction at 1 with 200 rule applications. Total rules 800 place count 21003 transition count 60400
Deduced a syphon composed of 400 places in 22 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 1000 place count 21003 transition count 60400
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: -19600
Deduced a syphon composed of 10400 places in 25 ms
Iterating global reduction 1 with 10000 rules applied. Total rules applied 11000 place count 21003 transition count 80000
Discarding 400 places :
Symmetric choice reduction at 1 with 400 rule applications. Total rules 11400 place count 20603 transition count 79600
Deduced a syphon composed of 10000 places in 16 ms
Iterating global reduction 1 with 400 rules applied. Total rules applied 11800 place count 20603 transition count 79600
Deduced a syphon composed of 10000 places in 16 ms
Applied a total of 11800 rules in 40583 ms. Remains 20603 /21203 variables (removed 600) and now considering 79600/60600 (removed -19000) transitions.
[2023-03-09 18:17:48] [INFO ] Flow matrix only has 69898 transitions (discarded 9702 similar events)
// Phase 1: matrix 69898 rows 20603 cols
[2023-03-09 18:18:14] [INFO ] Computed 102 place invariants in 25914 ms
[2023-03-09 18:18:16] [INFO ] Dead Transitions using invariants and state equation in 27762 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20603/21203 places, 79600/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68350 ms. Remains : 20603/21203 places, 79600/60600 transitions.
Built C files in :
/tmp/ltsmin14139584723616953902
[2023-03-09 18:18:16] [INFO ] Built C files in 477ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14139584723616953902
Running compilation step : cd /tmp/ltsmin14139584723616953902;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin14139584723616953902;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin14139584723616953902;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 7374 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-09 18:18:44] [INFO ] Computed 102 place invariants in 17346 ms
[2023-03-09 18:18:46] [INFO ] Implicit Places using invariants in 19514 ms returned []
Implicit Place search using SMT only with invariants took 19515 ms to find 0 implicit places.
[2023-03-09 18:18:46] [INFO ] Invariant cache hit.
[2023-03-09 18:18:48] [INFO ] Dead Transitions using invariants and state equation in 1984 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28880 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Built C files in :
/tmp/ltsmin11033967339384411405
[2023-03-09 18:18:49] [INFO ] Built C files in 370ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11033967339384411405
Running compilation step : cd /tmp/ltsmin11033967339384411405;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin11033967339384411405;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin11033967339384411405;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-09 18:18:54] [INFO ] Flatten gal took : 1421 ms
[2023-03-09 18:18:56] [INFO ] Flatten gal took : 1474 ms
[2023-03-09 18:18:56] [INFO ] Time to serialize gal into /tmp/LTL213939731374295000.gal : 161 ms
[2023-03-09 18:18:56] [INFO ] Time to serialize properties into /tmp/LTL121451474016706521.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL213939731374295000.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12524635958816036466.hoa' '-atoms' '/tmp/LTL121451474016706521.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL121451474016706521.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12524635958816036466.hoa
Detected timeout of ITS tools.
[2023-03-09 18:19:14] [INFO ] Flatten gal took : 1301 ms
[2023-03-09 18:19:15] [INFO ] Flatten gal took : 1451 ms
[2023-03-09 18:19:15] [INFO ] Time to serialize gal into /tmp/LTL3168193586553302820.gal : 205 ms
[2023-03-09 18:19:15] [INFO ] Time to serialize properties into /tmp/LTL10655605392725425934.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3168193586553302820.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10655605392725425934.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((((X("(Node69requestsent35>=3)"))U("(Node83GiveAnswer98>=2)"))||(X(G("(Node69requestsent35<3)"))))||(X("(Node42requestsent0>=1)")...159
Formula 0 simplified : X(!"(Node83GiveAnswer98>=2)" & X(!"(Node42requestsent0>=1)" & F!"(Node69requestsent35<3)" & (!"(Node83GiveAnswer98>=2)" W !"(Node69r...175
Detected timeout of ITS tools.
[2023-03-09 18:19:32] [INFO ] Flatten gal took : 1466 ms
[2023-03-09 18:19:32] [INFO ] Applying decomposition
[2023-03-09 18:19:33] [INFO ] Flatten gal took : 1420 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2554801183776188076.txt' '-o' '/tmp/graph2554801183776188076.bin' '-w' '/tmp/graph2554801183776188076.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2554801183776188076.bin' '-l' '-1' '-v' '-w' '/tmp/graph2554801183776188076.weights' '-q' '0' '-e' '0.001'
[2023-03-09 18:19:37] [INFO ] Decomposing Gal with order
[2023-03-09 18:19:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 18:19:45] [INFO ] Removed a total of 30054 redundant transitions.
[2023-03-09 18:19:46] [INFO ] Flatten gal took : 4659 ms
[2023-03-09 18:19:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 40108 labels/synchronizations in 6956 ms.
[2023-03-09 18:19:54] [INFO ] Time to serialize gal into /tmp/LTL10451950026535416676.gal : 298 ms
[2023-03-09 18:19:54] [INFO ] Time to serialize properties into /tmp/LTL9955557076118206321.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10451950026535416676.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9955557076118206321.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((((X("(i70.u279.Node69requestsent35>=3)"))U("(i99.u394.Node83GiveAnswer98>=2)"))||(X(G("(i70.u279.Node69requestsent35<3)"))))||(X...195
Formula 0 simplified : X(!"(i99.u394.Node83GiveAnswer98>=2)" & X(!"(i43.u171.Node42requestsent0>=1)" & F!"(i70.u279.Node69requestsent35<3)" & (!"(i99.u394....220
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13774005119140454314
[2023-03-09 18:20:09] [INFO ] Built C files in 437ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13774005119140454314
Running compilation step : cd /tmp/ltsmin13774005119140454314;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin13774005119140454314;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin13774005119140454314;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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-100-LTLCardinality-10 finished in 466107 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 21203 transition count 59901
Reduce places removed 699 places and 0 transitions.
Iterating post reduction 1 with 699 rules applied. Total rules applied 1398 place count 20504 transition count 59901
Performed 9900 Post agglomeration using F-continuation condition.Transition count delta: 9900
Deduced a syphon composed of 9900 places in 29 ms
Reduce places removed 9900 places and 0 transitions.
Iterating global reduction 2 with 19800 rules applied. Total rules applied 21198 place count 10604 transition count 50001
Applied a total of 21198 rules in 17950 ms. Remains 10604 /21203 variables (removed 10599) and now considering 50001/60600 (removed 10599) transitions.
[2023-03-09 18:20:30] [INFO ] Flow matrix only has 40299 transitions (discarded 9702 similar events)
// Phase 1: matrix 40299 rows 10604 cols
[2023-03-09 18:20:39] [INFO ] Computed 102 place invariants in 8426 ms
[2023-03-09 18:20:40] [INFO ] Implicit Places using invariants in 9719 ms returned []
Implicit Place search using SMT only with invariants took 9729 ms to find 0 implicit places.
[2023-03-09 18:20:40] [INFO ] Flow matrix only has 40299 transitions (discarded 9702 similar events)
[2023-03-09 18:20:40] [INFO ] Invariant cache hit.
[2023-03-09 18:20:41] [INFO ] Dead Transitions using invariants and state equation in 1093 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10604/21203 places, 50001/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28776 ms. Remains : 10604/21203 places, 50001/60600 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-12 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}]], initial=1, aps=[p0:(LEQ s2611 s75)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 23748 steps with 46 reset in 924 ms.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-12 finished in 29918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 5467 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-09 18:21:07] [INFO ] Computed 102 place invariants in 19575 ms
[2023-03-09 18:21:09] [INFO ] Implicit Places using invariants in 21565 ms returned []
Implicit Place search using SMT only with invariants took 21567 ms to find 0 implicit places.
[2023-03-09 18:21:09] [INFO ] Invariant cache hit.
[2023-03-09 18:21:11] [INFO ] Dead Transitions using invariants and state equation in 1764 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28802 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LEQ 2 s14960) (GT 3 s9185))], 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]]
Stuttering criterion allowed to conclude after 2481 steps with 0 reset in 162 ms.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-13 finished in 29278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9898 Post agglomeration using F-continuation condition.Transition count delta: 9898
Deduced a syphon composed of 9898 places in 27 ms
Reduce places removed 9898 places and 0 transitions.
Iterating global reduction 2 with 19796 rules applied. Total rules applied 21196 place count 10605 transition count 50002
Applied a total of 21196 rules in 17104 ms. Remains 10605 /21203 variables (removed 10598) and now considering 50002/60600 (removed 10598) transitions.
[2023-03-09 18:21:29] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
[2023-03-09 18:21:38] [INFO ] Computed 102 place invariants in 9600 ms
[2023-03-09 18:21:40] [INFO ] Implicit Places using invariants in 10874 ms returned []
Implicit Place search using SMT only with invariants took 10875 ms to find 0 implicit places.
[2023-03-09 18:21:40] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-09 18:21:40] [INFO ] Invariant cache hit.
[2023-03-09 18:21:41] [INFO ] Dead Transitions using invariants and state equation in 1032 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10605/21203 places, 50002/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29020 ms. Remains : 10605/21203 places, 50002/60600 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s8342 s3443)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 198 reset in 5149 ms.
Product exploration explored 100000 steps with 198 reset in 4917 ms.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 70905 steps, run timeout after 3002 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70905 steps, saw 65306 distinct states, run finished after 3003 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 18:21:55] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-09 18:21:55] [INFO ] Invariant cache hit.
[2023-03-09 18:21:56] [INFO ] After 1331ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 18:21:57] [INFO ] [Nat]Absence check using 100 positive place invariants in 105 ms returned sat
[2023-03-09 18:21:58] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 157 ms returned sat
[2023-03-09 18:22:21] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 10605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10605 transition count 50001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10604 transition count 50001
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 1 with 10101 rules applied. Total rules applied 10103 place count 10604 transition count 50001
Applied a total of 10103 rules in 20098 ms. Remains 10604 /10605 variables (removed 1) and now considering 50001/50002 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20100 ms. Remains : 10604/10605 places, 50001/50002 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 579 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 98269 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98269 steps, saw 93205 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 50001 rows 10604 cols
[2023-03-09 18:22:53] [INFO ] Computed 102 place invariants in 8306 ms
[2023-03-09 18:22:55] [INFO ] After 1240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 18:22:56] [INFO ] [Nat]Absence check using 100 positive place invariants in 110 ms returned sat
[2023-03-09 18:22:56] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 164 ms returned sat
[2023-03-09 18:23:20] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 10604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 6767 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6767 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 6385 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2023-03-09 18:23:33] [INFO ] Invariant cache hit.
[2023-03-09 18:23:34] [INFO ] Implicit Places using invariants in 938 ms returned []
Implicit Place search using SMT only with invariants took 939 ms to find 0 implicit places.
[2023-03-09 18:23:34] [INFO ] Invariant cache hit.
[2023-03-09 18:23:35] [INFO ] Dead Transitions using invariants and state equation in 934 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8267 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 169 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 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 2 out of 10605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Applied a total of 0 rules in 5835 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
[2023-03-09 18:23:41] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
[2023-03-09 18:23:50] [INFO ] Computed 102 place invariants in 8841 ms
[2023-03-09 18:23:51] [INFO ] Implicit Places using invariants in 9813 ms returned []
Implicit Place search using SMT only with invariants took 9816 ms to find 0 implicit places.
[2023-03-09 18:23:51] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-09 18:23:51] [INFO ] Invariant cache hit.
[2023-03-09 18:23:52] [INFO ] Dead Transitions using invariants and state equation in 967 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16625 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 129 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)]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 489 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 73331 steps, run timeout after 3002 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73331 steps, saw 65697 distinct states, run finished after 3002 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 18:23:56] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-09 18:23:56] [INFO ] Invariant cache hit.
[2023-03-09 18:23:57] [INFO ] After 1196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 18:23:58] [INFO ] [Nat]Absence check using 100 positive place invariants in 158 ms returned sat
[2023-03-09 18:23:58] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 185 ms returned sat
[2023-03-09 18:24:22] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 10605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10605 transition count 50001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10604 transition count 50001
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 1 with 10101 rules applied. Total rules applied 10103 place count 10604 transition count 50001
Applied a total of 10103 rules in 19307 ms. Remains 10604 /10605 variables (removed 1) and now considering 50001/50002 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19308 ms. Remains : 10604/10605 places, 50001/50002 transitions.
Finished random walk after 3637 steps, including 6 resets, run visited all 1 properties in 149 ms. (steps per millisecond=24 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 156 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 199 reset in 4784 ms.
Product exploration explored 100000 steps with 199 reset in 4695 ms.
Built C files in :
/tmp/ltsmin17265644631685615031
[2023-03-09 18:24:51] [INFO ] Too many transitions (50002) to apply POR reductions. Disabling POR matrices.
[2023-03-09 18:24:52] [INFO ] Built C files in 381ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17265644631685615031
Running compilation step : cd /tmp/ltsmin17265644631685615031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin17265644631685615031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin17265644631685615031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 10605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Applied a total of 0 rules in 5630 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
[2023-03-09 18:25:00] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-09 18:25:00] [INFO ] Invariant cache hit.
[2023-03-09 18:25:01] [INFO ] Implicit Places using invariants in 970 ms returned []
Implicit Place search using SMT only with invariants took 974 ms to find 0 implicit places.
[2023-03-09 18:25:01] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-09 18:25:01] [INFO ] Invariant cache hit.
[2023-03-09 18:25:02] [INFO ] Dead Transitions using invariants and state equation in 1088 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7694 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Built C files in :
/tmp/ltsmin9637734134874527186
[2023-03-09 18:25:02] [INFO ] Too many transitions (50002) to apply POR reductions. Disabling POR matrices.
[2023-03-09 18:25:03] [INFO ] Built C files in 379ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9637734134874527186
Running compilation step : cd /tmp/ltsmin9637734134874527186;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin9637734134874527186;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin9637734134874527186;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-09 18:25:07] [INFO ] Flatten gal took : 742 ms
[2023-03-09 18:25:08] [INFO ] Flatten gal took : 938 ms
[2023-03-09 18:25:08] [INFO ] Time to serialize gal into /tmp/LTL17572282499108121431.gal : 149 ms
[2023-03-09 18:25:08] [INFO ] Time to serialize properties into /tmp/LTL4139140098688224799.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17572282499108121431.gal' '-t' 'CGAL' '-hoa' '/tmp/aut746414946887093049.hoa' '-atoms' '/tmp/LTL4139140098688224799.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4139140098688224799.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut746414946887093049.hoa
Detected timeout of ITS tools.
[2023-03-09 18:25:25] [INFO ] Flatten gal took : 804 ms
[2023-03-09 18:25:26] [INFO ] Flatten gal took : 848 ms
[2023-03-09 18:25:26] [INFO ] Time to serialize gal into /tmp/LTL7316278506081407630.gal : 147 ms
[2023-03-09 18:25:26] [INFO ] Time to serialize properties into /tmp/LTL14782451642424096790.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7316278506081407630.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14782451642424096790.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(Node77GiveAnswer37<=Node28GiveAnswer40)"))))
Formula 0 simplified : GF!"(Node77GiveAnswer37<=Node28GiveAnswer40)"
Detected timeout of ITS tools.
[2023-03-09 18:25:42] [INFO ] Flatten gal took : 1044 ms
[2023-03-09 18:25:42] [INFO ] Applying decomposition
[2023-03-09 18:25:43] [INFO ] Flatten gal took : 901 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13364903316182853958.txt' '-o' '/tmp/graph13364903316182853958.bin' '-w' '/tmp/graph13364903316182853958.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13364903316182853958.bin' '-l' '-1' '-v' '-w' '/tmp/graph13364903316182853958.weights' '-q' '0' '-e' '0.001'
[2023-03-09 18:25:46] [INFO ] Decomposing Gal with order
[2023-03-09 18:25:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 18:25:53] [INFO ] Removed a total of 39765 redundant transitions.
[2023-03-09 18:25:54] [INFO ] Flatten gal took : 6842 ms
[2023-03-09 18:26:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 29503 labels/synchronizations in 12503 ms.
[2023-03-09 18:26:09] [INFO ] Time to serialize gal into /tmp/LTL4946560624315865846.gal : 163 ms
[2023-03-09 18:26:09] [INFO ] Time to serialize properties into /tmp/LTL5384093806043589664.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4946560624315865846.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5384093806043589664.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu101.Node77GiveAnswer37<=gu101.Node28GiveAnswer40)"))))
Formula 0 simplified : GF!"(gu101.Node77GiveAnswer37<=gu101.Node28GiveAnswer40)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12644662086025680078
[2023-03-09 18:26:25] [INFO ] Built C files in 362ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12644662086025680078
Running compilation step : cd /tmp/ltsmin12644662086025680078;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin12644662086025680078;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin12644662086025680078;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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-100-LTLCardinality-14 finished in 316309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F(((p1 U p2)&&(!p1 U (p3||G(!p1)))))))'
Support contains 7 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9899 Post agglomeration using F-continuation condition.Transition count delta: 9899
Deduced a syphon composed of 9899 places in 30 ms
Reduce places removed 9899 places and 0 transitions.
Iterating global reduction 2 with 19798 rules applied. Total rules applied 21198 place count 10604 transition count 50001
Applied a total of 21198 rules in 17915 ms. Remains 10604 /21203 variables (removed 10599) and now considering 50001/60600 (removed 10599) transitions.
[2023-03-09 18:26:46] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
// Phase 1: matrix 40300 rows 10604 cols
[2023-03-09 18:26:55] [INFO ] Computed 102 place invariants in 9067 ms
[2023-03-09 18:26:56] [INFO ] Implicit Places using invariants in 10227 ms returned []
Implicit Place search using SMT only with invariants took 10228 ms to find 0 implicit places.
[2023-03-09 18:26:56] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2023-03-09 18:26:56] [INFO ] Invariant cache hit.
[2023-03-09 18:26:57] [INFO ] Dead Transitions using invariants and state equation in 1107 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10604/21203 places, 50001/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29253 ms. Remains : 10604/21203 places, 50001/60600 transitions.
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p0) (NOT p2) (AND p1 (NOT p3))), (NOT p0), (NOT p0), (OR (NOT p2) (AND p1 (NOT p3))), (NOT p2), (AND p1 (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND p1 (NOT p3))), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=0 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND p1 (NOT p3))), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p1 p3), acceptance={0} source=3 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p3)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s852 s8369), p2:(LEQ s8093 s731), p1:(LEQ s5991 s706), p3:(AND (GT 1 s1093) (GT s5991 s706))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 525 steps with 0 reset in 48 ms.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-15 finished in 29791 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X((X(G(p2))||F(p3)||p1)))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-100-LTLCardinality-07
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9896 Post agglomeration using F-continuation condition.Transition count delta: 9896
Deduced a syphon composed of 9896 places in 30 ms
Reduce places removed 9896 places and 0 transitions.
Iterating global reduction 2 with 19792 rules applied. Total rules applied 21192 place count 10607 transition count 50004
Applied a total of 21192 rules in 17934 ms. Remains 10607 /21203 variables (removed 10596) and now considering 50004/60600 (removed 10596) transitions.
[2023-03-09 18:27:16] [INFO ] Flow matrix only has 40306 transitions (discarded 9698 similar events)
// Phase 1: matrix 40306 rows 10607 cols
[2023-03-09 18:27:26] [INFO ] Computed 102 place invariants in 9320 ms
[2023-03-09 18:27:27] [INFO ] Implicit Places using invariants in 10457 ms returned []
Implicit Place search using SMT only with invariants took 10460 ms to find 0 implicit places.
[2023-03-09 18:27:27] [INFO ] Flow matrix only has 40306 transitions (discarded 9698 similar events)
[2023-03-09 18:27:27] [INFO ] Invariant cache hit.
[2023-03-09 18:27:28] [INFO ] Dead Transitions using invariants and state equation in 1234 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 10607/21203 places, 50004/60600 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 29632 ms. Remains : 10607/21203 places, 50004/60600 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 s3635), p1:(OR (LEQ 3 s7115) (LEQ s9454 s7354)), p3:(LEQ s9454 s7354), p2:(LEQ 3 s7115)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33179 reset in 9167 ms.
Product exploration explored 100000 steps with 33396 reset in 9297 ms.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 230 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 656 ms. (steps per millisecond=15 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) 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 5) 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 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 68807 steps, run timeout after 3002 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68807 steps, saw 65002 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-09 18:27:51] [INFO ] Flow matrix only has 40306 transitions (discarded 9698 similar events)
[2023-03-09 18:27:51] [INFO ] Invariant cache hit.
[2023-03-09 18:27:53] [INFO ] [Real]Absence check using 100 positive place invariants in 150 ms returned sat
[2023-03-09 18:27:53] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 221 ms returned sat
[2023-03-09 18:27:54] [INFO ] After 2558ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 18:27:56] [INFO ] [Nat]Absence check using 100 positive place invariants in 150 ms returned sat
[2023-03-09 18:27:56] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 220 ms returned sat
[2023-03-09 18:28:19] [INFO ] After 21687ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 18:28:19] [INFO ] State equation strengthened by 29894 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:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-09 18:28:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 18:28:19] [INFO ] After 25386ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10607 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10607/10607 places, 50004/50004 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10607 transition count 50003
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10606 transition count 50003
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 1 with 10101 rules applied. Total rules applied 10103 place count 10606 transition count 50003
Applied a total of 10103 rules in 17910 ms. Remains 10606 /10607 variables (removed 1) and now considering 50003/50004 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17911 ms. Remains : 10606/10607 places, 50003/50004 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 554 ms. (steps per millisecond=18 ) properties (out of 5) 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 5) 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 5) 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 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 96338 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96338 steps, saw 92885 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 50003 rows 10606 cols
[2023-03-09 18:28:49] [INFO ] Computed 102 place invariants in 8448 ms
[2023-03-09 18:28:51] [INFO ] [Real]Absence check using 100 positive place invariants in 151 ms returned sat
[2023-03-09 18:28:51] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 225 ms returned sat
[2023-03-09 18:28:52] [INFO ] After 2521ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 18:28:54] [INFO ] [Nat]Absence check using 100 positive place invariants in 161 ms returned sat
[2023-03-09 18:28:54] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 233 ms returned sat
[2023-03-09 18:29:17] [INFO ] After 21529ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 18:29:17] [INFO ] State equation strengthened by 49692 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:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-09 18:29:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 18:29:17] [INFO ] After 25758ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 7132 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7132 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 6819 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
[2023-03-09 18:29:31] [INFO ] Invariant cache hit.
[2023-03-09 18:29:32] [INFO ] Implicit Places using invariants in 944 ms returned []
Implicit Place search using SMT only with invariants took 945 ms to find 0 implicit places.
[2023-03-09 18:29:32] [INFO ] Invariant cache hit.
[2023-03-09 18:29:34] [INFO ] Dead Transitions using invariants and state equation in 1271 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9045 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Knowledge obtained : [(AND (NOT p0) p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 283 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 10607 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10607/10607 places, 50004/50004 transitions.
Applied a total of 0 rules in 5741 ms. Remains 10607 /10607 variables (removed 0) and now considering 50004/50004 (removed 0) transitions.
[2023-03-09 18:29:40] [INFO ] Flow matrix only has 40306 transitions (discarded 9698 similar events)
// Phase 1: matrix 40306 rows 10607 cols
[2023-03-09 18:29:49] [INFO ] Computed 102 place invariants in 9189 ms
[2023-03-09 18:29:50] [INFO ] Implicit Places using invariants in 10273 ms returned []
Implicit Place search using SMT only with invariants took 10278 ms to find 0 implicit places.
[2023-03-09 18:29:50] [INFO ] Flow matrix only has 40306 transitions (discarded 9698 similar events)
[2023-03-09 18:29:50] [INFO ] Invariant cache hit.
[2023-03-09 18:29:51] [INFO ] Dead Transitions using invariants and state equation in 956 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16978 ms. Remains : 10607/10607 places, 50004/50004 transitions.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND (NOT p0) p3 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 284 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 704 ms. (steps per millisecond=14 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 68439 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68439 steps, saw 64942 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-09 18:29:56] [INFO ] Flow matrix only has 40306 transitions (discarded 9698 similar events)
[2023-03-09 18:29:56] [INFO ] Invariant cache hit.
[2023-03-09 18:29:58] [INFO ] [Real]Absence check using 100 positive place invariants in 158 ms returned sat
[2023-03-09 18:29:58] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 228 ms returned sat
[2023-03-09 18:29:59] [INFO ] After 2501ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 18:30:01] [INFO ] [Nat]Absence check using 100 positive place invariants in 149 ms returned sat
[2023-03-09 18:30:01] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 228 ms returned sat
[2023-03-09 18:30:24] [INFO ] After 21606ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 18:30:24] [INFO ] State equation strengthened by 29894 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:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-09 18:30:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 18:30:24] [INFO ] After 25634ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10607 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10607/10607 places, 50004/50004 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10607 transition count 50003
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10606 transition count 50003
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 1 with 10101 rules applied. Total rules applied 10103 place count 10606 transition count 50003
Applied a total of 10103 rules in 20896 ms. Remains 10606 /10607 variables (removed 1) and now considering 50003/50004 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20897 ms. Remains : 10606/10607 places, 50003/50004 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 592 ms. (steps per millisecond=16 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) 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 5) 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 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 75203 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75203 steps, saw 73600 distinct states, run finished after 3002 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 50003 rows 10606 cols
[2023-03-09 18:30:57] [INFO ] Computed 102 place invariants in 8085 ms
[2023-03-09 18:30:59] [INFO ] [Real]Absence check using 100 positive place invariants in 151 ms returned sat
[2023-03-09 18:31:00] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 223 ms returned sat
[2023-03-09 18:31:00] [INFO ] After 2663ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 18:31:02] [INFO ] [Nat]Absence check using 100 positive place invariants in 150 ms returned sat
[2023-03-09 18:31:02] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 221 ms returned sat
[2023-03-09 18:31:25] [INFO ] After 21651ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 18:31:25] [INFO ] State equation strengthened by 49692 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:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-09 18:31:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 18:31:25] [INFO ] After 25471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 6511 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6511 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 6378 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
[2023-03-09 18:31:38] [INFO ] Invariant cache hit.
[2023-03-09 18:31:39] [INFO ] Implicit Places using invariants in 1017 ms returned []
Implicit Place search using SMT only with invariants took 1018 ms to find 0 implicit places.
[2023-03-09 18:31:39] [INFO ] Invariant cache hit.
[2023-03-09 18:31:40] [INFO ] Dead Transitions using invariants and state equation in 1132 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8536 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Knowledge obtained : [(AND (NOT p0) p3 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 240 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 33278 reset in 8918 ms.
Product exploration explored 100000 steps with 33307 reset in 7924 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 10607 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10607/10607 places, 50004/50004 transitions.
Applied a total of 0 rules in 6081 ms. Remains 10607 /10607 variables (removed 0) and now considering 50004/50004 (removed 0) transitions.
[2023-03-09 18:32:05] [INFO ] Flow matrix only has 40306 transitions (discarded 9698 similar events)
// Phase 1: matrix 40306 rows 10607 cols
[2023-03-09 18:32:13] [INFO ] Computed 102 place invariants in 8856 ms
[2023-03-09 18:32:14] [INFO ] Dead Transitions using invariants and state equation in 9913 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16000 ms. Remains : 10607/10607 places, 50004/50004 transitions.
Built C files in :
/tmp/ltsmin8496791321992194988
[2023-03-09 18:32:15] [INFO ] Built C files in 389ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8496791321992194988
Running compilation step : cd /tmp/ltsmin8496791321992194988;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8496791321992194988;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8496791321992194988;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 10607 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10607/10607 places, 50004/50004 transitions.
Applied a total of 0 rules in 6013 ms. Remains 10607 /10607 variables (removed 0) and now considering 50004/50004 (removed 0) transitions.
[2023-03-09 18:32:24] [INFO ] Flow matrix only has 40306 transitions (discarded 9698 similar events)
[2023-03-09 18:32:24] [INFO ] Invariant cache hit.
[2023-03-09 18:32:25] [INFO ] Implicit Places using invariants in 1223 ms returned []
Implicit Place search using SMT only with invariants took 1225 ms to find 0 implicit places.
[2023-03-09 18:32:25] [INFO ] Flow matrix only has 40306 transitions (discarded 9698 similar events)
[2023-03-09 18:32:25] [INFO ] Invariant cache hit.
[2023-03-09 18:32:26] [INFO ] Dead Transitions using invariants and state equation in 1020 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8263 ms. Remains : 10607/10607 places, 50004/50004 transitions.
Built C files in :
/tmp/ltsmin18231468572805926962
[2023-03-09 18:32:27] [INFO ] Built C files in 291ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18231468572805926962
Running compilation step : cd /tmp/ltsmin18231468572805926962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin18231468572805926962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin18231468572805926962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-09 18:32:32] [INFO ] Flatten gal took : 1109 ms
[2023-03-09 18:32:33] [INFO ] Flatten gal took : 878 ms
[2023-03-09 18:32:33] [INFO ] Time to serialize gal into /tmp/LTL6194703035028266243.gal : 126 ms
[2023-03-09 18:32:33] [INFO ] Time to serialize properties into /tmp/LTL12266679938254486824.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6194703035028266243.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9301848741825582422.hoa' '-atoms' '/tmp/LTL12266679938254486824.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12266679938254486824.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9301848741825582422.hoa
Detected timeout of ITS tools.
[2023-03-09 18:32:49] [INFO ] Flatten gal took : 997 ms
[2023-03-09 18:32:50] [INFO ] Flatten gal took : 903 ms
[2023-03-09 18:32:50] [INFO ] Time to serialize gal into /tmp/LTL13162088312391117184.gal : 155 ms
[2023-03-09 18:32:50] [INFO ] Time to serialize properties into /tmp/LTL4777409722916318739.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13162088312391117184.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4777409722916318739.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("(Node30GiveAnswer32>=2)"))||(X(("((Node65GiveAnswer10>=3)||(Node88GiveAnswer47<=Node67GiveAnswer48))")||((X(G("(Node65GiveAns...223
Formula 0 simplified : F(G!"(Node30GiveAnswer32>=2)" & X(!"((Node65GiveAnswer10>=3)||(Node88GiveAnswer47<=Node67GiveAnswer48))" & XF!"(Node65GiveAnswer10>=...207
Detected timeout of ITS tools.
[2023-03-09 18:33:06] [INFO ] Flatten gal took : 841 ms
[2023-03-09 18:33:06] [INFO ] Applying decomposition
[2023-03-09 18:33:07] [INFO ] Flatten gal took : 740 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph680700097382735139.txt' '-o' '/tmp/graph680700097382735139.bin' '-w' '/tmp/graph680700097382735139.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph680700097382735139.bin' '-l' '-1' '-v' '-w' '/tmp/graph680700097382735139.weights' '-q' '0' '-e' '0.001'
[2023-03-09 18:33:10] [INFO ] Decomposing Gal with order
[2023-03-09 18:33:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 18:33:17] [INFO ] Removed a total of 39762 redundant transitions.
[2023-03-09 18:33:18] [INFO ] Flatten gal took : 6649 ms
[2023-03-09 18:33:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 29500 labels/synchronizations in 12354 ms.
[2023-03-09 18:33:33] [INFO ] Time to serialize gal into /tmp/LTL14492764747510405696.gal : 157 ms
[2023-03-09 18:33:33] [INFO ] Time to serialize properties into /tmp/LTL16449369870589804056.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14492764747510405696.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16449369870589804056.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F("(gi0.gu33.Node30GiveAnswer32>=2)"))||(X(("((gi0.gu11.Node65GiveAnswer10>=3)||(gu101.Node88GiveAnswer47<=gu101.Node67GiveAnswe...274
Formula 0 simplified : F(G!"(gi0.gu33.Node30GiveAnswer32>=2)" & X(!"((gi0.gu11.Node65GiveAnswer10>=3)||(gu101.Node88GiveAnswer47<=gu101.Node67GiveAnswer48)...258
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1045152650062808710
[2023-03-09 18:33:49] [INFO ] Built C files in 385ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1045152650062808710
Running compilation step : cd /tmp/ltsmin1045152650062808710;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1045152650062808710;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1045152650062808710;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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-100-LTLCardinality-07 finished in 413705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p0) U p1)||X(G(!p0))||X(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-09 18:33:53] [INFO ] Flatten gal took : 1215 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17558119779502220816
[2023-03-09 18:33:54] [INFO ] Too many transitions (60600) to apply POR reductions. Disabling POR matrices.
[2023-03-09 18:33:54] [INFO ] Built C files in 469ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17558119779502220816
Running compilation step : cd /tmp/ltsmin17558119779502220816;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-09 18:33:54] [INFO ] Applying decomposition
[2023-03-09 18:33:56] [INFO ] Flatten gal took : 1447 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1490100691365938139.txt' '-o' '/tmp/graph1490100691365938139.bin' '-w' '/tmp/graph1490100691365938139.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1490100691365938139.bin' '-l' '-1' '-v' '-w' '/tmp/graph1490100691365938139.weights' '-q' '0' '-e' '0.001'
[2023-03-09 18:33:59] [INFO ] Decomposing Gal with order
[2023-03-09 18:34:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 18:34:06] [INFO ] Removed a total of 30066 redundant transitions.
[2023-03-09 18:34:07] [INFO ] Flatten gal took : 4241 ms
[2023-03-09 18:34:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 19618 labels/synchronizations in 5882 ms.
[2023-03-09 18:34:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality9748792414276861177.gal : 181 ms
[2023-03-09 18:34:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality11844970674505456265.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9748792414276861177.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11844970674505456265.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 5 LTL properties
Checking formula 0 : !((F(G("(gi0.gi91.gu246.Node31GiveAnswer61<1)"))))
Formula 0 simplified : GF!"(gi0.gi91.gu246.Node31GiveAnswer61<1)"
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/ltsmin17558119779502220816;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 144 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17558119779502220816;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 144 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)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 6192420 kB
After kill :
MemTotal: 16393356 kB
MemFree: 15950748 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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is CANInsertWithFailure-PT-100, 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 r037-tajo-167813690800779"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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